oj.uz

Submission #1044724

# Submission time Handle Problem Language Result Execution time Memory
1044724 2024-08-05T12:50:05 Z goodspeed0208 Village (BOI20_village) C++14
50 / 100
 66 ms 18640 KB 
#include<bits/stdc++.h>
#define int long long
#define pii pair<long long, long long>
using namespace std;

int n, minn = 0, maxx = 0;
vector<vector<int> >G;
vector<int>minans;
vector<int>maxans;

bool dfs(int x, int p) {
	vector<int>c;
	for (auto i : G[x]) {
		if (i == p) continue;
		bool can = dfs(i, x);
		if (can) {
			c.push_back(i);
		}
	}
	//cout << x <<" " << c.size() << "\n";
	for (int i = 0 ; i < c.size()/2 ; i++) {
		minn += 4;
		minans[c[i*2]] = i*2+1;
		minans[c[i*2+1]] = i*2;
	}
	if (c.size() % 2 == 1) {
		minn += 2;
		minans[c.back()] = x;
		minans[x] = c.back();
		return 0;
	} else {
		if (x == 0) {
			minn += 2;
			/*minans[x] = minans[G[x][0]];
			minans[G[x][0]] = x;*/
			return 0;
		}
		return 1;
	}
}

int cnt;

int findc(int x, int p) {
	int num = 1;
	bool can = 1;
	for (auto i : G[x]) {
		if (i == p) continue;
		int child = findc(i, x);
		if (child > n/2) can = 0;
		num += child;
	}
	if (n - num > n/2) can = 0;
	if (can) cnt = x;
	return num;
}

vector<int>arr;

void dis(int x, int p, int d) {
	maxx += d*2;
	arr.push_back(x);
	for (auto i : G[x]) {
		if (i == p) continue;
		dis(i, x, d+1);
	}
}

