oj.uz

답안 #69400

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
69400 2018-08-20T18:56:26 Z IvanC Amusement Park (JOI17_amusement_park) C++17
77 / 100
 62 ms 31584 KB 
#include "Joi.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 10011;
const int MOD = 60;

static vector<int> grafo[MAXN],digitos;
static int dfs_num[MAXN],nivel[MAXN],dfsCount,maior[MAXN];

static void dfs(int v){

	dfs_num[v] = dfsCount % MOD;
	dfsCount++;

	for(int u : grafo[v]){
		if(dfs_num[u] != -1) continue;
		nivel[u] = nivel[v] + 1;
		dfs(u);
		maior[v] = max(maior[v],maior[u]);
	}

}

void Joi(int N, int M, int A[], int B[], long long X, int T){
	
	memset(dfs_num,-1,sizeof(dfs_num));
	dfsCount = 0;
	for(int i = 0;i<N;i++) grafo[i].clear();
	digitos.clear();

	for(int i = 0;i<MOD;i++){
		if((1LL << i) & X)	digitos.push_back(1);
		else digitos.push_back(0);
	}

	for(int i = 0;i<M;i++){
		grafo[A[i]].push_back(B[i]);
		grafo[B[i]].push_back(A[i]);
	}	

	for(int i = 0;i<N;i++) sort(grafo[i].begin(),grafo[i].end());

	dfs(0);

	if(maior[0] + 1 < MOD){
		for(int i = 0; i < N; i++){	
			MessageBoard(i, digitos[dfs_num[i]]);
		}
	}
	else{
		for(int i = 0;i<N;i++) MessageBoard(i, digitos[nivel[i] % MOD] );
	}

}

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

const int MAXN = 10011;
const int MOD = 60;

static deque<int> grafo[MAXN],tree[MAXN];
static int digitos[MOD],freq[MOD],distintos,processado[MAXN],dfsCount,dfs_num[MAXN],qual_digito[MAXN],pai[MAXN],nivel[MAXN],maior[MAXN];

static void add_number(int x){
	if(freq[x] == 0) distintos++;
	freq[x]++;
}

static void add_vertex(int v){
	digitos[dfs_num[v]] = qual_digito[v];
	add_number(dfs_num[v]);
}

static void greedy_add(int v){
	int qual = nivel[v] % MOD;
	digitos[qual] = qual_digito[v];
	add_number(qual);
}

static void dfs(int v){

	dfs_num[v] = dfsCount % MOD;
	dfsCount++;

	for(int u : grafo[v]){
		if(dfs_num[u] != -1) continue;
		pai[u] = v;
		nivel[u] = nivel[v] + 1;
		tree[v].push_back(u);
		dfs(u);
		maior[v] = max(maior[v],maior[u]);
	}

}

static void find_ans(int v,int st){

	processado[v] = 1;
	add_vertex(v);
	if(distintos == MOD) return;

	deque<int> temp;

	while(st != -1 && tree[v].front() != st){
		temp.push_front(tree[v].front());
		tree[v].pop_front();
	}

	for(int u : temp) tree[v].push_back(u);
	temp.clear();

	for(int u : tree[v]){
		if(distintos == MOD) return;
		if(processado[u]) continue;
		int davez = Move(u);
		qual_digito[u] = davez;
		find_ans(u,-1);
		if(distintos == MOD) return;
		Move(v);
	}

	if(distintos != MOD){
		int davez = Move(pai[v]);
		qual_digito[pai[v]] = davez;
		find_ans(pai[v],v);
	}

}

