oj.uz

Submission #298149

# Submission time Handle Problem Language Result Execution time Memory
298149 2020-09-12T12:45:37 Z pit4h Amusement Park (JOI17_amusement_park) C++14
70 / 100
 41 ms 4528 KB 
#include "Joi.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int _N = 1e4+1, _B = 60;
vector<int> g[_N];
bool vis[_N];
int dep[_N], par[_N];
vector<int> roots;
ll X;
void dfs(int x) {
	vis[x] = 1;
	if(dep[x]%_B==0) {
		roots.push_back(x);
	}
	for(int i: g[x]) {
		if(!vis[i]) {
			par[i] = x;
			dep[i] = dep[x]+1;
			dfs(i);
		}
	}
}
void set_board(int x, int &bit) {
	vis[x] = 1;	
	if((X&(1LL<<bit))>0) {
		MessageBoard(x, 1);
	}
	else {
		MessageBoard(x, 0);
	}
	if(bit>=_B-1) return;
	for(int i: g[x]) {
		if(!vis[i] && par[i] == x) {
			bit++;
			if(dep[i]%_B!=0 && bit<_B) set_board(i, bit);
		}
	}
}
void Joi(int N, int M, int A[], int B[], ll _X, int T) {
	// MessageBoard();
	X = _X;
	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());
	}
	dfs(0);
	for(int i=0; i<N; ++i) vis[i] = 0;
	for(int i: roots) {
		int bit = 0;
		set_board(i, bit);
	}
	for(int i=0; i<N; ++i) {
		if(!vis[i]) {
			MessageBoard(i, 1);
		}
	}
}
#include "Ioi.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int __N = 1e4+1;
const int bits = 60;
void _dfs(int x, vector<int>& vis, vector<vector<int>>& g, vector<int>& par, vector<int>& dep) {
	vis[x] = 1;
	for(int i: g[x]) {
		if(!vis[i]) {
			par[i] = x;
			dep[i] = dep[x]+1;
			_dfs(i, vis, g, par, dep);
		}
	}
}
void get_X(int x, int v, int& bit, ll& X, vector<int>& vis, vector<vector<int>>& g, vector<int>& par) { 
	vis[x] = 1;
	X += (ll)v * (1LL<<bit);
	if(bit==bits-1) return;
	for(int i: g[x]) {
		if(!vis[i] && par[i]==x) {
			bit++;
			if(bit < bits) get_X(i, Move(i), bit, X, vis, g, par);
		}
	}
	if(par[x] != x && bit < bits-1) {
		Move(par[x]);
	}
}	
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
	vector<vector<int>> g(N);
	vector<int> vis(N), par(N), dep(N);
	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());
	}
	_dfs(0, vis, g, par, dep);
	while(dep[P]%bits != 0) {
		P = par[P];
		V = Move(P);
	}
	for(int i=0; i<N; ++i) {
		vis[i] = 0;
	}
	int bit = 0;
	ll X = 0;
	get_X(P, V, bit, X, vis, g, par);
	return X;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1288 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Correct 2 ms 1280 KB Output is correct
