oj.uz

Submission #891748

# Submission time Handle Problem Language Result Execution time Memory
891748 2023-12-23T22:39:33 Z TadijaSebez City (JOI17_city) C++11
8 / 100
 3000 ms 47600 KB 
#include "Encoder.h"
#define ll long long
const int H=1e9;
const int N=250050*2;
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.0,w=2.00;
	int ans=0;
	while((int)cur<tid-lid[u]) cur*=w,ans++;
	tid=lid[u]+(int)cur;
	Code(u,(ll)ans*H+lid[u]);
}
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=1e9;
double ans[2050];
void InitDevice()
{
	ans[0]=1.0;
	for(int i=1;i<2050;i++) ans[i]=ans[i-1]*2.00;
}
 
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;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8992 KB Output is correct
2 Correct 1 ms 9000 KB Output is correct
3 Correct 1 ms 9248 KB Output is correct
4 Correct 1 ms 8984 KB Output is correct
5 Correct 1 ms 9668 KB Output is correct
6 Correct 1 ms 8976 KB Output is correct
7 Correct 1 ms 8980 KB Output is correct
8 Correct 1 ms 8996 KB Output is correct
9 Correct 1 ms 8996 KB Output is correct
10 Correct 1 ms 8996 KB Output is correct
11 Correct 1 ms 8992 KB Output is correct
12 Correct 1 ms 8996 KB Output is correct

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Partially correct 132 ms 17560 KB Output is partially correct - L = 14000000000
2 Partially correct 125 ms 17200 KB Output is partially correct - L = 17000000000
3 Partially correct 125 ms 17400 KB Output is partially correct - L = 13000000000
4 Partially correct 130 ms 17756 KB Output is partially correct - L = 16000000000
5 Partially correct 226 ms 34048 KB Output is partially correct - L = 27000000000
6 Partially correct 231 ms 47596 KB Output is partially correct - L = 27000000000
7 Partially correct 224 ms 47600 KB Output is partially correct - L = 27000000000
8 Execution timed out 3057 ms 18516 KB Time limit exceeded
9 Halted 0 ms 0 KB -