static void greedy(int v){

	greedy_add(v);
	while(v != 0 && distintos != MOD){
		int u = pai[v];
		qual_digito[u] = Move(u);
		greedy_add(u);
		v = u;
	}

	if(distintos == MOD) return;

	while(distintos != MOD){
		int mx = -1,alvo = -1;
		for(int u : tree[v]){
			if(maior[u] > mx){
				mx = maior[u];
				alvo = u;
			}
		}
		qual_digito[alvo] = Move(alvo);
		greedy_add(alvo);
		v = alvo;
	}

}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {

	memset(dfs_num,-1,sizeof(dfs_num));
	memset(processado,0,sizeof(processado));
	memset(freq,0,sizeof(freq));
	dfsCount = 0;
	distintos = 0;
	for(int i = 0;i<N;i++) grafo[i].clear();
	for(int i = 0;i<N;i++) tree[i].clear();

	for(int i = 0;i<M;i++){
		grafo[A[i]].push_back(B[i]);
		grafo[B[i]].push_back(A[i]);
	}	

	for(int i = 0;i<N;i++) sort(grafo[i].begin(),grafo[i].end());

	dfs(0);

	qual_digito[P] = V;

	if(maior[0] + 1 < MOD) find_ans(P,-1);
	else greedy(P);

	long long ans = 0;
	for(int i = 0;i<MOD;i++) if(digitos[i]) ans += (1LL << i);

	return ans;

}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 14688 KB Output is correct
2 Correct 19 ms 28312 KB Output is correct
3 Correct 20 ms 28512 KB Output is correct
4 Correct 22 ms 28512 KB Output is correct
5 Correct 19 ms 28512 KB Output is correct
6 Correct 20 ms 28676 KB Output is correct
7 Correct 17 ms 28840 KB Output is correct
8 Correct 17 ms 28840 KB Output is correct
9 Correct 22 ms 28852 KB Output is correct
10 Correct 18 ms 28864 KB Output is correct
11 Correct 22 ms 28864 KB Output is correct
12 Correct 17 ms 28864 KB Output is correct
13 Correct 17 ms 28864 KB Output is correct
14 Correct 17 ms 28864 KB Output is correct
15 Correct 17 ms 28864 KB Output is correct
16 Correct 16 ms 28864 KB Output is correct
17 Correct 18 ms 28864 KB Output is correct
18 Correct 17 ms 28864 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 30100 KB Output is correct
2 Correct 48 ms 31424 KB Output is correct
3 Correct 54 ms 31512 KB Output is correct
4 Correct 37 ms 31512 KB Output is correct
5 Correct 35 ms 31512 KB Output is correct
6 Correct 45 ms 31512 KB Output is correct
7 Correct 35 ms 31512 KB Output is correct
8 Correct 33 ms 31512 KB Output is correct
9 Correct 33 ms 31512 KB Output is correct
10 Correct 35 ms 31512 KB Output is correct
11 Correct 33 ms 31512 KB Output is correct
12 Correct 33 ms 31512 KB Output is correct
13 Correct 39 ms 31512 KB Output is correct
14 Correct 34 ms 31512 KB Output is correct
15 Correct 40 ms 31512 KB Output is correct
16 Correct 37 ms 31512 KB Output is correct
17 Correct 37 ms 31512 KB Output is correct
18 Correct 34 ms 31512 KB Output is correct
19 Correct 38 ms 31512 KB Output is correct
20 Correct 28 ms 31512 KB Output is correct
21 Correct 30 ms 31512 KB Output is correct
22 Correct 33 ms 31512 KB Output is correct
23 Correct 41 ms 31512 KB Output is correct
24 Correct 37 ms 31512 KB Output is correct
25 Correct 34 ms 31512 KB Output is correct
26 Correct 43 ms 31512 KB Output is correct
27 Correct 34 ms 31512 KB Output is correct
28 Correct 45 ms 31512 KB Output is correct
29 Correct 32 ms 31512 KB Output is correct
30 Correct 32 ms 31512 KB Output is correct
31 Correct 18 ms 31512 KB Output is correct
32 Correct 19 ms 31512 KB Output is correct
33 Correct 16 ms 31512 KB Output is correct
34 Correct 16 ms 31512 KB Output is correct
35 Correct 23 ms 31512 KB Output is correct
36 Correct 18 ms 31512 KB Output is correct
37 Correct 17 ms 31512 KB Output is correct
38 Correct 19 ms 31512 KB Output is correct
39 Correct 23 ms 31512 KB Output is correct
40 Correct 18 ms 31512 KB Output is correct
41 Correct 19 ms 31512 KB Output is correct
42 Correct 20 ms 31512 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 31512 KB Output is correct
2 Correct 17 ms 31512 KB Output is correct
3 Correct 18 ms 31512 KB Output is correct
4 Correct 20 ms 31512 KB Output is correct
5 Correct 17 ms 31512 KB Output is correct
6 Correct 19 ms 31512 KB Output is correct
7 Correct 20 ms 31512 KB Output is correct
8 Correct 21 ms 31512 KB Output is correct
9 Correct 34 ms 31548 KB Output is correct
10 Correct 41 ms 31584 KB Output is correct
11 Correct 37 ms 31584 KB Output is correct
12 Correct 18 ms 31584 KB Output is correct
13 Correct 20 ms 31584 KB Output is correct
14 Correct 18 ms 31584 KB Output is correct
15 Correct 18 ms 31584 KB Output is correct

Subtask #4
49.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 31584 KB Output is correct
2 Correct 47 ms 31584 KB Output is correct
3 Correct 62 ms 31584 KB Output is correct
4 Correct 39 ms 31584 KB Output is correct
5 Correct 39 ms 31584 KB Output is correct
6 Correct 37 ms 31584 KB Output is correct
7 Correct 35 ms 31584 KB Output is correct
8 Correct 34 ms 31584 KB Output is correct
9 Correct 34 ms 31584 KB Output is correct
10 Correct 33 ms 31584 KB Output is correct
11 Correct 44 ms 31584 KB Output is correct
12 Correct 41 ms 31584 KB Output is correct
13 Correct 34 ms 31584 KB Output is correct
14 Correct 37 ms 31584 KB Output is correct
15 Correct 42 ms 31584 KB Output is correct
16 Correct 35 ms 31584 KB Output is correct
17 Correct 37 ms 31584 KB Output is correct
18 Correct 44 ms 31584 KB Output is correct
19 Partially correct 39 ms 31584 KB Partially correct
20 Correct 32 ms 31584 KB Output is correct
21 Correct 32 ms 31584 KB Output is correct
22 Correct 45 ms 31584 KB Output is correct
23 Correct 43 ms 31584 KB Output is correct
24 Correct 37 ms 31584 KB Output is correct
25 Correct 46 ms 31584 KB Output is correct
26 Correct 36 ms 31584 KB Output is correct
27 Correct 54 ms 31584 KB Output is correct
28 Correct 45 ms 31584 KB Output is correct
29 Correct 38 ms 31584 KB Output is correct
30 Correct 36 ms 31584 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 31584 KB Output is correct
2 Correct 47 ms 31584 KB Output is correct
3 Correct 52 ms 31584 KB Output is correct
4 Incorrect 34 ms 31584 KB Output isn't correct
5 Halted 0 ms 0 KB -