Submission #1059122

#	Time	Username	Problem	Language	Result	Execution time	Memory
1059122		jamjanek	City (JOI17_city)	C++14	8 / 100	196 ms	52448 KiB

Encoder

#include "Encoder.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>graf[250010];
int preorder[250010], post[250010], preit, postit;
int r[250010];

vector<int>rozmiary;

void dfs(int x, int o){
	preorder[x]=preit++;
	for(auto j: graf[x])
		if(j!=o){
			dfs(j, x);
			r[x]+=r[j]+1;
		}
	int pom = *lower_bound(rozmiary.begin(), rozmiary.end(), r[x]);
	preit+=pom-r[x];
	r[x]+=pom-r[x];
}



void Encode(int n, int A[], int B[])
{
	rozmiary.push_back(0);
	while(rozmiary.size()<=20){
		rozmiary.push_back(max(rozmiary.back()+1, int(2*rozmiary.back())));
	}
	int i;
	for(i=0;i<n-1;i++){
		graf[A[i]].push_back(B[i]);
		graf[B[i]].push_back(A[i]);
	}
	dfs(0,-1);
//	for(int i=0;i<n;i++)
//		printf("%d: %d %d %d\n", i, preorder[i], r[i], int(lower_bound(rozmiary.begin(), rozmiary.end(), r[i])-rozmiary.begin()));
	for (int i = 0; i < n; ++i) {
		Code(i, preorder[i]*rozmiary.size()+int(lower_bound(rozmiary.begin(), rozmiary.end(), r[i])-rozmiary.begin()));
	}
}

Device

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

long long sumypD[250010];

vector<int>rozmiary1;
void InitDevice()
{
	rozmiary1.push_back(0);
	while(rozmiary1.size()<=20){
		rozmiary1.push_back(max(rozmiary1.back()+1, int(2*rozmiary1.back())));
	}
}
int Answer(long long S, long long T)
{
	int X1 = S/rozmiary1.size(),X2 = rozmiary1[S%rozmiary1.size()];
	int Y1 = T/rozmiary1.size(),Y2 = rozmiary1[T%rozmiary1.size()];

//	cerr<<X1<<" "<<X2<<" "<<Y1<<" "<<Y2<<" "<<S<<" "<<T<<"\n";
	if(X1<=Y1 && X1+X2>=Y1)return 1;
	if(Y1<=X1 && Y2+Y1>=X1)return 0;
	return 2;
	
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 92