Submission #371309

---

Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<climits>
#include<string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reg(i,a,b) for(int i=(a);i<=(b);i++)
#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--)
#define ireg(i,a,b) for(int i=(b);i>=(a);i--)
typedef long long int lli;
typedef pair<int,int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX

vector<string> s;

int  main(void){
	string iis;
	char is[5005];
	getline(cin,iis);
	string ns ="";
	rep(i,iis.size()){
		if(iis[i]!=' ')ns+=iis[i];
		else{
			s.push_back(ns);
			ns = "";
		}
	}
	s.push_back(ns);
	/*
	rep(i,s.size()){
		printf("%s ",s[i].c_str());
	}*/
	/*
	while(scanf("%s%\n",is)!=EOF){
		s.push_back(string(is));
	}*/
	
	string no = "not";
	
	int p = s.size(); p--;
	while(1){
		if(p<=1)break;
		if(s[p]!=no && s[p-1]==no && s[p-2]==no){
			s.erase(s.begin()+p-2);
			s.erase(s.begin()+p-2);
			p-=2;
		}
		else p--;
		//printf("%d\n",p);
	}
	
	rep(i,s.size()){
		printf("%s%c",s[i].c_str(),((i+1==s.size())?'\n':' '));
	}
		
		
	
	
		
	return 0;
}

Submission Info

Judge Result