#include "Encoder.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> adj[303030];
ll ord[303030], e[303030];
ll cnt;
void dfs(ll x, ll p = 0) {
ord[x] = cnt++;
e[x] = ord[x];
for (auto v : adj[x]) {
if (v == p) continue;
dfs(v, x);
e[x] = max(e[x], e[v]);
}
}
void Encode(int N, int A[], int B[]) {
ll i;
for (i = 0; i < N - 1; i++) adj[A[i]].push_back(B[i]), adj[B[i]].push_back(A[i]);
dfs(0);
for (i = 0; i < N; i++) Code(i, ord[i] * 250001 + e[i]);
}
#include "Device.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void InitDevice()
{
}
int Answer(long long S, long long T) {
ll o1, e1, o2, e2;
o1 = S / 250001;
o2 = T / 250001;
e1 = S % 250001;
e2 = T % 250001;
if (o1 < o2 && e2 <= e1) return 1;
else if (o1 > o2 && e2 >= e1) return 0;
else return 2;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
7684 KB |
Output is correct |
2 |
Correct |
5 ms |
7684 KB |
Output is correct |
3 |
Correct |
5 ms |
7684 KB |
Output is correct |
4 |
Correct |
5 ms |
7712 KB |
Output is correct |
5 |
Correct |
7 ms |
7736 KB |
Output is correct |
6 |
Correct |
5 ms |
7684 KB |
Output is correct |
7 |
Correct |
6 ms |
7684 KB |
Output is correct |
8 |
Correct |
5 ms |
7664 KB |
Output is correct |
9 |
Correct |
5 ms |
7640 KB |
Output is correct |
10 |
Correct |
5 ms |
7684 KB |
Output is correct |
11 |
Correct |
5 ms |
7684 KB |
Output is correct |
12 |
Correct |
5 ms |
7732 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
204 ms |
23420 KB |
Output is correct - L = 174751398 |
2 |
Correct |
234 ms |
23196 KB |
Output is correct - L = 174501396 |
3 |
Correct |
197 ms |
23296 KB |
Output is correct - L = 174751398 |
4 |
Correct |
193 ms |
23200 KB |
Output is correct - L = 174751398 |
5 |
Partially correct |
534 ms |
57080 KB |
Output is partially correct - L = 62500249998 |
6 |
Partially correct |
505 ms |
57008 KB |
Output is partially correct - L = 62500249998 |
7 |
Partially correct |
500 ms |
56996 KB |
Output is partially correct - L = 62500249998 |
8 |
Partially correct |
518 ms |
58372 KB |
Output is partially correct - L = 62500249998 |
9 |
Partially correct |
429 ms |
57660 KB |
Output is partially correct - L = 62500249998 |
10 |
Partially correct |
424 ms |
57676 KB |
Output is partially correct - L = 62500249998 |
11 |
Partially correct |
425 ms |
57752 KB |
Output is partially correct - L = 62500249998 |
12 |
Partially correct |
433 ms |
57572 KB |
Output is partially correct - L = 62500249998 |
13 |
Partially correct |
477 ms |
57392 KB |
Output is partially correct - L = 62500249998 |
14 |
Partially correct |
477 ms |
57000 KB |
Output is partially correct - L = 62500249998 |
15 |
Correct |
207 ms |
23176 KB |
Output is correct - L = 174751398 |
16 |
Correct |
193 ms |
23276 KB |
Output is correct - L = 174751398 |
17 |
Correct |
196 ms |
23228 KB |
Output is correct - L = 174751398 |
18 |
Partially correct |
449 ms |
56568 KB |
Output is partially correct - L = 62500249998 |
19 |
Partially correct |
472 ms |
56320 KB |
Output is partially correct - L = 62500249998 |
20 |
Partially correct |
489 ms |
56260 KB |
Output is partially correct - L = 62500249998 |
21 |
Partially correct |
498 ms |
57136 KB |
Output is partially correct - L = 62500249998 |
22 |
Partially correct |
460 ms |
56364 KB |
Output is partially correct - L = 62500249998 |
23 |
Partially correct |
534 ms |
56344 KB |
Output is partially correct - L = 62500249998 |
24 |
Partially correct |
485 ms |
56232 KB |
Output is partially correct - L = 62500249998 |
25 |
Partially correct |
482 ms |
55904 KB |
Output is partially correct - L = 62500249998 |
26 |
Partially correct |
557 ms |
55956 KB |
Output is partially correct - L = 62500249998 |
27 |
Partially correct |
541 ms |
55928 KB |
Output is partially correct - L = 62500249998 |