#include "Encoder.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define deb(x) ;
using lli=long long int;
static lli aux=0;
void dfs(int n , int par, vector<vector<int>> &adj, vector<pair<lli,lli>> &range ){
lli ini=aux;
aux++;
for(int x: adj[n]){
if(x==par) continue;
dfs(x, n, adj, range);
}
lli fin=aux;
aux++;
range[n]={ini, fin};
}
void Encode(int N, int A[], int B[])
{
vector<vector<int>> adj (N);
for(int i=0; i<N-1; ++i){
adj[A[i]].pb(B[i]);
adj[B[i]].pb(A[i]);
}
vector<pair<lli,lli>> range (N);
dfs(0,-1,adj, range);
for (int i = 0; i < N; ++i) {
lli ini=range[i].first;
lli fin=range[i].second;
lli dif=fin-ini;
dif/=2;
Code(i, ini*250000+dif);
}
}
#include "Device.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define deb(x) ;
using lli=long long int;
void InitDevice()
{
}
int Answer(long long S, long long T)
{
lli difS=S%250000;
lli iniS= (S-difS)/250000;
lli difT=T%250000;
lli iniT=(T-difT)/250000;
difS*=2;
difT*=2;
lli finS=iniS+difS;
lli finT=iniT+difT;
if(iniT <= iniS && finS <= finT){
return 0;
}
if(iniS <= iniT && finT <= finS){
return 1;
}
return 2;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4880 KB |
Output is correct |
2 |
Correct |
1 ms |
4892 KB |
Output is correct |
3 |
Correct |
1 ms |
4896 KB |
Output is correct |
4 |
Correct |
0 ms |
4888 KB |
Output is correct |
5 |
Correct |
1 ms |
4880 KB |
Output is correct |
6 |
Correct |
1 ms |
4892 KB |
Output is correct |
7 |
Correct |
1 ms |
4876 KB |
Output is correct |
8 |
Correct |
1 ms |
5144 KB |
Output is correct |
9 |
Correct |
1 ms |
4880 KB |
Output is correct |
10 |
Correct |
0 ms |
4880 KB |
Output is correct |
11 |
Correct |
2 ms |
4892 KB |
Output is correct |
12 |
Correct |
1 ms |
4876 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
124 ms |
12668 KB |
Output is partially correct - L = 349250000 |
2 |
Partially correct |
127 ms |
12548 KB |
Output is partially correct - L = 347500000 |
3 |
Partially correct |
124 ms |
12436 KB |
Output is partially correct - L = 348500000 |
4 |
Partially correct |
124 ms |
12452 KB |
Output is partially correct - L = 347500000 |
5 |
Partially correct |
274 ms |
33520 KB |
Output is partially correct - L = 124998000000 |
6 |
Partially correct |
272 ms |
33560 KB |
Output is partially correct - L = 124999250000 |
7 |
Partially correct |
284 ms |
33548 KB |
Output is partially correct - L = 124998750000 |
8 |
Partially correct |
325 ms |
33256 KB |
Output is partially correct - L = 124995250000 |
9 |
Partially correct |
254 ms |
34620 KB |
Output is partially correct - L = 124999000000 |
10 |
Partially correct |
252 ms |
34040 KB |
Output is partially correct - L = 124998750000 |
11 |
Partially correct |
281 ms |
34020 KB |
Output is partially correct - L = 124999250000 |
12 |
Partially correct |
244 ms |
34064 KB |
Output is partially correct - L = 124998750000 |
13 |
Partially correct |
261 ms |
33948 KB |
Output is partially correct - L = 124999000000 |
14 |
Partially correct |
280 ms |
33676 KB |
Output is partially correct - L = 124998000000 |
15 |
Partially correct |
155 ms |
12536 KB |
Output is partially correct - L = 348250000 |
16 |
Partially correct |
124 ms |
12512 KB |
Output is partially correct - L = 349250000 |
17 |
Partially correct |
124 ms |
12700 KB |
Output is partially correct - L = 348750000 |
18 |
Partially correct |
278 ms |
33668 KB |
Output is partially correct - L = 124999250000 |
19 |
Partially correct |
265 ms |
33696 KB |
Output is partially correct - L = 124995000000 |
20 |
Partially correct |
265 ms |
33724 KB |
Output is partially correct - L = 124995000000 |
21 |
Partially correct |
264 ms |
33756 KB |
Output is partially correct - L = 124998750000 |
22 |
Partially correct |
274 ms |
33932 KB |
Output is partially correct - L = 124995000000 |
23 |
Partially correct |
270 ms |
33680 KB |
Output is partially correct - L = 124995000000 |
24 |
Partially correct |
293 ms |
33564 KB |
Output is partially correct - L = 124995000000 |
25 |
Partially correct |
276 ms |
33560 KB |
Output is partially correct - L = 124995000000 |
26 |
Partially correct |
294 ms |
33616 KB |
Output is partially correct - L = 124995000000 |
27 |
Partially correct |
287 ms |
33416 KB |
Output is partially correct - L = 124995000000 |