oj.uz

Submission #563977

# Submission time Handle Problem Language Result Execution time Memory
563977 2022-05-18T10:16:15 Z blue City (JOI17_city) C++17
85 / 100
 2235 ms 74784 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.0027;
	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.0027;
		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 18 ms 39516 KB Output is correct
2 Correct 19 ms 39508 KB Output is correct
3 Correct 19 ms 39312 KB Output is correct
4 Correct 21 ms 39508 KB Output is correct
5 Correct 20 ms 39472 KB Output is correct
6 Correct 18 ms 39524 KB Output is correct
7 Correct 18 ms 39492 KB Output is correct
8 Correct 19 ms 39512 KB Output is correct
9 Correct 19 ms 39496 KB Output is correct
10 Correct 19 ms 39472 KB Output is correct
11 Correct 19 ms 39516 KB Output is correct
12 Correct 19 ms 39504 KB Output is correct

Subtask #2
77.0 / 92.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 47940 KB Output is correct - L = 158597120
2 Correct 178 ms 47848 KB Output is correct - L = 158597120
3 Correct 187 ms 47808 KB Output is correct - L = 158597120
4 Correct 178 ms 47892 KB Output is correct - L = 158597120
5 Partially correct 2184 ms 74024 KB Output is partially correct - L = 730857472
6 Partially correct 2163 ms 74056 KB Output is partially correct - L = 730857472
7 Partially correct 2166 ms 74164 KB Output is partially correct - L = 730857472
8 Partially correct 2162 ms 73840 KB Output is partially correct - L = 731643904
9 Partially correct 2140 ms 74608 KB Output is partially correct - L = 732430336
10 Partially correct 2127 ms 74784 KB Output is partially correct - L = 733478912
11 Partially correct 2203 ms 74696 KB Output is partially correct - L = 734527488
12 Partially correct 2088 ms 74648 KB Output is partially correct - L = 734527488
13 Partially correct 2123 ms 74284 KB Output is partially correct - L = 731643904
14 Partially correct 2144 ms 74236 KB Output is partially correct - L = 731381760
15 Correct 179 ms 47904 KB Output is correct - L = 158597120
16 Correct 179 ms 48012 KB Output is correct - L = 158597120
17 Correct 177 ms 47892 KB Output is correct - L = 158597120
18 Partially correct 2142 ms 74316 KB Output is partially correct - L = 734265344
19 Partially correct 2153 ms 74740 KB Output is partially correct - L = 734265344
20 Partially correct 2163 ms 74144 KB Output is partially correct - L = 734265344
21 Partially correct 2145 ms 74568 KB Output is partially correct - L = 732954624
22 Partially correct 2113 ms 74352 KB Output is partially correct - L = 734003200
23 Partially correct 2168 ms 74236 KB Output is partially correct - L = 734003200
24 Partially correct 2235 ms 73992 KB Output is partially correct - L = 734003200
25 Partially correct 2137 ms 74184 KB Output is partially correct - L = 733741056
26 Partially correct 2130 ms 73980 KB Output is partially correct - L = 733478912
27 Partially correct 2139 ms 74056 KB Output is partially correct - L = 733216768