제출 #933997

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
933997		Saul0906	City (JOI17_city)	C++14	8 / 100	126 ms	31940 KiB

Encoder

#include <bits/stdc++.h>
#include "Encoder.h"
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define ll long long
#define pb push_back

using namespace std;

const int lim=3e5+5;
ll tim=0, tin[lim], tout[lim];
vector<int> ady[lim];
void dfs(int u, int p){
	tin[u]=tim++;
	repa(v,ady[u]){
		if(v!=p) dfs(v,u);
	}
	tout[u]=tim++;
}

void Encode(int N, int *A, int *B){
	rep(i,0,N-1){
		ady[A[i]].pb(B[i]);
		ady[B[i]].pb(A[i]);
	}
	dfs(0,-1);
	rep(i,0,N){
		ll x=1e6+tin[i];
		x*=1e6;
		x+=tout[i];
		//cout<<i<<" "<<x<<" "<<tin[i]<<" "<<tout[i]<<endl;
		Code(i,x);
	}
}

Device

#include <bits/stdc++.h>
#include "Device.h"
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define ll long long

using namespace std;

void InitDevice(){
	return;
}

const ll md=1e6;

int Answer(ll S, ll T){
	ll a, b, c, d;
	b=(S%md);
	S/=md;
	a=(S%md);
	d=(T%md);
	T/=md;
	c=(T%md);
	if(a<=c && d<=b) return 1;
	if(c<=a && b<=d) return 0;
	return 2;
}

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