signed main() {
	cin >> n;
	G.resize(n); minans.resize(n); maxans.resize(n);
	int a, b;
	for (int i = 0 ; i < n-1 ; i++){
		cin >> a >> b; a--, b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	dfs(0, -1);
	findc(0, -1);
	dis(cnt, -1, 0);
	for (int i = 0 ; i < n ; i++) {
		//cout << arr[i] <<" ";
		maxans[arr[i]] = arr[(i+n/2)%n];
	}
	//cout <<"\n";
	cout << minn << " " << maxx << "\n";
	for (auto i : minans) cout << i+1 << " "; cout << "\n";
	for (auto i : maxans) cout << i+1 << " "; cout << "\n";
}

Compilation message

Village.cpp: In function 'bool dfs(long long int, long long int)':
Village.cpp:21:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |  for (int i = 0 ; i < c.size()/2 ; i++) {
      |                   ~~^~~~~~~~~~~~
Village.cpp: In function 'int main()':
Village.cpp:87:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   87 |  for (auto i : minans) cout << i+1 << " "; cout << "\n";
      |  ^~~
Village.cpp:87:44: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   87 |  for (auto i : minans) cout << i+1 << " "; cout << "\n";
      |                                            ^~~~
Village.cpp:88:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   88 |  for (auto i : maxans) cout << i+1 << " "; cout << "\n";
      |  ^~~
Village.cpp:88:44: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   88 |  for (auto i : maxans) cout << i+1 << " "; cout << "\n";
      |                                            ^~~~

Subtask #1
6.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 1 ms 348 KB Partially correct
3 Correct 0 ms 348 KB Output is correct
4 Partially correct 0 ms 348 KB Partially correct
5 Partially correct 0 ms 348 KB Partially correct
6 Partially correct 0 ms 348 KB Partially correct
7 Partially correct 0 ms 348 KB Partially correct
8 Partially correct 0 ms 348 KB Partially correct
9 Partially correct 0 ms 348 KB Partially correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Partially correct 0 ms 348 KB Partially correct
14 Partially correct 0 ms 348 KB Partially correct
15 Partially correct 1 ms 348 KB Partially correct
16 Partially correct 0 ms 348 KB Partially correct
17 Partially correct 0 ms 348 KB Partially correct

Subtask #2
19.0 / 38.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Partially correct
2 Partially correct 1 ms 348 KB Partially correct
3 Partially correct 0 ms 348 KB Partially correct
4 Partially correct 0 ms 348 KB Partially correct
5 Partially correct 1 ms 600 KB Partially correct
6 Partially correct 1 ms 348 KB Partially correct
7 Correct 1 ms 348 KB Output is correct
8 Partially correct 1 ms 348 KB Partially correct
9 Partially correct 1 ms 348 KB Partially correct
10 Partially correct 1 ms 348 KB Partially correct
11 Partially correct 1 ms 348 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 348 KB Partially correct
14 Partially correct 1 ms 348 KB Partially correct
15 Partially correct 0 ms 348 KB Partially correct
16 Partially correct 1 ms 348 KB Partially correct
17 Partially correct 1 ms 348 KB Partially correct
18 Partially correct 1 ms 408 KB Partially correct
19 Partially correct 1 ms 348 KB Partially correct
20 Partially correct 1 ms 348 KB Partially correct
21 Partially correct 0 ms 348 KB Partially correct
22 Partially correct 0 ms 348 KB Partially correct
23 Partially correct 1 ms 348 KB Partially correct
24 Partially correct 1 ms 348 KB Partially correct
25 Partially correct 0 ms 348 KB Partially correct
26 Partially correct 1 ms 348 KB Partially correct
27 Partially correct 0 ms 348 KB Partially correct
28 Partially correct 1 ms 344 KB Partially correct
29 Partially correct 1 ms 344 KB Partially correct
30 Partially correct 0 ms 348 KB Partially correct

Subtask #3
25.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 1 ms 348 KB Partially correct
3 Correct 0 ms 348 KB Output is correct
4 Partially correct 0 ms 348 KB Partially correct
5 Partially correct 0 ms 348 KB Partially correct
6 Partially correct 0 ms 348 KB Partially correct
7 Partially correct 0 ms 348 KB Partially correct
8 Partially correct 0 ms 348 KB Partially correct
9 Partially correct 0 ms 348 KB Partially correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Partially correct 0 ms 348 KB Partially correct
14 Partially correct 0 ms 348 KB Partially correct
15 Partially correct 1 ms 348 KB Partially correct
16 Partially correct 0 ms 348 KB Partially correct
17 Partially correct 0 ms 348 KB Partially correct
18 Partially correct 0 ms 348 KB Partially correct
19 Partially correct 1 ms 348 KB Partially correct
20 Partially correct 0 ms 348 KB Partially correct
21 Partially correct 0 ms 348 KB Partially correct
22 Partially correct 1 ms 600 KB Partially correct
23 Partially correct 1 ms 348 KB Partially correct
24 Correct 1 ms 348 KB Output is correct
25 Partially correct 1 ms 348 KB Partially correct
26 Partially correct 1 ms 348 KB Partially correct
27 Partially correct 1 ms 348 KB Partially correct
28 Partially correct 1 ms 348 KB Partially correct
29 Partially correct 1 ms 344 KB Partially correct
30 Partially correct 1 ms 348 KB Partially correct
31 Partially correct 1 ms 348 KB Partially correct
32 Partially correct 0 ms 348 KB Partially correct
33 Partially correct 1 ms 348 KB Partially correct
34 Partially correct 1 ms 348 KB Partially correct
35 Partially correct 1 ms 408 KB Partially correct
36 Partially correct 1 ms 348 KB Partially correct
37 Partially correct 1 ms 348 KB Partially correct
38 Partially correct 0 ms 348 KB Partially correct
39 Partially correct 0 ms 348 KB Partially correct
40 Partially correct 1 ms 348 KB Partially correct
41 Partially correct 1 ms 348 KB Partially correct
42 Partially correct 0 ms 348 KB Partially correct
43 Partially correct 1 ms 348 KB Partially correct
44 Partially correct 0 ms 348 KB Partially correct
45 Partially correct 1 ms 344 KB Partially correct
46 Partially correct 1 ms 344 KB Partially correct
47 Partially correct 0 ms 348 KB Partially correct
48 Partially correct 49 ms 9056 KB Partially correct
49 Partially correct 60 ms 9932 KB Partially correct
50 Partially correct 62 ms 9940 KB Partially correct
51 Partially correct 55 ms 7888 KB Partially correct
52 Partially correct 55 ms 9928 KB Partially correct
53 Partially correct 48 ms 8916 KB Partially correct
54 Correct 31 ms 9216 KB Output is correct
55 Correct 66 ms 18640 KB Output is correct
56 Partially correct 60 ms 14252 KB Partially correct
57 Partially correct 58 ms 12784 KB Partially correct
58 Partially correct 59 ms 11496 KB Partially correct
59 Partially correct 63 ms 9928 KB Partially correct
60 Partially correct 45 ms 11064 KB Partially correct
61 Partially correct 45 ms 10328 KB Partially correct
62 Partially correct 48 ms 10200 KB Partially correct
63 Partially correct 46 ms 9692 KB Partially correct
64 Partially correct 46 ms 10200 KB Partially correct
65 Partially correct 46 ms 10440 KB Partially correct
66 Partially correct 43 ms 9624 KB Partially correct
67 Partially correct 35 ms 7644 KB Partially correct
68 Partially correct 39 ms 8644 KB Partially correct
69 Partially correct 51 ms 10444 KB Partially correct
70 Partially correct 40 ms 9668 KB Partially correct
71 Partially correct 31 ms 7372 KB Partially correct
72 Partially correct 35 ms 8388 KB Partially correct
73 Partially correct 46 ms 10444 KB Partially correct
74 Partially correct 41 ms 9420 KB Partially correct
75 Partially correct 51 ms 10264 KB Partially correct
76 Partially correct 60 ms 9676 KB Partially correct
77 Partially correct 50 ms 9932 KB Partially correct
78 Partially correct 34 ms 6864 KB Partially correct
79 Partially correct 38 ms 7748 KB Partially correct
80 Partially correct 58 ms 10184 KB Partially correct
81 Partially correct 48 ms 10140 KB Partially correct
82 Partially correct 49 ms 9980 KB Partially correct