AtCoder Grand Contest 010

Submission #1357971

Source codeソースコード

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<queue>
#include<set>
using namespace std;
typedef long long LL;
const int N=3010;
int gi() {
	int w=0;bool q=1;char c=getchar();
	while ((c<'0'||c>'9') && c!='-') c=getchar();
	if (c=='-') q=0,c=getchar();
	while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar();
	return q? w:-w;
}
int s[N],deg[N],q[N];
bool win[N];
int head[N],nxt[N],to[N];
int main()
{
	int n=gi(),i,a,b,tot=0,l=0,r=0,k;
	for (i=1;i<=n;i++) s[i]=gi();
	for (i=1;i<n;i++) {
		a=gi(),b=gi();
		if (s[a]>s[b]) swap(a,b);
		if (s[a]<s[b])
			deg[to[++tot]=b]++,nxt[tot]=head[a],head[a]=tot;
	}
	for (i=1;i<=n;i++) if (!deg[i]) q[++r]=i;
	while (l!=r)
		for (i=head[k=q[++l]];i;i=nxt[i]) {
			win[to[i]]|=!win[k];
			if (!--deg[to[i]]) q[++r]=to[i];
		}
	for (i=1;i<=n;i++) if (win[i]) printf("%d ",i);
	return 0;
}

Submission

Task問題 F - Tree Game
User nameユーザ名 laofu
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 1600
Source lengthソースコード長 968 Byte
File nameファイル名
Exec time実行時間 2 ms
Memory usageメモリ使用量 384 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - sample1.txt,sample2.txt,sample3.txt
All 1600 / 1600 sample1.txt,sample2.txt,sample3.txt,in1.txt,in10.txt,in11.txt,in12.txt,in13.txt,in14.txt,in15.txt,in16.txt,in17.txt,in18.txt,in19.txt,in2.txt,in20.txt,in21.txt,in22.txt,in23.txt,in24.txt,in25.txt,in26.txt,in27.txt,in28.txt,in29.txt,in3.txt,in30.txt,in31.txt,in32.txt,in33.txt,in34.txt,in35.txt,in36.txt,in37.txt,in38.txt,in39.txt,in4.txt,in40.txt,in41.txt,in42.txt,in43.txt,in44.txt,in45.txt,in46.txt,in47.txt,in48.txt,in49.txt,in5.txt,in50.txt,in6.txt,in7.txt,in8.txt,in9.txt,sample1.txt,sample2.txt,sample3.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
in1.txt AC 2 ms 384 KB
in10.txt AC 2 ms 256 KB
in11.txt AC 2 ms 256 KB
in12.txt AC 1 ms 256 KB
in13.txt AC 1 ms 256 KB
in14.txt AC 2 ms 256 KB
in15.txt AC 2 ms 256 KB
in16.txt AC 2 ms 384 KB
in17.txt AC 2 ms 384 KB
in18.txt AC 2 ms 256 KB
in19.txt AC 2 ms 384 KB
in2.txt AC 2 ms 256 KB
in20.txt AC 2 ms 256 KB
in21.txt AC 2 ms 256 KB
in22.txt AC 2 ms 256 KB
in23.txt AC 2 ms 384 KB
in24.txt AC 2 ms 256 KB
in25.txt AC 2 ms 256 KB
in26.txt AC 2 ms 384 KB
in27.txt AC 2 ms 384 KB
in28.txt AC 2 ms 384 KB
in29.txt AC 2 ms 384 KB
in3.txt AC 2 ms 256 KB
in30.txt AC 2 ms 256 KB
in31.txt AC 2 ms 256 KB
in32.txt AC 2 ms 256 KB
in33.txt AC 2 ms 256 KB
in34.txt AC 2 ms 256 KB
in35.txt AC 2 ms 256 KB
in36.txt AC 1 ms 256 KB
in37.txt AC 1 ms 256 KB
in38.txt AC 1 ms 256 KB
in39.txt AC 1 ms 256 KB
in4.txt AC 2 ms 256 KB
in40.txt AC 2 ms 384 KB
in41.txt AC 2 ms 384 KB
in42.txt AC 2 ms 256 KB
in43.txt AC 2 ms 384 KB
in44.txt AC 2 ms 256 KB
in45.txt AC 2 ms 256 KB
in46.txt AC 1 ms 256 KB
in47.txt AC 2 ms 256 KB
in48.txt AC 2 ms 256 KB
in49.txt AC 2 ms 256 KB
in5.txt AC 2 ms 256 KB
in50.txt AC 2 ms 256 KB
in6.txt AC 2 ms 256 KB
in7.txt AC 2 ms 256 KB
in8.txt AC 2 ms 256 KB
in9.txt AC 2 ms 384 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB