oj.uz

답안 #563978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
563978 2022-05-18T10:17:30 Z blue City (JOI17_city) C++17
85 / 100
 2244 ms 74712 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.00275;
	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.00275;
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 39492 KB Output is correct
2 Correct 19 ms 39556 KB Output is correct
3 Correct 18 ms 39544 KB Output is correct
4 Correct 19 ms 39496 KB Output is correct
5 Correct 20 ms 39476 KB Output is correct
6 Correct 20 ms 39440 KB Output is correct
7 Correct 21 ms 39512 KB Output is correct
8 Correct 19 ms 39492 KB Output is correct
9 Correct 20 ms 39472 KB Output is correct
10 Correct 18 ms 39476 KB Output is correct
11 Correct 19 ms 39524 KB Output is correct
12 Correct 19 ms 39488 KB Output is correct

Subtask #2
77.0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 47860 KB Output is correct - L = 157548544
2 Correct 185 ms 47808 KB Output is correct - L = 157548544
3 Correct 178 ms 47868 KB Output is correct - L = 157548544
4 Correct 179 ms 47872 KB Output is correct - L = 157548544
5 Partially correct 2200 ms 74092 KB Output is partially correct - L = 719323136
6 Partially correct 2211 ms 74224 KB Output is partially correct - L = 719323136
7 Partially correct 2231 ms 74436 KB Output is partially correct - L = 719323136
8 Partially correct 2244 ms 73824 KB Output is partially correct - L = 719585280
9 Partially correct 2084 ms 74632 KB Output is partially correct - L = 721158144
10 Partially correct 2059 ms 74636 KB Output is partially correct - L = 722206720
11 Partially correct 2077 ms 74680 KB Output is partially correct - L = 722993152
12 Partially correct 2070 ms 74712 KB Output is partially correct - L = 722993152
13 Partially correct 2113 ms 74608 KB Output is partially correct - L = 720109568
14 Partially correct 2146 ms 74244 KB Output is partially correct - L = 720109568
15 Correct 178 ms 47892 KB Output is correct - L = 157548544
16 Correct 174 ms 47844 KB Output is correct - L = 157548544
17 Correct 184 ms 47932 KB Output is correct - L = 157548544
18 Partially correct 2117 ms 74308 KB Output is partially correct - L = 722731008
19 Partially correct 2151 ms 74152 KB Output is partially correct - L = 722731008
20 Partially correct 2097 ms 74100 KB Output is partially correct - L = 722731008
21 Partially correct 2104 ms 74080 KB Output is partially correct - L = 721420288
22 Partially correct 2122 ms 74020 KB Output is partially correct - L = 722468864
23 Partially correct 2158 ms 74340 KB Output is partially correct - L = 722731008
24 Partially correct 2135 ms 74320 KB Output is partially correct - L = 722468864
25 Partially correct 2173 ms 74228 KB Output is partially correct - L = 722206720
26 Partially correct 2151 ms 74160 KB Output is partially correct - L = 721944576
27 Partially correct 2170 ms 74032 KB Output is partially correct - L = 721682432