Submission #1845618


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <algorithm>
#define rep(i, a, b) for (int i = (a), _ = (b); i <= _; ++ i)
#define per(i, a, b) for (int i = (a), _ = (b); i >= _; -- i)
#define For(i, a, b) for (int i = (a), _ = (b); i < _; ++ i)
#define fore(e, u, v) for (int p = e(u), v = e[p].y; p; v = e[p = e[p].nxt].y)
#define ri rd<int>
using namespace std;
const int maxN = 3007;

template<class T> inline T rd() {
	bool f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == '-') f = 0;
	T x = 0; for (; isdigit(c); c = getchar()) x = x * 10 + c - 48; return f ? x : -x;
}

int n;
int val[maxN], q[maxN], tt;
bool f[maxN];

struct vec {
	static const int maxE = maxN;
	int g[maxN], te;
	struct edge {int y, nxt;} e[maxE << 1];
	inline void push(int x, int y) { e[++te] = (edge){y, g[x]}; g[x] = te; }
	inline void link(int x, int y) { push(x, y), push(y, x); }
	inline int& operator () (int x) { return g[x]; }
	inline edge& operator [] (int x) { return e[x]; }
}e;

void dfs(int x, int fa) {
	f[x] = 0;
	fore (e, x, y) if (y != fa) {
		dfs(y, x);
		if (f[y] == 0 && val[x] > val[y]) f[x] = 1;
	}
}

int main() {

	n = ri();
	rep (i, 1, n) val[i] = ri();
	For (i, 1, n) e.link(ri(), ri());

	rep (i, 1, n) {
		dfs(i, 0);
		if (f[i]) q[++tt] = i;
	}
	
	rep (i, 1, tt) printf("%d%c", q[i], " \n"[i == tt]);

	return 0;
}

Submission Info

Submission Time
Task F - Tree Game
User acha
Language C++14 (GCC 5.4.1)
Score 1600
Code Size 1449 Byte
Status AC
Exec Time 153 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1600 / 1600
Status
AC × 3
AC × 56
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All 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
Case Name Status Exec Time Memory
in1.txt AC 148 ms 256 KB
in10.txt AC 147 ms 256 KB
in11.txt AC 145 ms 256 KB
in12.txt AC 6 ms 256 KB
in13.txt AC 8 ms 256 KB
in14.txt AC 149 ms 256 KB
in15.txt AC 145 ms 256 KB
in16.txt AC 148 ms 256 KB
in17.txt AC 147 ms 256 KB
in18.txt AC 147 ms 256 KB
in19.txt AC 145 ms 256 KB
in2.txt AC 148 ms 256 KB
in20.txt AC 148 ms 256 KB
in21.txt AC 153 ms 384 KB
in22.txt AC 151 ms 384 KB
in23.txt AC 148 ms 384 KB
in24.txt AC 151 ms 384 KB
in25.txt AC 152 ms 384 KB
in26.txt AC 150 ms 384 KB
in27.txt AC 151 ms 384 KB
in28.txt AC 152 ms 384 KB
in29.txt AC 151 ms 384 KB
in3.txt AC 145 ms 256 KB
in30.txt AC 151 ms 384 KB
in31.txt AC 53 ms 256 KB
in32.txt AC 61 ms 256 KB
in33.txt AC 68 ms 256 KB
in34.txt AC 74 ms 256 KB
in35.txt AC 65 ms 256 KB
in36.txt AC 0 ms 128 KB
in37.txt AC 0 ms 128 KB
in38.txt AC 0 ms 128 KB
in39.txt AC 0 ms 128 KB
in4.txt AC 147 ms 256 KB
in40.txt AC 141 ms 256 KB
in41.txt AC 142 ms 256 KB
in42.txt AC 142 ms 256 KB
in43.txt AC 141 ms 256 KB
in44.txt AC 142 ms 256 KB
in45.txt AC 118 ms 256 KB
in46.txt AC 120 ms 256 KB
in47.txt AC 147 ms 256 KB
in48.txt AC 147 ms 256 KB
in49.txt AC 148 ms 256 KB
in5.txt AC 52 ms 256 KB
in50.txt AC 146 ms 256 KB
in6.txt AC 146 ms 256 KB
in7.txt AC 147 ms 256 KB
in8.txt AC 147 ms 256 KB
in9.txt AC 148 ms 256 KB
sample1.txt AC 0 ms 128 KB
sample2.txt AC 1 ms 128 KB
sample3.txt AC 0 ms 128 KB