Submission #935233

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
935233	2024-02-28T23:36:31 Z	Juanchoki	City (JOI17_city)	C++14	8 / 100	131 ms	52420 KB

Encoder

#include "Encoder.h"
#include <vector>
#include <iostream>
using namespace std;
static const int maxn = 1<<20;
static vector<int> adj[maxn];
static int ini[maxn], fin[maxn];
static int pos = 1;
static int tam[maxn];
static int dfs(int yo, int pa)
{
	ini[yo] = pos++;
	int cnt = 1;
	for (int v: adj[yo])
		if (v != pa) cnt+=dfs(v, yo);
	fin[yo] = pos-1;
	return tam[yo] = cnt;
}	
 
void Encode(int N, int A[], int B[])
{
	//cout << "llama ";
	vector<int> v;
	for (int i = 0; i < N-1; ++i) 
	{
 
		adj[A[i]].push_back(B[i]);
		adj[B[i]].push_back(A[i]);
	}
	
 
	dfs(0, -1);
 
	long long temp;
	for (int i = 0; i < N; i++)
	{
		//cout << i << " " << ini[i] << " " << fin[i] << '\n';
		temp = ini[i]*(250000) + tam[i];
		//cout << temp << " ";
		Code(i, temp);
	}
 
}

Device

#include "Device.h"
#include <vector>
#include <string>
#include <iostream>
using namespace std;
void InitDevice()
{
}
 
int Answer(long long S, long long T)
{
	int div = 250000;
	//cout << S << " " << T << '\n';
	long long iniS = S/div, iniT = T/div;
	long long finS = iniS + S%div, finT = iniT + T%div;
	//cout << iniS << " " << finS << '\n';
	//cout << iniT << " " << finT << '\n';
	if (iniS <= iniT && finT <= finS)
	{
		return 1;
	}
	if (iniT <= iniS && finS <= finT)
	{
		return 0;
	}
	return 2;
}

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	33568 KB	Output is correct
2	Correct	8 ms	33556 KB	Output is correct
3	Correct	6 ms	33568 KB	Output is correct
4	Correct	6 ms	33556 KB	Output is correct
5	Correct	6 ms	33568 KB	Output is correct
6	Correct	6 ms	33568 KB	Output is correct
7	Correct	6 ms	33556 KB	Output is correct
8	Correct	7 ms	33568 KB	Output is correct
9	Correct	7 ms	33556 KB	Output is correct
10	Correct	6 ms	33568 KB	Output is correct
11	Correct	8 ms	33552 KB	Output is correct
12	Correct	6 ms	33564 KB	Output is correct

Subtask #2

0 / 92.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	128 ms	48164 KB	Output is correct - L = 175000001
2	Correct	128 ms	48216 KB	Output is correct - L = 174750001
3	Correct	131 ms	48172 KB	Output is correct - L = 175000001
4	Correct	128 ms	48496 KB	Output is correct - L = 175000001
5	Incorrect	95 ms	52420 KB	Wrong Answer [3]
6	Halted	0 ms	0 KB	-