Submission #371350

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <climits>
using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RREP(i,n) for(int i=(int)n-1; i>=0; i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)
#define ALL(c) (c).begin(), (c).end()

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > pipii;
typedef vector<int> vi;

const int INF = 1e9;
const int MOD = 1e9+7;

int main(void){
    vector<string> ss;
	string s;
    while(cin >> s) ss.push_back(s);
    
    if(ss.size() <= 2){
        REP(i, ss.size()){
            if(!i) cout << ss[i];
            else cout << " " << ss[i];
        }
        cout << endl;
        return 0;
    }
    bool f = true;
    while(f){
        f = false;
        vector<string> sss;
        int i = 0;
        if(ss.size() <= 2) break;
        for(;i < ss.size() - 2;i++){
            if(ss[i] == "not" && ss[i+1] == "not" && ss[i+2] != "not"){
                f = true;
                sss.push_back(ss[i + 2]);
                i += 2;
            }
            else sss.push_back(ss[i]);
        }
        for(; i < ss.size(); i++) sss.push_back(ss[i]);
        ss = sss;
    }
    for(int i = 0; i < ss.size(); i++){
        if(!i) cout << ss[i];
        else cout << " " << ss[i];
    }
    cout << endl;
    return 0;
}

Submission Info

Judge Result