4 Correct 2 ms 1036 KB Output is correct
5 Correct 2 ms 1280 KB Output is correct
6 Correct 2 ms 1280 KB Output is correct
7 Correct 2 ms 1280 KB Output is correct
8 Correct 2 ms 1280 KB Output is correct
9 Correct 2 ms 1280 KB Output is correct
10 Correct 2 ms 1024 KB Output is correct
11 Correct 7 ms 1548 KB Output is correct
12 Correct 2 ms 1032 KB Output is correct
13 Correct 2 ms 1280 KB Output is correct
14 Correct 2 ms 1280 KB Output is correct
15 Correct 2 ms 1280 KB Output is correct
16 Correct 2 ms 1280 KB Output is correct
17 Correct 2 ms 1280 KB Output is correct
18 Correct 2 ms 1280 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 4528 KB Output is correct
2 Correct 41 ms 4524 KB Output is correct
3 Correct 32 ms 4520 KB Output is correct
4 Correct 19 ms 3136 KB Output is correct
5 Correct 19 ms 3432 KB Output is correct
6 Correct 19 ms 3376 KB Output is correct
7 Correct 19 ms 3276 KB Output is correct
8 Correct 19 ms 3404 KB Output is correct
9 Correct 19 ms 3276 KB Output is correct
10 Correct 18 ms 2892 KB Output is correct
11 Correct 19 ms 2892 KB Output is correct
12 Correct 19 ms 2800 KB Output is correct
13 Correct 19 ms 2800 KB Output is correct
14 Correct 17 ms 2756 KB Output is correct
15 Correct 19 ms 3016 KB Output is correct
16 Correct 19 ms 3132 KB Output is correct
17 Correct 19 ms 3020 KB Output is correct
18 Correct 19 ms 2936 KB Output is correct
19 Correct 22 ms 3136 KB Output is correct
20 Correct 15 ms 3404 KB Output is correct
21 Correct 15 ms 3424 KB Output is correct
22 Correct 20 ms 3408 KB Output is correct
23 Correct 19 ms 3404 KB Output is correct
24 Correct 20 ms 3276 KB Output is correct
25 Correct 20 ms 3404 KB Output is correct
26 Correct 19 ms 3460 KB Output is correct
27 Correct 18 ms 3276 KB Output is correct
28 Correct 19 ms 3456 KB Output is correct
29 Correct 17 ms 3148 KB Output is correct
30 Correct 17 ms 3408 KB Output is correct
31 Correct 2 ms 1280 KB Output is correct
32 Correct 2 ms 1036 KB Output is correct
33 Correct 3 ms 1280 KB Output is correct
34 Correct 2 ms 1288 KB Output is correct
35 Correct 2 ms 1288 KB Output is correct
36 Correct 2 ms 1280 KB Output is correct
37 Correct 2 ms 1280 KB Output is correct
38 Correct 2 ms 1028 KB Output is correct
39 Correct 2 ms 1088 KB Output is correct
40 Correct 2 ms 1280 KB Output is correct
41 Correct 2 ms 1280 KB Output is correct
42 Correct 2 ms 1024 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1036 KB Output is correct
2 Correct 2 ms 1156 KB Output is correct
3 Incorrect 2 ms 1284 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #4
52.0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 34 ms 4512 KB Partially correct
2 Correct 31 ms 4324 KB Output is correct
3 Correct 32 ms 4528 KB Output is correct
4 Correct 17 ms 3124 KB Output is correct
5 Correct 19 ms 3832 KB Output is correct
6 Partially correct 19 ms 3452 KB Partially correct
7 Correct 19 ms 3476 KB Output is correct
8 Correct 20 ms 3020 KB Output is correct
9 Correct 20 ms 3384 KB Output is correct
10 Correct 19 ms 3100 KB Output is correct
11 Correct 18 ms 2892 KB Output is correct
12 Correct 19 ms 2796 KB Output is correct
13 Partially correct 17 ms 2804 KB Partially correct
14 Partially correct 19 ms 2772 KB Partially correct
15 Correct 18 ms 2892 KB Output is correct
16 Correct 20 ms 2996 KB Output is correct
17 Correct 20 ms 2892 KB Output is correct
18 Partially correct 20 ms 3148 KB Partially correct
19 Partially correct 18 ms 3132 KB Partially correct
20 Partially correct 15 ms 3556 KB Partially correct
21 Correct 17 ms 3424 KB Output is correct
22 Correct 20 ms 3276 KB Output is correct
23 Correct 22 ms 3372 KB Output is correct
24 Partially correct 19 ms 3380 KB Partially correct
25 Partially correct 20 ms 3472 KB Partially correct
26 Correct 20 ms 3468 KB Output is correct
27 Correct 23 ms 3432 KB Output is correct
28 Correct 20 ms 3180 KB Output is correct
29 Correct 19 ms 3164 KB Output is correct
30 Partially correct 18 ms 3380 KB Partially correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 4324 KB Output is correct
2 Incorrect 31 ms 4524 KB Output isn't correct
3 Halted 0 ms 0 KB -