oj.uz

답안 #514701

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
514701 2022-01-18T11:33:41 Z amunduzbaev Amusement Park (JOI17_amusement_park) C++14
0 / 100
 27 ms 4964 KB 
#include "bits/stdc++.h"
using namespace std;
#include "Joi.h"

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

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;
		} d[i] = (d[i] - 1) % 60;
	}
	
	if(ok){
		for(int i=0;i<n;i++){;
			MessageBoard(i, x >> d[i] & 1);
		}
	} else {
		for(int i=0;i<min(n, 60);i++){
			MessageBoard(tt[i], x >> i & 1);
		} for(int i=60;i<n;i++){
			MessageBoard(tt[i], 0);
		}
	}
}
#include "bits/stdc++.h"
using namespace std;
#include "Ioi.h"

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

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);
	int r = -1;
	for(int i=0;i<n;i++){
		if(d[i] >= 60) r = i;
	}
	
	long long x = 0;
	if(~r){
		if(d[p] >= 60){
			for(int j=0;j<60;j++){ d[p] = (d[p] - 1) % 60;
				if(v) x |= (1ll << d[p]);
				if(p) v = Move(par[p]), p = par[p];
			} return x;
		} else { tt.clear();
			while(p) v = Move(par[p]), p = par[p];
			while(r) tt.push_back(r), r = par[r];
			for(int i=0;i<60;i++){ d[p] = (d[p] - 1) % 60;
				if(v) x |= (1ll << d[p]);
				if(tt.empty()){
					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 = 1; used[0] = 1;
	assert(!tt[0]);
	x |= v;
	tt.erase(tt.begin(), tt.begin() + 1);
	
	for(auto u : tt){
		p = u, v = Move(u);
		if(used[u]) continue;
		if(v) x |= (1ll << cnt);
		used[u] = 1; cnt++;
		if(cnt == 60) break;
	}
	
	return x;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 1 ms 1140 KB Output is correct
3 Correct 2 ms 1144 KB Output is correct
4 Incorrect 1 ms 1004 KB Wrong Answer [7]
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 4904 KB Output is correct
2 Correct 22 ms 4964 KB Output is correct
3 Correct 22 ms 4904 KB Output is correct
4 Correct 12 ms 3184 KB Output is correct
5 Correct 14 ms 3772 KB Output is correct
6 Correct 13 ms 3588 KB Output is correct
7 Correct 15 ms 3640 KB Output is correct
8 Correct 13 ms 3688 KB Output is correct
9 Correct 13 ms 3724 KB Output is correct
10 Correct 12 ms 3148 KB Output is correct
11 Correct 15 ms 3260 KB Output is correct
12 Correct 11 ms 2940 KB Output is correct
13 Correct 11 ms 2968 KB Output is correct
14 Correct 12 ms 3024 KB Output is correct
15 Correct 13 ms 3204 KB Output is correct
16 Correct 12 ms 3232 KB Output is correct
17 Correct 13 ms 3224 KB Output is correct
18 Correct 14 ms 3228 KB Output is correct
19 Correct 15 ms 3220 KB Output is correct
20 Correct 11 ms 3852 KB Output is correct
21 Correct 10 ms 3876 KB Output is correct
22 Incorrect 13 ms 3460 KB Wrong Answer [7]
23 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 1084 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 4912 KB Output is correct
2 Correct 23 ms 4948 KB Output is correct
3 Correct 26 ms 4856 KB Output is correct
4 Correct 14 ms 3204 KB Output is correct
5 Correct 13 ms 4208 KB Output is correct
6 Incorrect 18 ms 3696 KB Wrong Answer [7]
7 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 4876 KB Output is correct
2 Correct 25 ms 4844 KB Output is correct
3 Correct 27 ms 4900 KB Output is correct
4 Incorrect 16 ms 3204 KB Output isn't correct
5 Halted 0 ms 0 KB -