Submission #4541091
Source Code Expand
#include<cstdio> #include<iostream> using namespace std; string a,s[10010],no="not"; int n; bool vis[10010]; int main(){ while(cin>>a) { s[++n]=a; } int last; for(int i=n-2;i>=1;i--) { if(!vis[i+2]) { last = i + 2; } if(s[i]==no&&s[i+1]==no&&s[last]!=no) { vis[i] = vis[i + 1] = 1; i--; } } int t=n; while(vis[t]){ t--; } for(int i=1;i<=n;i++) { if(!vis[i]){ cout<<s[i]; if(i!=t) { cout<<" "; } else{ cout<<endl; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 二重否定除去法則 |
User | luogu_bot1 |
Language | C++ (GCC 5.4.1) |
Score | 100 |
Code Size | 703 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 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 | AC | 1 ms | 384 KB |
scrambled_01.txt | AC | 1 ms | 384 KB |
scrambled_02.txt | AC | 1 ms | 384 KB |
scrambled_03.txt | AC | 1 ms | 384 KB |
scrambled_04.txt | AC | 1 ms | 384 KB |
scrambled_05.txt | AC | 2 ms | 384 KB |
scrambled_06.txt | AC | 2 ms | 384 KB |
scrambled_07.txt | AC | 2 ms | 384 KB |
scrambled_08.txt | AC | 2 ms | 384 KB |
scrambled_09.txt | AC | 2 ms | 384 KB |
scrambled_10.txt | AC | 2 ms | 384 KB |
scrambled_11.txt | AC | 2 ms | 384 KB |
scrambled_12.txt | AC | 2 ms | 384 KB |
scrambled_13.txt | AC | 2 ms | 384 KB |
scrambled_14.txt | AC | 2 ms | 384 KB |
scrambled_15.txt | AC | 2 ms | 384 KB |
scrambled_16.txt | AC | 2 ms | 384 KB |
scrambled_17.txt | AC | 2 ms | 384 KB |
scrambled_18.txt | AC | 2 ms | 384 KB |