Submission #1338602

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 2147483600

int main(){
  vector<string> vec;
  string t;
  int c=0;
  while(cin>>t){
    vec.pb(t);
    if(t=="not") c++;
  }

  vector<string> ans;
  int n = vec.size();

  if(c == vec.size()) ans = vec;
  else {
    int cnt = 0;
    rep(i,n){
      bool b = vec[i]=="not";
      if(cnt>0 && !b){
        rep(j,cnt%2) ans.pb("not");
      }
      if(b) cnt++;
      else {
        cnt = 0;
        ans.pb(vec[i]);
      }
    }
  }

  n  =ans.size();
  rep(i,n) cout << ans[i] << " \n"[i==n-1];

  return 0;
}

Submission Info

Judge Result