Submission #371944


Source Code Expand

#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>

using namespace std;

#define reE(i,a,b) for(auto (i)=(a);(i)<=(b);(i)++)
#define rE(i,b) reE(i,0,b)
#define reT(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rT(i,b) reT(i,0,b)
#define rep(i,a,b) reE(i,a,b);
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define fe(i,b) for (auto &(x):b);
#define itr(i,b) for(auto (i)=(b).begin();(i)!=(b).end();++(i))
#define rti(i,b) for(auto (i)=(b).rbegin();(i)!=(b).rend();++(i))
#define LL long long
#define all(b) (b).begin(),(b).end()

#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line  getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num

#define dir(xx,yy,x,y,i) (xx)=(x)+dir[(i)],(yy)=(y)+dir[(i)+1]

typedef complex<double> P;
typedef vector<P> Poly;

const LL INF = 1 << 30;
const double eps = 1e-8;
const int dir[] = { 0, 1, 0, -1, 0 };

int main(void){
	vector<string> str(5010);
	int h = 2;
	while (cin >>str[h]){
		while (str[h] != "not"&&str[h - 1] == "not"&&str[h - 2] == "not"){
			str[h - 2] = str[h];
			h = h - 2;
		}
		h++;
	}
	reT(i, 2, h){
		cout << str[i];
		if (i >= h - 1)cout << endl;
		else cout << " ";
	}


	return(0);
}

Submission Info

Submission Time
Task A - 二重否定除去法則
User btk15049
Language C++11 (GCC 4.9.2)
Score 100
Code Size 1635 Byte
Status AC
Exec Time 28 ms
Memory 932 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 19
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 27 ms 768 KB
scrambled_01.txt AC 24 ms 928 KB
scrambled_02.txt AC 24 ms 924 KB
scrambled_03.txt AC 24 ms 928 KB
scrambled_04.txt AC 24 ms 796 KB
scrambled_05.txt AC 25 ms 836 KB
scrambled_06.txt AC 24 ms 800 KB
scrambled_07.txt AC 25 ms 924 KB
scrambled_08.txt AC 28 ms 924 KB
scrambled_09.txt AC 23 ms 932 KB
scrambled_10.txt AC 26 ms 928 KB
scrambled_11.txt AC 25 ms 928 KB
scrambled_12.txt AC 26 ms 800 KB
scrambled_13.txt AC 28 ms 928 KB
scrambled_14.txt AC 25 ms 920 KB
scrambled_15.txt AC 25 ms 792 KB
scrambled_16.txt AC 26 ms 860 KB
scrambled_17.txt AC 24 ms 924 KB
scrambled_18.txt AC 25 ms 920 KB