Submission #371320

---

Source Code Expand

#include<vector>
#include<map>
#include<climits>
#include<set>
#include<queue>
#include<stack>
#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<bitset>
#include<cstring>
#include<list>
#include<ctime>
#include<iterator>
using namespace std;
typedef vector<string>vs;
typedef vector<int>vi;
typedef vector<vi>vvi;
typedef vector<double>vd;
typedef pair<int,int>pii;
typedef long long ll;
typedef pair<ll,ll>pll;
typedef vector<ll>vl;
#define rrep(i,x,n) for(int i=(x);i<(n);++i)
#define rep(i,x) rrep(i,0,(x))
#define fi first
#define se second
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define pb push_back
#define maxs(a,b) (a)=max(a,b)
#define mins(a,b) (a)=min(a,b)

int main(){

    vs V;
    string str;
    getline(cin,str);

    stringstream ss(str);
    while(ss){
        ss>>str;
        V.pb(str);
    }
    V.pop_back();
    string N="not";
    while(true){
        bool flag=false;
        vs next;
        rep(i,V.size()){
            if(i<V.size()-2){
                if(V[i]==N&&V[i+1]==N&&V[i+2]!=N){
                    i++;
                    flag=true;
                    continue;
                }
            }
            next.pb(V[i]);
        }
        V=next;
        if(!flag)break;
    }

    rep(i,V.size()){
        if(i)cout<<" ";
        cout<<V[i];
    }
    cout<<endl;
    return 0;
}

Submission Info

Judge Result