Submission #27342

# Submission time Handle Problem Language Result Execution time Memory
27342 2017-07-12T10:02:50 Z 구사과(#1145) City (JOI17_city) C++14
8 / 100
209 ms 40176 KB
#include "Encoder.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAXN = 250005;

vector<int> gph[MAXN];
int l[MAXN], r[MAXN], sz;

void dfs(int x, int p){
	l[x] = sz++;
	r[x] = 1;
	for(auto &i : gph[x]){
		if(i != p){
			dfs(i, x);
			r[x] += r[i];
		}
	}
}

void Encode(int N, int A[], int B[]){
	for(int i=0; i<N-1; i++){
		gph[A[i]].push_back(B[i]);
		gph[B[i]].push_back(A[i]);
	}
	dfs(0, -1);
	int sum = 0;
	for(int i=0; i<N; i++){
		Code(i, (l[i] << 18) + r[i]);
	}
}
#include "Device.h"
using namespace std;

void InitDevice(){
}

int Answer(long long S, long long T)
{
	int ps = (S >> 18);
	int pe = S & ((1<<18) - 1);
	int qs = (T >> 18);
	int qe = T & ((1<<18) - 1);
	pe += ps;
	qe += qs;
	if(qs <= ps && pe <= qe) return 0;
	if(ps <= qs && qe <= pe) return 1;
	return 2;
}

Compilation message

Encoder.cpp: In function 'void Encode(int, int*, int*)':
Encoder.cpp:27:6: warning: unused variable 'sum' [-Wunused-variable]
  int sum = 0;
      ^~~
# Verdict Execution time Memory Grader output
1 Correct 8 ms 12288 KB Output is correct
2 Correct 8 ms 12288 KB Output is correct
3 Correct 8 ms 12488 KB Output is correct
4 Correct 7 ms 12424 KB Output is correct
5 Correct 8 ms 12544 KB Output is correct
6 Correct 8 ms 12544 KB Output is correct
7 Correct 8 ms 12544 KB Output is correct
8 Correct 9 ms 12544 KB Output is correct
9 Correct 9 ms 12288 KB Output is correct
10 Correct 8 ms 12288 KB Output is correct
11 Correct 8 ms 12488 KB Output is correct
12 Correct 8 ms 12288 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 168 ms 19616 KB Output is correct - L = 183238657
2 Correct 169 ms 19504 KB Output is correct - L = 182976513
3 Correct 170 ms 19704 KB Output is correct - L = 183238657
4 Correct 172 ms 19440 KB Output is correct - L = 183238657
5 Incorrect 209 ms 40176 KB Wrong Answer [3]
6 Halted 0 ms 0 KB -