Submission #371322

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <queue>
#include <complex>

#define INF 2147483647
#define EPS 1e-9
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long

using namespace std;

#define MAX_S 5001

string S;
int num = 0;
string str[MAX_S];

void div(){

	num = 0;
	
	for (int i = 0; i < S.length(); ){
		
		for (int j = i + 1; j <= S.length(); j++){
			
			if (j == S.length()){
				
				str[num] = S.substr(i, j-i);

				i = j + 1;
				num++;

				break;

			}

			else if(S[j] == ' '){
				
				str[num] = S.substr(i, j - i);

				i = j + 1;
				num++;

				break;

			}

		}

	}

}

stack<string> S1;

void solve(){
	
	for (int i = 0; i < num; i++){
		
		if (str[i] == "not"){
			S1.push("not");
		}

		else{
			
			while (S1.size() >= 2){
				
				string p1 = S1.top();
				S1.pop();
				string p2 = S1.top();
				S1.pop();

				if (p1 == p2 && p2 == "not")
					continue;

				else{
					S1.push(p2);
					S1.push(p1);
				}

			}

			S1.push(str[i]);

		}

	}

}

int main(){

	getline(cin, S);

	div();

	solve();

	vector<string> ans;

	while (S1.size()){
		ans.push_back(S1.top());
		S1.pop();
	}

	reverse(ans.begin(), ans.end());

	for (int i = 0; i < ans.size(); i++){
		cout << ans[i];
		if (i < num - 1)
			cout << " ";
	}
	cout << endl;

	return 0;


}

Submission Info

Judge Result