oj.uz

Submission #41763

# Submission time Handle Problem Language Result Execution time Memory
41763 2018-02-21T07:47:24 Z RockyB Amusement Park (JOI17_amusement_park) C++14
8 / 100
 45 ms 28648 KB 
/// In The Name Of God

#include <bits/stdc++.h>
#include "Joi.h"

#define ioi exit(0);

using namespace std;

const int N1 = 1e4 + 7;

vector <int> g[N1];

bool was[N1];
int cnt;
void dfs(int v, long long x) {
	was[v] = 1;
	if (cnt <= 59) {
		int type = (x & (1LL << cnt)) > 0;
		MessageBoard(v, type);
	}
	else {
		MessageBoard(v, 0);
	}
	++cnt;
	for (auto to : g[v]) {
		if (!was[to]) dfs(to, 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]);
	}
	dfs(0, x);
}

/*int32_t main() {

	return 0;
}*/

/*#ifdef IOI2018
int main() {
	freopen ("in.txt", "r", stdin);
	
	ioi
}
#endif
*/
/// In The Name Of God

#include "Ioi.h"
#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

static const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

using namespace std;

vector <int> g[N];

ll res;

int last;
bool found;
bool was[N];
void dfs(int v) {
	was[v] = 1;
	if (found || !v) {
		found = 1;
		return;
	}
	for (auto to : g[v]) {
		if (!was[to] && !found) {
			last = Move(to);
			dfs(to);
			if (!found) last = Move(v);
		}
	}
}

int cnt;
void dfs1(int v) {
	was[v] = 1;
	if (cnt <= 59) {
		res += (1LL << cnt) * last;
	}
	cnt++;
	for (auto to : g[v]) {
		if (!was[to]) {
			last = Move(to);
			dfs1(to);
			Move(v);
		}
	}
}
ll 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]].pb(b[i]);
		g[b[i]].pb(a[i]);
	}
	last = v;
	dfs(p);
	memset(was, 0, sizeof(was));
	dfs1(0);
	return res;
}	

/*#ifdef IOI2018
int main() {
	freopen ("in.txt", "r", stdin);
	
	ioi
}
#endif*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 13148 KB Output is correct
2 Correct 13 ms 25416 KB Output is correct
3 Correct 12 ms 25560 KB Output is correct
4 Correct 13 ms 25576 KB Output is correct
5 Correct 13 ms 25576 KB Output is correct
6 Correct 14 ms 25700 KB Output is correct
7 Correct 14 ms 25824 KB Output is correct
8 Correct 13 ms 25824 KB Output is correct
9 Correct 15 ms 25824 KB Output is correct
10 Correct 13 ms 25824 KB Output is correct
11 Correct 17 ms 25920 KB Output is correct
12 Correct 13 ms 26016 KB Output is correct
13 Correct 13 ms 26016 KB Output is correct
14 Correct 13 ms 26016 KB Output is correct
15 Correct 13 ms 26016 KB Output is correct
16 Correct 13 ms 26016 KB Output is correct
17 Correct 13 ms 26016 KB Output is correct
18 Correct 13 ms 26016 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 27332 KB Wrong Answer [8]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 28648 KB Output is correct
2 Correct 14 ms 28648 KB Output is correct
3 Incorrect 13 ms 28648 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 28648 KB Wrong Answer [8]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 28648 KB Wrong Answer [8]
2 Halted 0 ms 0 KB -