Submission #7169229

---

Source Code Expand

#include<cstdio>
#include<iostream>
using namespace std;
string a[100000],ans[100000],n="not";
int ok[100000],k,l;
int main()
{
	while(cin>>a[++k])if(a[k]==n)ok[k]=1;
	for(int i=k; i>=1;)
	{
		if(ok[i])
		{
			int p=1;
			for(int j=i-1; j>=1; --j)
				if(ok[j])p++; else break;
			if(p==1)
			{
				ans[++l]=n,i--;
				continue;
			}
			else if(p%2==0)
			{
				i-=p;
				continue;
			}
			else
			{
				ans[++l]=ans[++l]=ans[++l]=n;
				i-=p;
				continue;
			}
		}
		else ans[++l]=a[i],i--;
	}
	for(int i=l; i>=1; i--)
		cout<<ans[i]<<" ";
	return 0;
}

Submission Info

Judge Result