oj.uz

Submission #27343

# Submission time Handle Problem Language Result Execution time Memory
27343 2017-07-12T10:03:43 Z 구사과(#1145) City (JOI17_city) C++14
22 / 100
 531 ms 56696 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, ((1ll * 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;
      ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12288 KB Output is correct
2 Correct 8 ms 12544 KB Output is correct
3 Correct 7 ms 12488 KB Output is correct
4 Correct 7 ms 12288 KB Output is correct
5 Correct 7 ms 12288 KB Output is correct
6 Correct 7 ms 12288 KB Output is correct
7 Correct 8 ms 12544 KB Output is correct
8 Correct 8 ms 12288 KB Output is correct
9 Correct 8 ms 12544 KB Output is correct
10 Correct 7 ms 12544 KB Output is correct
11 Correct 8 ms 12288 KB Output is correct
12 Correct 8 ms 12344 KB Output is correct

Subtask #2
14.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 19352 KB Output is correct - L = 183238657
2 Correct 169 ms 19384 KB Output is correct - L = 182976513
3 Correct 173 ms 19520 KB Output is correct - L = 183238657
4 Correct 173 ms 19672 KB Output is correct - L = 183238657
5 Partially correct 466 ms 55168 KB Output is partially correct - L = 65535737857
6 Partially correct 490 ms 55248 KB Output is partially correct - L = 65535737857
7 Partially correct 486 ms 55456 KB Output is partially correct - L = 65535737857
8 Partially correct 488 ms 54736 KB Output is partially correct - L = 65535737857
9 Partially correct 431 ms 56544 KB Output is partially correct - L = 65535737857
10 Partially correct 431 ms 56696 KB Output is partially correct - L = 65535737857
11 Partially correct 418 ms 56504 KB Output is partially correct - L = 65535737857
12 Partially correct 418 ms 56640 KB Output is partially correct - L = 65535737857
13 Partially correct 419 ms 56032 KB Output is partially correct - L = 65535737857
14 Partially correct 455 ms 55680 KB Output is partially correct - L = 65535737857
15 Correct 168 ms 19560 KB Output is correct - L = 183238657
16 Correct 167 ms 19440 KB Output is correct - L = 183238657
17 Correct 169 ms 19432 KB Output is correct - L = 183238657
18 Partially correct 476 ms 55608 KB Output is partially correct - L = 65535737857
19 Partially correct 462 ms 55744 KB Output is partially correct - L = 65535737857
20 Partially correct 465 ms 55768 KB Output is partially correct - L = 65535737857
21 Partially correct 457 ms 55712 KB Output is partially correct - L = 65535737857
22 Partially correct 475 ms 55576 KB Output is partially correct - L = 65535737857
23 Partially correct 520 ms 55528 KB Output is partially correct - L = 65535737857
24 Partially correct 513 ms 55480 KB Output is partially correct - L = 65535737857
25 Partially correct 506 ms 55496 KB Output is partially correct - L = 65535737857
26 Partially correct 519 ms 55168 KB Output is partially correct - L = 65535737857
27 Partially correct 531 ms 55224 KB Output is partially correct - L = 65535737857