oj.uz

답안 #934100

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
934100 2024-02-26T19:16:19 Z Juanchoki City (JOI17_city) C++14
8 / 100
 271 ms 64528 KB 
#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 void dfs(int yo, int pa)
{
	ini[yo] = pos++;
	for (int v: adj[yo])
		if (v != pa) dfs(v, yo);
	fin[yo] = pos-1;
}	

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]*(1e5) + fin[i];
		//cout << temp << " ";
		Code(i, temp);
	}

}
// g++ grader.cpp Encoder.cpp Device.cpp
#include "Device.h"
#include <vector>
#include <string>
#include <iostream>
using namespace std;
void InitDevice()
{
}

int Answer(long long S, long long T)
{
	int div = 1e5;
	//cout << S << " " << T << '\n';
	long long iniS = S/div, iniT = T/div;
	long long finS = S%div, finT = 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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 33552 KB Output is correct
2 Correct 6 ms 33552 KB Output is correct
3 Correct 6 ms 33560 KB Output is correct
4 Correct 8 ms 33548 KB Output is correct
5 Correct 7 ms 33552 KB Output is correct
6 Correct 9 ms 33816 KB Output is correct
7 Correct 7 ms 33564 KB Output is correct
8 Correct 6 ms 33552 KB Output is correct
9 Correct 9 ms 33808 KB Output is correct
10 Correct 6 ms 33552 KB Output is correct
11 Correct 6 ms 33560 KB Output is correct
12 Correct 6 ms 33548 KB Output is correct

Subtask #2
0 / 92.0

# 결과 실행 시간 메모리 Grader output
1 Correct 126 ms 41068 KB Output is correct - L = 70000700
2 Correct 132 ms 41172 KB Output is correct - L = 69900699
3 Correct 128 ms 41128 KB Output is correct - L = 70000700
4 Correct 128 ms 41116 KB Output is correct - L = 70000700
5 Incorrect 271 ms 64528 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -