Submission #9029626


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <vector>

const int MN = 100005;

int N;
std::vector<int> G[MN];
int dep[MN], faz[MN], o[MN], cnt[MN], tp;

void DFS(int u, int fz) {
	dep[u] = dep[faz[u] = fz] + 1;
	for (auto v : G[u]) if (v != fz) DFS(v, u);
}

int main() {
	scanf("%d", &N);
	for (int i = 1, x, y; i < N; ++i)
		scanf("%d%d", &x, &y),
		G[x].push_back(y),
		G[y].push_back(x);
	DFS(1, 0);
	int u = 0, v = 0;
	for (int i = 1; i <= N; ++i) if (dep[u] < dep[i]) u = i;
	DFS(u, 0);
	for (int i = 1; i <= N; ++i) if (dep[v] < dep[i]) v = i;
	for (int x = v; x != u; x = faz[x]) o[x] = ++tp;
	o[u] = ++tp;
	for (int i = 1; i <= N; ++i) if (!o[i]) {
		if (G[i].size() == 1) ++cnt[o[G[i][0]]];
		else return puts("-1"), 0;
	}
	int rev = 0;
	for (int i = 1, j = tp; i < j; ++i, --j)
		if (cnt[i] != cnt[j]) { rev = cnt[i] > cnt[j]; break; }
	if (rev) std::reverse(cnt + 1, cnt + tp + 1);
	int now = 1;
	for (int i = 1; i <= tp; ++i) {
		for (int j = 1; j <= cnt[i]; ++j) printf("%d ", now + j);
		printf("%d ", now), now += cnt[i] + 1;
	}
	return 0;
}

Submission Info

Submission Time
Task F - Permutation Tree
User PinkRabbit
Language C++14 (GCC 5.4.1)
Score 900
Code Size 1102 Byte
Status AC
Exec Time 65 ms
Memory 12160 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:21:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   G[y].push_back(x);
                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 900 / 900
Status
AC × 3
AC × 55
Set Name Test Cases
Sample sample1.txt, sampleId.txt, sampleNo.txt
All id.txt, oshii_0.txt, oshii_1.txt, rnd10000_9876.txt, rnd10_4.txt, rnd10_l.txt, rnd20000_9876.txt, rnd20_18.txt, rnd20_4.txt, rnd20_l.txt, rnd3000_2984.txt, rnd3000_l.txt, rnd_0.txt, rnd_1.txt, rnd_10.txt, rnd_100.txt, rnd_1000.txt, rnd_10000.txt, rnd_100000.txt, rnd_1000000.txt, rnd_1000001.txt, rnd_1000002.txt, rnd_100001.txt, rnd_100002.txt, rnd_10001.txt, rnd_10002.txt, rnd_1001.txt, rnd_1002.txt, rnd_101.txt, rnd_102.txt, rnd_2.txt, rnd_3.txt, rnd_4.txt, rnd_5.txt, rnd_6.txt, rnd_7.txt, rnd_70.txt, rnd_700.txt, rnd_7000.txt, rnd_70000.txt, rnd_700000.txt, rnd_700001.txt, rnd_700002.txt, rnd_70001.txt, rnd_70002.txt, rnd_7001.txt, rnd_7002.txt, rnd_701.txt, rnd_702.txt, rnd_71.txt, rnd_72.txt, sample1.txt, sampleId.txt, sampleNo.txt, star.txt
Case Name Status Exec Time Memory
id.txt AC 65 ms 12160 KiB
oshii_0.txt AC 43 ms 6656 KiB
oshii_1.txt AC 44 ms 6656 KiB
rnd10000_9876.txt AC 7 ms 3584 KiB
rnd10_4.txt AC 2 ms 2560 KiB
rnd10_l.txt AC 2 ms 2560 KiB
rnd20000_9876.txt AC 12 ms 4096 KiB
rnd20_18.txt AC 2 ms 2560 KiB
rnd20_4.txt AC 2 ms 2560 KiB
rnd20_l.txt AC 2 ms 2560 KiB
rnd3000_2984.txt AC 4 ms 2816 KiB
rnd3000_l.txt AC 3 ms 2688 KiB
rnd_0.txt AC 39 ms 6400 KiB
rnd_1.txt AC 36 ms 6016 KiB
rnd_10.txt AC 2 ms 2560 KiB
rnd_100.txt AC 2 ms 2560 KiB
rnd_1000.txt AC 3 ms 2688 KiB
rnd_10000.txt AC 6 ms 3072 KiB
rnd_100000.txt AC 40 ms 7548 KiB
rnd_1000000.txt AC 55 ms 9472 KiB
rnd_1000001.txt AC 62 ms 10112 KiB
rnd_1000002.txt AC 64 ms 11904 KiB
rnd_100001.txt AC 7 ms 3328 KiB
rnd_100002.txt AC 7 ms 3328 KiB
rnd_10001.txt AC 3 ms 2688 KiB
rnd_10002.txt AC 3 ms 2688 KiB
rnd_1001.txt AC 2 ms 2560 KiB
rnd_1002.txt AC 2 ms 2560 KiB
rnd_101.txt AC 2 ms 2560 KiB
rnd_102.txt AC 2 ms 2560 KiB
rnd_2.txt AC 43 ms 6784 KiB
rnd_3.txt AC 39 ms 6400 KiB
rnd_4.txt AC 39 ms 6272 KiB
rnd_5.txt AC 38 ms 6272 KiB
rnd_6.txt AC 33 ms 5760 KiB
rnd_7.txt AC 35 ms 5888 KiB
rnd_70.txt AC 2 ms 2560 KiB
rnd_700.txt AC 2 ms 2688 KiB
rnd_7000.txt AC 5 ms 2944 KiB
rnd_70000.txt AC 28 ms 6016 KiB
rnd_700000.txt AC 41 ms 8320 KiB
rnd_700001.txt AC 36 ms 7168 KiB
rnd_700002.txt AC 42 ms 9216 KiB
rnd_70001.txt AC 5 ms 3072 KiB
rnd_70002.txt AC 5 ms 3200 KiB
rnd_7001.txt AC 2 ms 2688 KiB
rnd_7002.txt AC 2 ms 2688 KiB
rnd_701.txt AC 2 ms 2560 KiB
rnd_702.txt AC 2 ms 2560 KiB
rnd_71.txt AC 2 ms 2560 KiB
rnd_72.txt AC 2 ms 2560 KiB
sample1.txt AC 2 ms 2560 KiB
sampleId.txt AC 2 ms 2560 KiB
sampleNo.txt AC 2 ms 2560 KiB
star.txt AC 42 ms 7416 KiB