제출 #514060

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
514060		amunduzbaev	Amusement Park (JOI17_amusement_park)	C++14	0 / 100	25 ms	4976 KiB

Joi

#include "bits/stdc++.h"
using namespace std;
#include "Joi.h"

//~ #ifndef EVAL
//~ #include "grader.cpp"
//~ #endif

const int NN = 1e4 + 5;
vector<int> G[NN], tt;
int used[NN], d[NN];

void dfs(int u){
	used[u] = 1;
	tt.push_back(u);
	for(auto x : G[u]){
		if(used[x]) continue;
		d[x] = d[u] + 1;
		dfs(x);
	}
}

void Joi(int n, int m, int a[], int b[], long long x, int t) {
	for(int i=0;i<m;i++){
		G[a[i]].push_back(b[i]);
		G[b[i]].push_back(a[i]);
	} for(int i=0;i<n;i++){
		sort(G[i].begin(), G[i].end());
	}
	d[0] = 1;
	dfs(0);
	bool ok = 0;
	for(int i=0;i<n;i++){
		if(d[i] >= 60){
			ok = 1;
		}
	}
	
	if(ok){
		for(int i=0;i<n;i++){ d[i]--;
			MessageBoard(i, x >> (d[i] % 60) & 1);
		}
	} else {
		for(int i=0;i<60;i++){
			MessageBoard(tt[i], x >> i & 1);
		} for(int i=60;i<n;i++){
			MessageBoard(tt[i], 0);
		}
	}
}

Ioi

#include "bits/stdc++.h"
using namespace std;
#include "Ioi.h"

//~ #ifndef EVAL
//~ #include "grader.cpp"
//~ #endif

const int NN = 1e4 + 5;
vector<int> G[NN], tt;
int used[NN], par[NN], d[NN];

void dfs(int u){
	used[u] = 1;
	tt.push_back(u);
	for(auto x : G[u]){
		if(used[x]) continue;
		d[x] = d[u] + 1, 
		par[x] = u, dfs(x);
		tt.push_back(u);
	}
}

long long Ioi(int n, int m, int a[], int b[], int p, int v, int t) {
	for(int i=0;i<m;i++){
		G[a[i]].push_back(b[i]);
		G[b[i]].push_back(a[i]);
	}
	
	for(int i=0;i<n;i++) sort(G[i].begin(), G[i].end());
	d[0] = 1;
	dfs(0);
	bool ok = 0;
	int r = 0;
	for(int i=0;i<n;i++){
		if(d[i] >= 60) ok = 1, r = i;
	}
	
	if(ok){
		long long x = 0;
		if(d[p] >= 60){
			for(int j=0;j<60;j++){ d[p] = (d[p] - 1) % 60;
				x |= ((v * 1ll) << d[p]);
				if(p) v = Move(par[p]), p = par[p];
			} return x;
		} else {
			while(p) v = Move(par[p]), p = par[p];
			vector<int> tt;
			while(r) tt.push_back(r), r = par[r];
			for(int i=0;i<60;i++){ d[p]--;
				x |= ((v * 1ll) << (d[p] % 60));
				v = Move(tt.back()), p = tt.back(); tt.pop_back();
			} return x;
		}
	}
	
	while(p) v = Move(par[p]), p = par[p];
	memset(used, 0, sizeof used);
	int cnt = 0;
	long long x = 0;
	for(auto u : tt){
		if(u == p) continue;
		v = Move(u), p = u;
		if(used[u]) continue;
		used[u] = 1;
		x |= ((v * 1ll) << cnt);
		cnt++;
		if(cnt == 60) break;
	} return x;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 55
• Subtask 5: 0 / 17