oj.uz

Submission #514069

# Submission time Handle Problem Language Result Execution time Memory
514069 2022-01-18T03:02:34 Z amunduzbaev Amusement Park (JOI17_amusement_park) C++14
0 / 100
 28 ms 4632 KB 
#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] = (d[i] - 1) % 60;
			MessageBoard(i, x >> d[i] & 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);
		}
	}
}

#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;
	}
	
	long long x = 0;
	if(ok){
		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] = (d[p] - 1) % 60;
				x |= ((v * 1ll) << d[p]);
				v = Move(tt.back()), p = tt.back(); tt.pop_back();
			} return x;
		}
	}
	
	while(p) v = Move(par[p]), p = par[p];
	assert(!p);
	//~ assert(0);
	memset(used, 0, sizeof used);
	int cnt = 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.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 1136 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4572 KB Output is correct
2 Correct 22 ms 4468 KB Output is correct
3 Correct 22 ms 4632 KB Output is correct
4 Incorrect 14 ms 2988 KB Wrong Answer [7]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1000 KB Output is correct
2 Correct 2 ms 1000 KB Output is correct
3 Correct 0 ms 1000 KB Output is correct
4 Correct 2 ms 1552 KB Output is correct
5 Correct 2 ms 1552 KB Output is correct
6 Correct 2 ms 1612 KB Output is correct
7 Correct 2 ms 1540 KB Output is correct
8 Correct 2 ms 1552 KB Output is correct
9 Correct 10 ms 4400 KB Output is correct
10 Correct 11 ms 4432 KB Output is correct
11 Correct 11 ms 4452 KB Output is correct
12 Correct 1 ms 1008 KB Output is correct
13 Correct 1 ms 1008 KB Output is correct
14 Incorrect 0 ms 1000 KB Wrong Answer [7]
15 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 4544 KB Output is correct
2 Correct 23 ms 4540 KB Output is correct
3 Correct 23 ms 4520 KB Output is correct
4 Incorrect 12 ms 2944 KB Wrong Answer [7]
5 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4544 KB Output is correct
2 Correct 25 ms 4536 KB Output is correct
3 Correct 28 ms 4496 KB Output is correct
4 Incorrect 14 ms 3080 KB Output isn't correct
5 Halted 0 ms 0 KB -