Submission #371294

---

Source Code Expand

/* attention to overflow */
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstdio>
#include <queue>
#include <sstream>
#include <set>
#include <map>
#include <cmath>
#include <numeric>
#include <tuple>
#include <iomanip>

#define dump(x) cerr<< #x << " = " << x <<endl

using namespace std;
const int INF = 1 << 25;
void io() { cin.tie(0); ios::sync_with_stdio(false);}
/*printf("%.9Lf\n",cf);*/
const int MOD = 1000000007;


string nt="not";

int main() {
	io();
	vector <string> a;
	string s;
	getline(cin,s);
	//cerr<<s<<endl;
	int l=0;
	for(int i=0;i<s.size();i++){
		if(s[i]==' '){
			//cerr<<i<<' '<<l<<endl;
			a.push_back(s.substr(l,i-l));
			l=i+1;
		}
		if(i==s.size()-1){
			a.push_back(s.substr(l,s.size()-l));
		}
	}
	/*for(int i=0;i<a.size();i++){
		cerr<<a[i]<<endl;
	}*/

	reverse(a.begin(),a.end());
	/*for(int i=0;i<a.size();i++){
		cerr<<a[i]<<endl;
	}*/
	for(int i=0;;){
		if(i+2>=a.size()) break;
		if(a[i]!=nt && a[i+1]==nt && a[i+2]==nt){
			a.erase(a.begin()+i+1,a.begin()+i+3);
			//cerr<<i*10<<endl;
		}else{
			i++;
			//cerr<<i<<endl;
		}
	}

	reverse(a.begin(),a.end());
	for(int i=0;i<a.size();i++){
		cout<<a[i]<<' ';
	}
	cout<<endl;

	return 0;
}

Submission Info

Judge Result