Submission #426640

# Submission time Handle Problem Language Result Execution time Memory
426640 2021-06-14T08:27:05 Z 송준혁(#7530) City (JOI17_city) C++14
22 / 100
550 ms 40020 KB
#include "Encoder.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define MOD 1000000007
#define INF (1ll<<62)
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;

static int I[303030], num;
static vector<int> adj[303030];

static void f(int u, int p){
	I[u] = ++num;
	for (int v : adj[u]){
		if (v == p) continue;
		f(v, u);
	}
	Code(u, I[u]*250505ll+num);
}

void Encode(int N, int A[], int B[]){
	for (int i=0; i<N-1; i++) adj[A[i]].pb(B[i]), adj[B[i]].pb(A[i]);
	f(0, -1);
}
#include "Device.h"

void InitDevice(){

}

int Answer(long long S, long long T){
	int l1 = S/250505, r1 = S%250505;
	int l2 = T/250505, r2 = T%250505;
	if (l1 <= l2 && r2 <= r1) return 1;
	if (l2 <= l1 && r1 <= r2) return 0;
	return 2;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 7676 KB Output is correct
2 Correct 5 ms 7676 KB Output is correct
3 Correct 5 ms 7684 KB Output is correct
4 Correct 6 ms 7676 KB Output is correct
5 Correct 5 ms 7676 KB Output is correct
6 Correct 5 ms 7680 KB Output is correct
7 Correct 6 ms 7684 KB Output is correct
8 Correct 5 ms 7676 KB Output is correct
9 Correct 5 ms 7676 KB Output is correct
10 Correct 5 ms 7676 KB Output is correct
11 Correct 6 ms 7724 KB Output is correct
12 Correct 6 ms 7676 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 192 ms 16260 KB Output is correct - L = 175354200
2 Correct 193 ms 16156 KB Output is correct - L = 175103694
3 Correct 191 ms 16068 KB Output is correct - L = 175354200
4 Correct 201 ms 16244 KB Output is correct - L = 175354200
5 Partially correct 509 ms 39352 KB Output is partially correct - L = 62626500000
6 Partially correct 515 ms 39552 KB Output is partially correct - L = 62626500000
7 Partially correct 509 ms 39344 KB Output is partially correct - L = 62626500000
8 Partially correct 514 ms 38904 KB Output is partially correct - L = 62626500000
9 Partially correct 428 ms 39876 KB Output is partially correct - L = 62626500000
10 Partially correct 425 ms 39980 KB Output is partially correct - L = 62626500000
11 Partially correct 476 ms 40000 KB Output is partially correct - L = 62626500000
12 Partially correct 416 ms 40020 KB Output is partially correct - L = 62626500000
13 Partially correct 505 ms 39728 KB Output is partially correct - L = 62626500000
14 Partially correct 477 ms 39360 KB Output is partially correct - L = 62626500000
15 Correct 204 ms 16184 KB Output is correct - L = 175354200
16 Correct 193 ms 16124 KB Output is correct - L = 175354200
17 Correct 224 ms 16296 KB Output is correct - L = 175354200
18 Partially correct 540 ms 39472 KB Output is partially correct - L = 62626500000
19 Partially correct 472 ms 39524 KB Output is partially correct - L = 62626500000
20 Partially correct 545 ms 39432 KB Output is partially correct - L = 62626500000
21 Partially correct 511 ms 39608 KB Output is partially correct - L = 62626500000
22 Partially correct 509 ms 39528 KB Output is partially correct - L = 62626500000
23 Partially correct 515 ms 39584 KB Output is partially correct - L = 62626500000
24 Partially correct 498 ms 39224 KB Output is partially correct - L = 62626500000
25 Partially correct 527 ms 39680 KB Output is partially correct - L = 62626500000
26 Partially correct 548 ms 39448 KB Output is partially correct - L = 62626500000
27 Partially correct 550 ms 39292 KB Output is partially correct - L = 62626500000