#include "Encoder.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 25e4;
int N;
vector<int> adj[MAXN+10];
int cnt=-1;
void dfs(int now, int bef)
{
int l, r;
l=++cnt;
for(int nxt : adj[now])
{
if(nxt==bef) continue;
dfs(nxt, now);
}
r=cnt;
Code(now, (ll)l*MAXN+r);
}
void Encode(int _N, int A[], int B[])
{
int i, j;
N=_N;
for(i=0; i<N-1; i++)
{
adj[A[i]].push_back(B[i]);
adj[B[i]].push_back(A[i]);
}
dfs(0, 0);
}
#include "Device.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 25e4;
void InitDevice()
{
}
int Answer(ll S, ll T)
{
int l1=S/MAXN, r1=S%MAXN;
int l2=T/MAXN, r2=T%MAXN;
if(l2<=l1 && r1<=r2) return 0;
if(l1<=l2 && r2<=r1) return 1;
return 2;
}
Compilation message
Encoder.cpp: In function 'void Encode(int, int*, int*)':
Encoder.cpp:30:9: warning: unused variable 'j' [-Wunused-variable]
int i, j;
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
12 ms |
12272 KB |
Output is correct |
2 |
Correct |
12 ms |
12272 KB |
Output is correct |
3 |
Correct |
13 ms |
12272 KB |
Output is correct |
4 |
Correct |
12 ms |
12272 KB |
Output is correct |
5 |
Correct |
13 ms |
12432 KB |
Output is correct |
6 |
Correct |
13 ms |
12528 KB |
Output is correct |
7 |
Correct |
13 ms |
12528 KB |
Output is correct |
8 |
Correct |
13 ms |
12272 KB |
Output is correct |
9 |
Correct |
13 ms |
12272 KB |
Output is correct |
10 |
Correct |
13 ms |
12272 KB |
Output is correct |
11 |
Correct |
13 ms |
12272 KB |
Output is correct |
12 |
Correct |
13 ms |
12528 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
222 ms |
26616 KB |
Output is correct - L = 174750699 |
2 |
Correct |
224 ms |
26608 KB |
Output is correct - L = 174500698 |
3 |
Correct |
221 ms |
26608 KB |
Output is correct - L = 174750699 |
4 |
Correct |
229 ms |
26608 KB |
Output is correct - L = 174750699 |
5 |
Partially correct |
547 ms |
65520 KB |
Output is partially correct - L = 62499999999 |
6 |
Partially correct |
564 ms |
65264 KB |
Output is partially correct - L = 62499999999 |
7 |
Partially correct |
550 ms |
65264 KB |
Output is partially correct - L = 62499999999 |
8 |
Partially correct |
561 ms |
64496 KB |
Output is partially correct - L = 62499999999 |
9 |
Partially correct |
463 ms |
66776 KB |
Output is partially correct - L = 62499999999 |
10 |
Partially correct |
454 ms |
67032 KB |
Output is partially correct - L = 62499999999 |
11 |
Partially correct |
466 ms |
66768 KB |
Output is partially correct - L = 62499999999 |
12 |
Partially correct |
451 ms |
66776 KB |
Output is partially correct - L = 62499999999 |
13 |
Partially correct |
504 ms |
66008 KB |
Output is partially correct - L = 62499999999 |
14 |
Partially correct |
519 ms |
65768 KB |
Output is partially correct - L = 62499999999 |
15 |
Correct |
225 ms |
26608 KB |
Output is correct - L = 174750699 |
16 |
Correct |
220 ms |
26608 KB |
Output is correct - L = 174750699 |
17 |
Correct |
228 ms |
26608 KB |
Output is correct - L = 174750699 |
18 |
Partially correct |
508 ms |
65512 KB |
Output is partially correct - L = 62499999999 |
19 |
Partially correct |
502 ms |
65504 KB |
Output is partially correct - L = 62499999999 |
20 |
Partially correct |
506 ms |
65504 KB |
Output is partially correct - L = 62499999999 |
21 |
Partially correct |
532 ms |
65504 KB |
Output is partially correct - L = 62499999999 |
22 |
Partially correct |
526 ms |
65504 KB |
Output is partially correct - L = 62499999999 |
23 |
Partially correct |
530 ms |
65504 KB |
Output is partially correct - L = 62499999999 |
24 |
Partially correct |
534 ms |
65520 KB |
Output is partially correct - L = 62499999999 |
25 |
Partially correct |
543 ms |
65520 KB |
Output is partially correct - L = 62499999999 |
26 |
Partially correct |
565 ms |
65520 KB |
Output is partially correct - L = 62499999999 |
27 |
Partially correct |
563 ms |
65520 KB |
Output is partially correct - L = 62499999999 |