Submission #4540926


Source Code Expand

#include<iostream>
#include<cstdio>
bool judge[10010];
std::string a[10010],c="not";
int n=0;
void print()
{
	int t=0;
	for(int k=1;k<=n;k++)
	{
		if(judge[k]) ++t;
	}
	for(int k=1;k<=n;k++)
	{
		if(judge[k]&&t>1) t--,std::cout<<a[k]<<' ';
		else if(judge[k]){
			std::cout<<a[k];
			return;
		}
	}
}
int main()
{
	int i,j;
	while(std::cin>>a[++n]) judge[n]=1;
	n--;
	for(i=1;i<=n;i++)
	{
		if(a[i]=="not")
		for(j=i+1;j<=n;j++)
		{
			if(a[j]=="not")
			{
				judge[i]=judge[j]=0;
				i=j;
				break;
			}
			if(j==n)
			{
				print();
//				cout<<"huhu";
				return 0;
			}
		}
	}
	print();
//	cout<<"huhu";
	return 0;
}

Submission Info

Submission Time
Task A - 二重否定除去法則
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 0
Code Size 670 Byte
Status WA
Exec Time 2 ms
Memory 384 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
WA × 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 WA 1 ms 384 KB
scrambled_01.txt WA 1 ms 256 KB
scrambled_02.txt WA 1 ms 256 KB
scrambled_03.txt WA 1 ms 384 KB
scrambled_04.txt WA 1 ms 256 KB
scrambled_05.txt WA 2 ms 384 KB
scrambled_06.txt WA 2 ms 384 KB
scrambled_07.txt WA 2 ms 384 KB
scrambled_08.txt WA 2 ms 384 KB
scrambled_09.txt WA 2 ms 384 KB
scrambled_10.txt WA 2 ms 384 KB
scrambled_11.txt WA 2 ms 384 KB
scrambled_12.txt WA 2 ms 384 KB
scrambled_13.txt WA 2 ms 384 KB
scrambled_14.txt WA 2 ms 384 KB
scrambled_15.txt WA 2 ms 384 KB
scrambled_16.txt WA 2 ms 384 KB
scrambled_17.txt WA 2 ms 384 KB
scrambled_18.txt WA 2 ms 384 KB