#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 L[MAXN+10], R[MAXN+10];
int cnt=0;
void dfs(int now, int bef)
{
int l, r;
L[now]=R[now]=cnt;
if(now==0 || adj[now].size()>1) cnt++;
cnt++;
for(int nxt : adj[now])
{
if(nxt==bef) continue;
dfs(nxt, now);
R[now]=max(R[now], R[nxt]);
}
Code(now, (ll)L[now]*MAXN+R[now]);
}
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 dfs(int, int)':
Encoder.cpp:18:6: warning: unused variable 'l' [-Wunused-variable]
int l, r;
^
Encoder.cpp:18:9: warning: unused variable 'r' [-Wunused-variable]
int l, r;
^
Encoder.cpp: In function 'void Encode(int, int*, int*)':
Encoder.cpp:33:9: warning: unused variable 'j' [-Wunused-variable]
int i, j;
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
12528 KB |
Output is correct |
2 |
Correct |
13 ms |
12528 KB |
Output is correct |
3 |
Correct |
13 ms |
12528 KB |
Output is correct |
4 |
Correct |
13 ms |
12528 KB |
Output is correct |
5 |
Correct |
13 ms |
12280 KB |
Output is correct |
6 |
Correct |
12 ms |
12272 KB |
Output is correct |
7 |
Correct |
13 ms |
12280 KB |
Output is correct |
8 |
Correct |
13 ms |
12784 KB |
Output is correct |
9 |
Correct |
12 ms |
12272 KB |
Output is correct |
10 |
Correct |
13 ms |
12528 KB |
Output is correct |
11 |
Correct |
13 ms |
12528 KB |
Output is correct |
12 |
Correct |
12 ms |
12528 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
222 ms |
19696 KB |
Output is correct - L = 262251049 |
2 |
Correct |
220 ms |
19696 KB |
Output is correct - L = 264751059 |
3 |
Correct |
220 ms |
19696 KB |
Output is correct - L = 259001036 |
4 |
Correct |
221 ms |
19696 KB |
Output is correct - L = 262251049 |
5 |
Incorrect |
549 ms |
56048 KB |
Wrong Answer [6] |
6 |
Halted |
0 ms |
0 KB |
- |