# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1009038 | salmon | City (JOI17_city) | C++14 | 228 ms | 49244 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "Encoder.h"
#include <bits/stdc++.h>
using namespace std;
static vector<int> adjlst[250100];
static long long int pre[250100];
static long long int post[250100];
static int cont = 0;
static void dfs(int i, int p){
pre[i] = cont;
cont++;
for(int j : adjlst[i]){
if(j == p) continue;
dfs(j,i);
}
post[i] = cont - 1;
}
void Encode(int N, int A[], int B[]){
for(int i = 0; i < N - 1; ++i) {
adjlst[A[i]].push_back(B[i]);
adjlst[B[i]].push_back(A[i]);
}
dfs(0,-1);
for(int i = 0; i < N; i++){
Code(i,(pre[i]<<18)+post[i]);
}
}
#include "Device.h"
void InitDevice(){
}
int Answer(long long S, long long T){
long long int e1 = S % (1LL<<18);
long long int s1 = (S>>18);
long long int e2 = T % (1LL<<18);
long long int s2 = (T>>18);
if(s1 <= s2 && e2 <= e1){
return 1;
}
if(s2 <= s1 && e1 <= e2){
return 0;
}
return 2;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |