답안 #934091

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
934091 2024-02-26T19:05:22 Z sopaconk City (JOI17_city) C++17
8 / 100
314 ms 33448 KB
#include "Encoder.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define deb(x) ;
using lli=long long int;
 
 
static lli aux=0;
void dfs(int n , int par, vector<vector<int>> &adj, vector<pair<lli,lli>> &range ){
	lli ini=aux;
	aux++;
	for(int x: adj[n]){
		if(x==par) continue;
		dfs(x, n, adj, range);
 
	}
	lli fin=aux;

	range[n]={ini, fin};
}
 
 
void Encode(int N, int A[], int B[])
{
	
	vector<vector<int>> adj (N);
	for(int i=0; i<N-1; ++i){
		adj[A[i]].pb(B[i]);
		adj[B[i]].pb(A[i]);
	}
	vector<pair<lli,lli>> range (N);
	dfs(0,-1,adj, range);
 
 
 
	for (int i = 0; i < N; ++i) {
		lli ini=range[i].first;
		lli fin=range[i].second;


		Code(i, ini*250000+fin);
	}
}
#include "Device.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define deb(x) ;
using lli=long long int;
void InitDevice()
{
}
 
int Answer(long long S, long long T)
{
	lli finS=S%250000;
	lli iniS= (S-finS)/250000;
	lli finT=T%250000;
	lli iniT=(T-finT)/250000;
	if(iniT <= iniS && finS <= finT){
		return 0;
	}
	if(iniS <= iniT && finT <= finS){
		return 1;
	}
	return 2;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4880 KB Output is correct
2 Correct 1 ms 4880 KB Output is correct
3 Correct 2 ms 4892 KB Output is correct
4 Correct 1 ms 4892 KB Output is correct
5 Correct 1 ms 5396 KB Output is correct
6 Correct 1 ms 4880 KB Output is correct
7 Correct 0 ms 4892 KB Output is correct
8 Correct 1 ms 4880 KB Output is correct
9 Correct 1 ms 4900 KB Output is correct
10 Correct 2 ms 4880 KB Output is correct
11 Correct 1 ms 4892 KB Output is correct
12 Correct 1 ms 4880 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 12420 KB Output is correct - L = 174750700
2 Correct 127 ms 12532 KB Output is correct - L = 174500699
3 Correct 124 ms 12500 KB Output is correct - L = 174750700
4 Correct 121 ms 12360 KB Output is correct - L = 174750700
5 Incorrect 314 ms 33448 KB Wrong Answer [6]
6 Halted 0 ms 0 KB -