#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);
double cur=1,w=1.05;
int ans=0;
while(cur<tid-lid[u]) cur*=w,ans++;
tid=lid[u]+(int)cur;
Code(u,(ll)ans*N+lid[u]);
rid[u]=tid-1;
}
void Encode(int n, int a[], int b[])
{
for(int i=0;i<n-1;i++) AddEdge(a[i],b[i]);
DFS(0,-1);
}
#include "Device.h"
const int N=250050;
double ans[2050];
void InitDevice()
{
ans[0]=1.0;
for(int i=1;i<2050;i++) ans[i]=ans[i-1]*1.05;
}
int Answer(long long S, long long T)
{
int x=S/N,l=S%N,r=l+(int)ans[x]-1;
int y=T/N,L=T%N,R=L+(int)ans[y]-1;
if(l<=L && R<=r) return 1;
if(L<=l && r<=R) return 0;
return 2;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
776 KB |
Output is correct |
2 |
Correct |
4 ms |
788 KB |
Output is correct |
3 |
Correct |
2 ms |
852 KB |
Output is correct |
4 |
Correct |
4 ms |
776 KB |
Output is correct |
5 |
Correct |
4 ms |
768 KB |
Output is correct |
6 |
Correct |
4 ms |
776 KB |
Output is correct |
7 |
Correct |
3 ms |
768 KB |
Output is correct |
8 |
Correct |
3 ms |
768 KB |
Output is correct |
9 |
Correct |
3 ms |
776 KB |
Output is correct |
10 |
Correct |
3 ms |
768 KB |
Output is correct |
11 |
Correct |
3 ms |
860 KB |
Output is correct |
12 |
Correct |
4 ms |
768 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
162 ms |
9232 KB |
Output is correct - L = 34006800 |
2 |
Correct |
163 ms |
9148 KB |
Output is correct - L = 34256850 |
3 |
Correct |
163 ms |
9212 KB |
Output is correct - L = 34006800 |
4 |
Correct |
166 ms |
9360 KB |
Output is correct - L = 34256850 |
5 |
Incorrect |
369 ms |
37056 KB |
Wrong Answer [6] |
6 |
Halted |
0 ms |
0 KB |
- |