Submission #27318

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
27318	2017-07-12T08:14:15 Z	김동현(#1138)	City (JOI17_city)	C++14	8 / 100	3000 ms	20088 KB

Encoder

#include "Encoder.h"
#include <vector>
using namespace std;
typedef long long ll;

static int ps[250010], pe[250010], cnt;
static vector<int> e[250010];

void f(int x, int p){
	ps[x] = ++cnt;
	for(auto &i : e[x]) if(i != p) f(i, x);
	pe[x] = cnt;
}

void Encode(int N, int A[], int B[]){
	for(int i = 0; i < N - 1; i++){
		e[A[i]].push_back(B[i]);
		e[B[i]].push_back(A[i]);
	}
	f(0, 0);
	for(int i = 0; i < N; i++){
		ll x = ps[i] + 1;
		for(int j = 1; j <= pe[i]; j++) x += j;
		Code(i, x);
	}
}

Device

#include "Device.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

void InitDevice(){}

pii get(ll x){
	int e; for(e = 1; x > e; e++) x -= e;
	return {int(x), e};
}

int Answer(ll S, ll T){
	int ss, se, ts, te;
	tie(ss, se) = get(S);
	tie(ts, te) = get(T);
	return (ts <= ss && se <= te) ? 0 : (ss <= ts && te <= se) ? 1 : 2;
}

Subtask #1

8.0 / 8.0

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

Subtask #2

0 / 92.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	252 ms	19440 KB	Output is correct - L = 246051
2	Correct	255 ms	19440 KB	Output is correct - L = 245350
3	Correct	252 ms	19552 KB	Output is correct - L = 246051
4	Correct	250 ms	19504 KB	Output is correct - L = 246051
5	Execution timed out	3053 ms	20088 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-