QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#97790#6307. Chase Game 2krito2023#WA 71ms6164kbC++201.4kb2023-04-18 15:30:092023-04-18 15:30:14

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-04-18 15:30:14]
  • 评测
  • 测评结果:WA
  • 用时:71ms
  • 内存:6164kb
  • [2023-04-18 15:30:09]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10;
vector<int> eg[N];
int siz[N], deg[N];
void dfs(int u, int p) {
	if(eg[u].size() == 1) siz[p] ++;
	for(auto v : eg[u]) {
		if(v == p) continue;
		dfs(v, u);
	}
}

void solve() {
	int n;
	cin >> n; 
	for(int i = 0;  i<= n; i ++) eg[i].clear(), deg[i] = siz[i] = 0;
	for(int i = 1; i < n; i ++) {
		int x, y;
		cin >> x >> y;
		eg[x].push_back(y);
		eg[y].push_back(x);
		deg[x] ++, deg[y] ++;
	}
	if(n == 2) {
		cout << -1 << "\n";
		return;
	}
	int s;
	for(int i = 1; i <= n; i ++) {
		if(deg[i] >= 2) {
			s = i;
			break;
		}
	}
	dfs(s, 0);
	// vector<int> res;
 	priority_queue<int> q;
 	for(int i = 1; i <= n; i ++) {
 		if(siz[i]) q.push(siz[i]);
 	}
 	if(q.size() == 1) {
 		cout << -1 << "\n";
 		return;
 	}
 	int ans = 0;
 	while(q.size() > 1) {
 		int tmp = q.top();
 		q.pop();
 		ans += q.top();
 		tmp -= q.top();
 		q.pop();
 		q.push(tmp);
 	}
 	cout << ans + q.top() << "\n";
}

void ddd() {
	int n;
	cin >> n;
	int ans = 0;
	vector<int> res(n + 1);
	for(int i = 0; i < n; i ++) res[i] = n - i;
	int now = res[0];
 	for(int i = 1; i < n; i ++) {
 		if(now >= res[i]) {
 			now -= res[i];
 			ans += res[i];
 		} else {
 			res[i] -= now;
 			ans += now;
 			now = res[i];
 		}
 	}
 	cout << ans + now << "\n";
}

int main() {
	int t;
	cin >> t;
	while(t --) solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 3ms
memory: 5656kb

input:

4
2
1 2
4
1 2
2 3
3 4
4
1 2
2 3
2 4
5
1 2
2 3
3 4
3 5

output:

-1
1
-1
2

result:

ok 4 number(s): "-1 1 -1 2"

Test #2:

score: 0
Accepted
time: 26ms
memory: 6164kb

input:

10000
4
1 2
1 3
3 4
4
1 2
1 3
1 4
4
1 2
2 3
1 4
5
1 2
2 3
1 4
4 5
5
1 2
2 3
3 4
4 5
4
1 2
2 3
2 4
5
1 2
1 3
2 4
2 5
4
1 2
2 3
1 4
5
1 2
1 3
2 4
1 5
5
1 2
2 3
3 4
2 5
5
1 2
1 3
2 4
2 5
4
1 2
1 3
3 4
5
1 2
1 3
3 4
1 5
4
1 2
1 3
1 4
5
1 2
1 3
3 4
3 5
5
1 2
2 3
3 4
3 5
4
1 2
1 3
2 4
5
1 2
2 3
2 4
3 5
5
...

output:

1
-1
1
1
1
-1
2
1
2
2
2
1
2
-1
2
2
1
2
2
1
1
1
-1
2
2
2
1
-1
1
1
2
1
1
-1
1
2
1
1
1
-1
1
1
2
2
2
1
1
1
-1
1
2
1
1
2
1
2
1
1
2
-1
-1
-1
2
2
2
1
1
1
2
2
2
-1
1
2
-1
1
1
-1
2
-1
-1
1
2
2
2
1
1
1
1
1
1
1
1
1
2
-1
1
1
2
-1
2
1
1
1
-1
2
-1
1
-1
-1
2
-1
2
1
2
2
1
1
1
1
2
1
1
1
1
-1
2
1
2
1
1
1
1
1
1
1
2
-1...

result:

ok 10000 numbers

Test #3:

score: -100
Wrong Answer
time: 71ms
memory: 5720kb

input:

10000
9
1 2
2 3
3 4
4 5
1 6
6 7
5 8
7 9
9
1 2
2 3
2 4
1 5
2 6
4 7
6 8
1 9
9
1 2
2 3
1 4
4 5
5 6
4 7
2 8
1 9
10
1 2
2 3
1 4
3 5
3 6
2 7
6 8
6 9
6 10
10
1 2
1 3
3 4
2 5
1 6
5 7
4 8
2 9
7 10
10
1 2
2 3
2 4
1 5
3 6
6 7
5 8
4 9
9 10
9
1 2
2 3
2 4
1 5
3 6
2 7
1 8
2 9
9
1 2
1 3
2 4
1 5
3 6
3 7
7 8
8 9
10
1...

output:

1
3
3
3
2
2
3
2
3
2
3
2
3
2
3
3
3
2
3
2
3
2
3
3
2
2
3
3
3
3
3
3
2
3
3
3
4
3
3
3
2
3
3
3
3
3
2
3
3
3
3
3
3
2
3
2
3
2
2
3
3
4
3
4
3
3
2
2
3
2
2
2
4
3
2
3
3
2
4
3
3
3
2
4
2
2
3
3
3
3
2
3
3
2
3
3
3
3
3
2
3
2
2
3
5
3
3
2
2
3
2
3
4
2
5
3
2
3
3
2
3
2
3
3
3
3
2
2
3
3
3
2
3
3
3
3
3
3
2
3
3
2
2
4
3
3
3
3
2
3
...

result:

wrong answer 73rd numbers differ - expected: '3', found: '4'