#include "Encoder.h"
#define ll long long
const int N=250050;
const int M=2*N;
int fir[N],go[M],tot,f[M];
void Add(int u, int v){ tot++;f[tot]=v;go[tot]=fir[u];fir[u]=tot;}
void AddEdge(int u, int v){ Add(u,v);Add(v,u);}
int lid[N],rid[N],tid;
void DFS(int u, int p)
{
lid[u]=tid++;
for(int i=fir[u];i;i=go[i]) if(f[i]!=p) DFS(f[i],u);
rid[u]=tid;
}
void Encode(int n, int a[], int b[])
{
for(int i=0;i<n-1;i++) AddEdge(a[i],b[i]);
DFS(0,-1);
for(int i=0;i<n;i++) Code(i,(ll)lid[i]*N+rid[i]-lid[i]);
}
#include "Device.h"
const int N=250050;
void InitDevice()
{
}
int Answer(long long S, long long T)
{
int l=S/N,r=l+S%N;
int L=T/N,R=L+T%N;
if(l<=L && R<=r) return 1;
if(L<=l && r<=R) return 0;
return 2;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
776 KB |
Output is correct |
| 2 |
Correct |
4 ms |
748 KB |
Output is correct |
| 3 |
Correct |
3 ms |
768 KB |
Output is correct |
| 4 |
Correct |
3 ms |
772 KB |
Output is correct |
| 5 |
Correct |
3 ms |
776 KB |
Output is correct |
| 6 |
Correct |
3 ms |
768 KB |
Output is correct |
| 7 |
Correct |
4 ms |
768 KB |
Output is correct |
| 8 |
Correct |
3 ms |
768 KB |
Output is correct |
| 9 |
Correct |
2 ms |
768 KB |
Output is correct |
| 10 |
Correct |
3 ms |
776 KB |
Output is correct |
| 11 |
Correct |
4 ms |
768 KB |
Output is correct |
| 12 |
Correct |
3 ms |
776 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
161 ms |
9224 KB |
Output is correct - L = 174784951 |
| 2 |
Correct |
163 ms |
9296 KB |
Output is correct - L = 174534901 |
| 3 |
Correct |
166 ms |
9292 KB |
Output is correct - L = 174784951 |
| 4 |
Correct |
161 ms |
9204 KB |
Output is correct - L = 174784951 |
| 5 |
Partially correct |
359 ms |
37104 KB |
Output is partially correct - L = 62512249951 |
| 6 |
Partially correct |
379 ms |
36952 KB |
Output is partially correct - L = 62512249951 |
| 7 |
Partially correct |
376 ms |
37064 KB |
Output is partially correct - L = 62512249951 |
| 8 |
Partially correct |
361 ms |
37104 KB |
Output is partially correct - L = 62512249951 |
| 9 |
Partially correct |
356 ms |
37192 KB |
Output is partially correct - L = 62512249951 |
| 10 |
Partially correct |
354 ms |
37152 KB |
Output is partially correct - L = 62512249951 |
| 11 |
Partially correct |
359 ms |
37096 KB |
Output is partially correct - L = 62512249951 |
| 12 |
Partially correct |
352 ms |
37032 KB |
Output is partially correct - L = 62512249951 |
| 13 |
Partially correct |
372 ms |
37008 KB |
Output is partially correct - L = 62512249951 |
| 14 |
Partially correct |
359 ms |
36968 KB |
Output is partially correct - L = 62512249951 |
| 15 |
Correct |
174 ms |
9096 KB |
Output is correct - L = 174784951 |
| 16 |
Correct |
164 ms |
9324 KB |
Output is correct - L = 174784951 |
| 17 |
Correct |
162 ms |
9224 KB |
Output is correct - L = 174784951 |
| 18 |
Partially correct |
349 ms |
36928 KB |
Output is partially correct - L = 62512249951 |
| 19 |
Partially correct |
359 ms |
37072 KB |
Output is partially correct - L = 62512249951 |
| 20 |
Partially correct |
349 ms |
36952 KB |
Output is partially correct - L = 62512249951 |
| 21 |
Partially correct |
360 ms |
36960 KB |
Output is partially correct - L = 62512249951 |
| 22 |
Partially correct |
351 ms |
36976 KB |
Output is partially correct - L = 62512249951 |
| 23 |
Partially correct |
354 ms |
37056 KB |
Output is partially correct - L = 62512249951 |
| 24 |
Partially correct |
351 ms |
36968 KB |
Output is partially correct - L = 62512249951 |
| 25 |
Partially correct |
349 ms |
36928 KB |
Output is partially correct - L = 62512249951 |
| 26 |
Partially correct |
356 ms |
36928 KB |
Output is partially correct - L = 62512249951 |
| 27 |
Partially correct |
358 ms |
37088 KB |
Output is partially correct - L = 62512249951 |
