oj.uz

Submission #684267

# Submission time Handle Problem Language Result Execution time Memory
684267 2023-01-20T19:06:57 Z rainboy City (JOI17_city) C++17
8 / 100
 203 ms 13072 KB 
#include "Encoder.h"
#include <stdlib.h>
 
static const int N = 250000;
 
static int len[N + 1], offset[N + 1];
 
static void InitEncoder() {
	len[1] = 1;
	for (int n = 2, l = 0; n <= N; n++) {
		while (1 << l + 1 <= n)
			l++;
		len[n] = n * (l + 1);
	}
	offset[0] = 0;
	for (int n = 1; n <= N; n++)
		offset[n] = offset[n - 1] + len[N] / n;
}
 
static int *ej[N], eo[N], sz[N];
 
static void append(int i, int j) {
	int o = eo[i]++;
	if (o >= 2 && (o & o - 1) == 0)
		ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
	ej[i][o] = j;
}
 
static void dfs1(int p, int i) {
	sz[i] = 1;
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		if (j != p) {
			dfs1(i, j);
			sz[i] += sz[j];
		}
	}
}
 
static void dfs2(int p, int i, int x) {
	Code(i, offset[sz[i] - 1] + x / sz[i]);
	int j_ = -1;
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		if (j != p && (j_ == -1 || sz[j_] < sz[j]))
			j_ = j;
	}
	if (j_ != -1)
		dfs2(i, j_, x), x += len[sz[j_]];
	for (int o = eo[i]; o--; ) {
		int j = ej[i][o];
		if (j != p && j != j_) {
			x = (x + sz[j] - 1) / sz[j] * sz[j];
			dfs2(i, j, x), x += len[sz[j]];
		}
	}
}
 
void Encode(int n, int *ii, int *jj) {
	InitEncoder();
	for (int i = 0; i < n; i++)
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	for (int h = 0; h < n - 1; h++)
		append(ii[h], jj[h]), append(jj[h], ii[h]);
	dfs1(-1, 0);
	dfs2(-1, 0, 0);
}
#include "Device.h"
 
static const int N = 250000;
 
static int len[N + 1], offset[N + 1];
 
void InitDevice() {
	len[1] = 1;
	for (int n = 2, l = 0; n <= N; n++) {
		while (1 << l + 1 <= n)
			l++;
		len[n] = n * (l + 1);
	}
	offset[0] = 0;
	for (int n = 1; n <= N; n++)
		offset[n] = offset[n - 1] + len[N] / n;
}
 
static void Decode(long long x, int *a_, int *b_) {
	int lower = 0, upper = N + 1;
	while (upper - lower > 1) {
		int n = (lower + upper) / 2;
		if (x >= offset[n])
			lower = n;
		else
			upper = n;
	}
	int n = upper;
	*a_ = (x - offset[n - 1]) * n, *b_ = *a_ + len[n];
}
 
int Answer(long long x, long long y) {
	int tai, tbi, taj, tbj;
	Decode(x, &tai, &tbi), Decode(y, &taj, &tbj);
	if (taj <= tai && tbi <= tbj)
		return 0;
	if (tai <= taj && tbj <= tbi)
		return 1;
	return 2;
}

Compilation message

Encoder.cpp: In function 'void InitEncoder()':
Encoder.cpp:11:17: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   11 |   while (1 << l + 1 <= n)
      |               ~~^~~
Encoder.cpp: In function 'void append(int, int)':
Encoder.cpp:24:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   24 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~

Device.cpp: In function 'void InitDevice()':
Device.cpp:10:17: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   10 |   while (1 << l + 1 <= n)
      |               ~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4492 KB Output is correct
2 Correct 6 ms 4500 KB Output is correct
3 Correct 6 ms 4496 KB Output is correct
4 Correct 6 ms 4504 KB Output is correct
5 Correct 5 ms 4500 KB Output is correct
6 Correct 5 ms 4496 KB Output is correct
7 Correct 6 ms 4504 KB Output is correct
8 Correct 5 ms 4504 KB Output is correct
9 Correct 6 ms 4508 KB Output is correct
10 Correct 5 ms 4496 KB Output is correct
11 Correct 6 ms 4636 KB Output is correct
12 Correct 6 ms 4496 KB Output is correct

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Incorrect 203 ms 13072 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -