Submission #371324

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include<cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include<bitset>

#define REP(i,b,n) for(int i=b;i<(int)n;i++)
#define rep(i,n)   REP(i,0,n)
#define ALL(C)     (C).begin(),(C).end()
#define FOR(it,o)  for(__typeof((o).begin()) it=(o).begin(); it!=(o).end(); ++it)
#define dbg(x) cout << __LINE__ << ' ' << #x << " = " << (x) << endl


typedef long long ll;

using namespace std;

//ハマったらチェックリスト見ろ!!

int main(){
    string s;
    vector<pair<string, int> > V;
    while(cin >> s){
        if(s == "not"){
            if(V.empty() || V.back().second == 0){
                V.push_back(make_pair("", 1));
            }
            else{
                V.back().second++;
            }
        }
        else{
            V.push_back(make_pair(s, 0));
        }
    }
    bool is_first = true;
    rep(i, V.size()){
        if(V[i].second == 0){
            if(!is_first)cout <<' ';
            cout << V[i].first;
            is_first = false;
        }else{
            if(i+1 < V.size()){
                V[i].second %= 2;
            }
            rep(j, V[i].second){
                if(j != 0 || !is_first)cout <<' ';
                is_first = false;
                cout << "not";
            }
        }
    }
    cout << endl;
return 0;
}

Submission Info

Judge Result