oj.uz

Submission #551911

# Submission time Handle Problem Language Result Execution time Memory
551911 2022-04-21T21:49:26 Z LucaDantas City (JOI17_city) C++17
22 / 100
 398 ms 55940 KB 
#include "Encoder.h"
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 1<<18;

vector<int> g[maxn];
long long t, in[maxn], out[maxn];

void dfs(int u, int p) {
	in[u] = ++t;
	for(int v : g[u]) if(v != p)
		dfs(v, u);
	out[u] = t;
}

void Encode(int N, int A[], int B[])
{
	for(int i = 0; i < N-1; i++)
		g[A[i]].push_back(B[i]), g[B[i]].push_back(A[i]);
	dfs(0, -1);
	for (int i = 0; i < N; ++i)
		Code(i, in[i] | (out[i] << 18));
}

#include "Device.h"
#include <bits/stdc++.h>
using namespace std;

void InitDevice()
{
}

int Answer(long long S, long long T)
{
	long long in[2], out[2];
	for(int rep = 0; rep < 2; rep++, swap(S, T)) {
		out[rep] = S >> 18;
		in[rep] = S ^ (out[rep] << 18);
	}
	int vira = 0;
	if(in[0] > in[1])
		swap(in[0], in[1]), swap(out[0], out[1]), vira = 1;
	/* printf("%lld %lld | %lld %lld\n", in[0], out[0], in[1], out[1]);
	printf("%d\n\n", out[0] >= in[1] ? 1^vira : 2); */
	return (out[0] >= in[1] ? 1^vira : 2);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6808 KB Output is correct
2 Correct 4 ms 6824 KB Output is correct
3 Correct 3 ms 6808 KB Output is correct
4 Correct 4 ms 6808 KB Output is correct
5 Correct 4 ms 6808 KB Output is correct
6 Correct 4 ms 6820 KB Output is correct
7 Correct 3 ms 6816 KB Output is correct
8 Correct 3 ms 6808 KB Output is correct
9 Correct 3 ms 6816 KB Output is correct
10 Correct 3 ms 6808 KB Output is correct
11 Correct 3 ms 6816 KB Output is correct
12 Correct 3 ms 6804 KB Output is correct

Subtask #2
14.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 15384 KB Output is correct - L = 183501500
2 Correct 151 ms 15344 KB Output is correct - L = 183239355
3 Correct 153 ms 15208 KB Output is correct - L = 183501500
4 Correct 153 ms 15300 KB Output is correct - L = 183501500
5 Partially correct 368 ms 47984 KB Output is partially correct - L = 65536250000
6 Partially correct 369 ms 54720 KB Output is partially correct - L = 65536250000
7 Partially correct 387 ms 55008 KB Output is partially correct - L = 65536250000
8 Partially correct 398 ms 54604 KB Output is partially correct - L = 65536250000
9 Partially correct 308 ms 55600 KB Output is partially correct - L = 65536250000
10 Partially correct 320 ms 55776 KB Output is partially correct - L = 65536250000
11 Partially correct 299 ms 55752 KB Output is partially correct - L = 65536250000
12 Partially correct 322 ms 55940 KB Output is partially correct - L = 65536250000
13 Partially correct 340 ms 55432 KB Output is partially correct - L = 65536250000
14 Partially correct 385 ms 54804 KB Output is partially correct - L = 65536250000
15 Correct 153 ms 22344 KB Output is correct - L = 183501500
16 Correct 156 ms 22412 KB Output is correct - L = 183501500
17 Correct 156 ms 22324 KB Output is correct - L = 183501500
18 Partially correct 389 ms 55048 KB Output is partially correct - L = 65536250000
19 Partially correct 360 ms 54924 KB Output is partially correct - L = 65536250000
20 Partially correct 355 ms 54836 KB Output is partially correct - L = 65536250000
21 Partially correct 337 ms 54924 KB Output is partially correct - L = 65536250000
22 Partially correct 377 ms 54988 KB Output is partially correct - L = 65536250000
23 Partially correct 350 ms 55052 KB Output is partially correct - L = 65536250000
24 Partially correct 395 ms 54976 KB Output is partially correct - L = 65536250000
25 Partially correct 392 ms 54868 KB Output is partially correct - L = 65536250000
26 Partially correct 391 ms 54800 KB Output is partially correct - L = 65536250000
27 Partially correct 365 ms 55004 KB Output is partially correct - L = 65536250000