oj.uz

Submission #563976

# Submission time Handle Problem Language Result Execution time Memory
563976 2022-05-18T10:14:56 Z blue City (JOI17_city) C++17
84 / 100
 2415 ms 75056 KB 
#include "Encoder.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cassert>
using namespace std;
 
	namespace{
using vi = vector<int>;
using vvi = vector<vi>;
#define sz(x) int(x.size())
 
 
const int mx = 700'000;
using ll = long long;
using vll = vector<ll>;
 
int N;
vi edge[mx];
 
vll code(mx, 0);
 
vll dfsind(mx, 0);
vll subtree(mx, 1);
vll fakesubtree(mx, 1);
 
int ct = -1;
 
 
 
 
 
 
 
vll getsizes()
{
	double base = 1.0024;
	set<ll> res;
	res.insert(1);
 
	double curr = 1;
	while(res.empty() || *res.rbegin() < mx)
	{
		curr *= base;
		res.insert(curr);
	}
 
	vll resvec;
	for(ll k : res)
		resvec.push_back(k);
 
	return resvec;
}
 
 
vll sizes;
 
 
 
void dfs(int u, int p)
{
	// cerr << "dfs " << u << '\n';
	dfsind[u] = ++ct;
	for(int v : edge[u])
	{
		if(v == p) continue;
		dfs(v, u);
		subtree[u] += subtree[v];
	}

	cerr << u << " : " << subtree[u] << " -> ";

	auto z = lower_bound(sizes.begin(), sizes.end(), (ll) subtree[u]);
	assert(z != sizes.end() && *z >= subtree[u]);
	subtree[u] = *z;
	assert(subtree[u] <= mx);
	fakesubtree[u] = z - sizes.begin();
	cerr << subtree[u] << '\n';
}
 
 
 
 
 
 
 
	}
 
 
void Encode(int N_, int A[], int B[])
{
	N = N_;
	sizes = getsizes();
 
	cerr << sz(sizes) << '\n';
 
	// for(int z : sizes)
	// 	cerr << z << ' ';
	// cerr << '\n';
 
 
 
	for(int e = 0; e < N-1; e++)
	{
		edge[A[e]].push_back(B[e]);
		edge[B[e]].push_back(A[e]);
	}
 
	// cerr << "done\n";
 
	dfs(0, -1);
 
 
	// cerr << "done2\n";
 
	for(int i = 0; i < N; i++)
	{
		// cerr << i << " : " << dfsind[i] << ' ' << subtree[i] << ' ' << ((dfsind[i]<<18) | subtree[i]) << '\n';
		Code(i, (fakesubtree[i] << 18) | dfsind[i]);
	}
}
#include "Device.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
 
namespace
{
	using vi = vector<int>;
	using vvi = vector<vi>;
	using ll = long long;
	using vll = vector<ll>;
	#define sz(x) int(x.size())
 
	const int mx = 700'000;
 
	vll getsizes()
	{
		double base = 1.0024;
		set<ll> res;
		res.insert(1);
 
		double curr = 1;
		while(res.empty() || *res.rbegin() < mx)
		{
			curr *= base;
			res.insert(curr);
		}
 
		vll resvec;
		for(ll k : res)
			resvec.push_back(k);
 
		return resvec;
	}
 
 
	vll sizes;
 
}
 
void InitDevice()
{
	sizes = getsizes();
}
 
int Answer(long long S, long long T)
{
	ll s_st = sizes[S>>18];
	ll s_ind = S & ((1<<18) - 1);
 
	ll t_st = sizes[T>>18];
	ll t_ind = T & ((1<<18) - 1);
 
	// cerr << S << ' ' << T << " : " << s_ind << ' ' << s_st << " | " << t_ind << ' ' << t_st << "\n";
 
	if(t_ind <= s_ind && s_ind + s_st <= t_ind + t_st)
		return 0;
	else if(s_ind <= t_ind && t_ind + t_st <= s_ind + s_st)
		return 1;
	else
		return 2;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39540 KB Output is correct
2 Correct 19 ms 39512 KB Output is correct
3 Correct 20 ms 39564 KB Output is correct
4 Correct 23 ms 39516 KB Output is correct
5 Correct 18 ms 39492 KB Output is correct
6 Correct 19 ms 39496 KB Output is correct
7 Correct 21 ms 39476 KB Output is correct
8 Correct 25 ms 39448 KB Output is correct
9 Correct 19 ms 39496 KB Output is correct
10 Correct 20 ms 39568 KB Output is correct
11 Correct 24 ms 39432 KB Output is correct
12 Correct 19 ms 39496 KB Output is correct

Subtask #2
76.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 47892 KB Output is correct - L = 165675008
2 Correct 194 ms 47960 KB Output is correct - L = 165675008
3 Correct 184 ms 47916 KB Output is correct - L = 165675008
4 Correct 191 ms 47932 KB Output is correct - L = 165675008
5 Partially correct 2365 ms 74164 KB Output is partially correct - L = 809238528
6 Partially correct 2397 ms 74028 KB Output is partially correct - L = 809238528
7 Partially correct 2410 ms 74088 KB Output is partially correct - L = 809238528
8 Partially correct 2415 ms 73776 KB Output is partially correct - L = 810287104
9 Partially correct 2266 ms 74608 KB Output is partially correct - L = 811073536
10 Partially correct 2135 ms 75056 KB Output is partially correct - L = 811859968
11 Partially correct 2145 ms 74636 KB Output is partially correct - L = 812908544
12 Partially correct 2083 ms 74688 KB Output is partially correct - L = 812908544
13 Partially correct 2106 ms 74492 KB Output is partially correct - L = 810287104
14 Partially correct 2144 ms 74220 KB Output is partially correct - L = 809762816
15 Correct 178 ms 47896 KB Output is correct - L = 165675008
16 Correct 176 ms 47996 KB Output is correct - L = 165675008
17 Correct 175 ms 47920 KB Output is correct - L = 165675008
18 Partially correct 2144 ms 74148 KB Output is partially correct - L = 812646400
19 Partially correct 2151 ms 74256 KB Output is partially correct - L = 812908544
20 Partially correct 2114 ms 74196 KB Output is partially correct - L = 812908544
21 Partially correct 2130 ms 74252 KB Output is partially correct - L = 811597824
22 Partially correct 2151 ms 74128 KB Output is partially correct - L = 812646400
23 Partially correct 2127 ms 74044 KB Output is partially correct - L = 812646400
24 Partially correct 2186 ms 74460 KB Output is partially correct - L = 812384256
25 Partially correct 2182 ms 74024 KB Output is partially correct - L = 812122112
26 Partially correct 2189 ms 74008 KB Output is partially correct - L = 811859968
27 Partially correct 2121 ms 74084 KB Output is partially correct - L = 811597824