oj.uz

Submission #551966

# Submission time Handle Problem Language Result Execution time Memory
551966 2022-04-22T04:30:28 Z LucaDantas City (JOI17_city) C++17
0 / 100
 164 ms 16596 KB 
#include "Encoder.h"
#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 1<<18;
constexpr double base = 1.05; // uso os intervalos em tamanho de potencias dessa base

vector<int> g[maxn];

static vector<int> val;

void set_val() {
	val.push_back(1);
	for(int i = 1; i < (1 << 8); i++) {
		int aq = val.back() * base;
		if(aq == val.back()) ++aq;
		val.push_back(aq);
	}
}

int find_pot(int x) { return lower_bound(val.begin(), val.end(), x) - val.begin(); }

int dfs(int u, int p, int in) {
	int out = in+1;
	for(int v : g[u]) if(v != p)
		out = dfs(v, u, out);
	int sz = out - in, d = find_pot(sz);
	Code(u, in<<8|d);
	return in + val[d];
}

void Encode(int N, int A[], int B[])
{
	set_val();
	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, 0);
}

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

constexpr double base = 1.05;

static vector<int> val;

void InitDevice() {
	val.push_back(1);
	for(int i = 1; i < (1 << 8); i++) {
		int aq = val.back() * base;
		if(aq == val.back()) ++aq;
		val.push_back(aq);
	}
}

int Answer(long long S, long long T)
{
	int in[2], out[2];
	for(int rep = 0; rep < 2; rep++, swap(S, T)) {
		in[rep] = S >> 8;
		out[rep] = in[rep] + (S & ((1<<9)-1));
	}
	int vira = 0;
	if(in[0] > in[1])
		swap(in[0], in[1]), swap(out[0], out[1]), vira = 1;
	return (out[0] >= in[1] ? 1^vira : 2);
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 92.0

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