Submission #1219663

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <stack>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

vector<string> S;
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  while (true) {
    string s;
    if (!(cin >> s)) break;
    S.pb(s);
  }
  stack<string> T;
  int i = S.size()-1;
  while (i>=0 && S[i] == "not") {
    T.push(S[i]);
    i--;
  }
  int c = 0;
  while (i>=0) {
    if (S[i] == "not") c++;
    else {
      c %= 2;
      rep(i, c) T.push("not");
      c = 0;
      T.push(S[i]);
    }
    i--;
  }
  c %= 2;
  rep(i, c) T.push("not");
  while (!T.empty()) {
    cout << T.top() << (T.size()==1?"\n":" ");
    T.pop();
  }
  return 0;
}

Submission Info

Judge Result