Submission #1306289
Source Code Expand
#include <stdio.h> #include <string.h> #include <iostream> #include <string> #include <algorithm> #include <vector> #include <map> #include <unordered_set> #include <unordered_map> #include <queue> #include <functional> using namespace std; typedef long long ll; typedef vector<int> vint; typedef pair<int,int> pint; typedef vector<pint> vpint; #define rep(i,n) for(int i=0;i<(n);i++) #define REP(i,n) for(int i=n-1;i>=(0);i--) #define reps(i,f,n) for(int i=(f);i<(n);i++) #define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++) #define all(v) (v).begin(),(v).end() #define eall(v) unique(all(v), v.end()) #define pb push_back #define mp make_pair #define fi first #define se second #define chmax(a, b) a = (((a)<(b)) ? (b) : (a)) #define chmin(a, b) a = (((a)>(b)) ? (b) : (a)) const int MOD = 1e9 + 7; const int INF = 1e9; const ll INFF = 1e18; int main(void){ string a; vector<string> s; while(cin >> a) s.push_back(a); int k = s.size(); while(1){ bool f = false; for (int i = 0; i < k; ++i) { // printf("i %d\n", i); if(s[i] == "not" && s[i + 1] == "not" && s[i + 2] != "not"){ // printf("i %d\n", i); s.erase(s.begin() + i); s.erase(s.begin() + i); k -= 2; f = true; break; } } if(!f)break; } // printf("k\n"); for (auto &u : s) cout << u << " "; printf("\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 二重否定除去法則 |
User | mmxsrup |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1411 Byte |
Status | RE |
Exec Time | 98 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | scrambled_00.txt, scrambled_01.txt, scrambled_02.txt, scrambled_03.txt, scrambled_04.txt, scrambled_05.txt, scrambled_06.txt, scrambled_07.txt, scrambled_08.txt, scrambled_09.txt, scrambled_10.txt, scrambled_11.txt, scrambled_12.txt, scrambled_13.txt, scrambled_14.txt, scrambled_15.txt, scrambled_16.txt, scrambled_17.txt, scrambled_18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
scrambled_00.txt | WA | 1 ms | 256 KB |
scrambled_01.txt | RE | 97 ms | 256 KB |
scrambled_02.txt | RE | 98 ms | 256 KB |
scrambled_03.txt | WA | 1 ms | 256 KB |
scrambled_04.txt | WA | 1 ms | 256 KB |
scrambled_05.txt | WA | 13 ms | 256 KB |
scrambled_06.txt | RE | 97 ms | 256 KB |
scrambled_07.txt | WA | 12 ms | 256 KB |
scrambled_08.txt | WA | 12 ms | 256 KB |
scrambled_09.txt | WA | 1 ms | 256 KB |
scrambled_10.txt | WA | 1 ms | 256 KB |
scrambled_11.txt | WA | 1 ms | 256 KB |
scrambled_12.txt | WA | 2 ms | 256 KB |
scrambled_13.txt | WA | 2 ms | 256 KB |
scrambled_14.txt | WA | 2 ms | 256 KB |
scrambled_15.txt | WA | 2 ms | 256 KB |
scrambled_16.txt | WA | 2 ms | 256 KB |
scrambled_17.txt | WA | 2 ms | 256 KB |
scrambled_18.txt | WA | 2 ms | 256 KB |