Submission #371223

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;

string s[5000];

int main() {
    int n = 0;
    while (cin >> s[n]) {
        n++;
    }
    string ans;
    for (int i = 0; i < n; i++) {
        // 文字列がnotの場合
        if (s[i] == "not") {
            int cnt = 0;
            int cur = i;
            while (s[cur] == "not" && cur < n) {
                cur++;
                cnt++;
            }
            if (cur != n) {
                for (int j = 0; j < cnt%2; j++) {
                    ans += "not ";
                }
            } else {
                for (int j = i; j < n; j++) {
                    if (j != n-1) ans += "not ";
                    else ans += "not";
                }
            }
            i = cur-1;
        } else {
            if (i != n-1) {
                ans += s[i];
                ans += " ";
            }
            else ans += s[i];
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result