oj.uz

Submission #130679

# Submission time Handle Problem Language Result Execution time Memory
130679 2019-07-15T19:54:21 Z tutis Amusement Park (JOI17_amusement_park) C++17
73 / 100
 79 ms 7840 KB 
#include "Joi.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
mt19937_64 rng(1561561);
int bitas[11000];
vector<int>adj[11000];
set<int>aplankyta;
int t = 0;
set<pair<int, int>>EE;
void dfs(int v, int p = -2)
{
	if (aplankyta.count(v))
		return;
	EE.insert({v, p});
	EE.insert({p, v});
	aplankyta.insert(v);
	t++;
	t %= 60;
	bitas[v] = t;
	for (int x : adj[v])
	{
		dfs(x, v);
	}
}
void Joi(int N, int M, int A[], int B[], long long X, int T) {
	vector<int>PP(N);
	iota(PP.begin(), PP.end(), 0);
	shuffle(PP.begin(), PP.end(), rng);
	for (int i = 0; i < M; i++)
	{
		adj[A[i]].push_back(B[i]);
		adj[B[i]].push_back(A[i]);
	}
	for (int i = 0; i < N; i++)
		shuffle(adj[i].begin(), adj[i].end(), rng);
	dfs(rng() % N);
	for (int i = 0; i < N; i++)
	{
		int s = 0;
		if ((X & (1ll << bitas[i])) > 0)
			s = 1;
		MessageBoard(i, s);
	}
}
#include "Ioi.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
mt19937_64 rng(1561561);
int bitas[11000];
vector<int>adj[11000];
set<int>aplankyta;
int t = 0;
set<pair<int, int>>EE;
vector<int>order;
void dfs(int v, int p = -2)
{
	if (aplankyta.count(v))
		return;
	order.push_back(v);
	EE.insert({v, p});
	EE.insert({p, v});
	aplankyta.insert(v);
	t++;
	t %= 60;
	bitas[v] = t;
	bool ok = false;
	for (int x : adj[v])
	{
		if (aplankyta.count(x))
			continue;
		dfs(x, v);
		order.push_back(v);
		ok = true;
	}
	if (ok == false)
		order.push_back(v);
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T)
{
	vector<int>PP(N);
	iota(PP.begin(), PP.end(), 0);
	shuffle(PP.begin(), PP.end(), rng);
	for (int i = 0; i < M; i++)
	{
		adj[A[i]].push_back(B[i]);
		adj[B[i]].push_back(A[i]);
	}
	for (int i = 0; i < N; i++)
		shuffle(adj[i].begin(), adj[i].end(), rng);
	dfs(rng() % N);
	ll X = 0;
	vector<int>stak = {P};
	set<int>bitai;
	set<int>aplankyti;
	int ii = find(order.begin(), order.end(), P) - order.begin();
	int c = -1;
	if (rng() % 2 == 0)
		c = 1;
	while (true)
	{
		X |= V * (1ll << bitas[P]);
		bitai.insert(bitas[P]);
		aplankyti.insert(P);
		if (bitai.size() == 60)
			break;
		while (order[ii] == P)
		{
			ii = (ii + c + order.size()) % order.size();
		}
		int v1 = order[ii];
		V = Move(v1);
		P = v1;
	}
	return X;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1404 KB Output is correct
2 Correct 4 ms 1268 KB Output is correct
3 Correct 5 ms 1412 KB Output is correct
4 Correct 4 ms 1464 KB Output is correct
5 Correct 4 ms 1404 KB Output is correct
6 Correct 5 ms 1404 KB Output is correct
7 Correct 5 ms 1412 KB Output is correct
8 Correct 6 ms 1404 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 4 ms 1484 KB Output is correct
11 Correct 10 ms 1868 KB Output is correct
12 Correct 4 ms 1404 KB Output is correct
13 Correct 5 ms 1404 KB Output is correct
14 Correct 5 ms 1412 KB Output is correct
15 Correct 6 ms 1532 KB Output is correct
16 Correct 5 ms 1452 KB Output is correct
17 Correct 6 ms 1572 KB Output is correct
18 Correct 6 ms 1432 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 7552 KB Output is correct
2 Correct 70 ms 7708 KB Output is correct
3 Correct 69 ms 7740 KB Output is correct
4 Correct 46 ms 6144 KB Output is correct
5 Correct 48 ms 6808 KB Output is correct
6 Correct 47 ms 6448 KB Output is correct
7 Correct 47 ms 6280 KB Output is correct
8 Correct 79 ms 6468 KB Output is correct
9 Correct 50 ms 6456 KB Output is correct
10 Correct 49 ms 6180 KB Output is correct
11 Correct 49 ms 6060 KB Output is correct
12 Correct 52 ms 5632 KB Output is correct
13 Correct 46 ms 5640 KB Output is correct
14 Correct 47 ms 5900 KB Output is correct
15 Correct 45 ms 6048 KB Output is correct
16 Correct 45 ms 6148 KB Output is correct
17 Correct 46 ms 6144 KB Output is correct
18 Correct 48 ms 6048 KB Output is correct
19 Correct 47 ms 5912 KB Output is correct
20 Correct 30 ms 6424 KB Output is correct
21 Correct 30 ms 6572 KB Output is correct
22 Correct 47 ms 6440 KB Output is correct
23 Correct 47 ms 6424 KB Output is correct
24 Correct 55 ms 6304 KB Output is correct
25 Correct 49 ms 6808 KB Output is correct
26 Correct 51 ms 6428 KB Output is correct
27 Correct 47 ms 6444 KB Output is correct
28 Correct 47 ms 6632 KB Output is correct
29 Correct 43 ms 6024 KB Output is correct
30 Correct 45 ms 6156 KB Output is correct
31 Correct 4 ms 1276 KB Output is correct
32 Correct 4 ms 1452 KB Output is correct
33 Correct 5 ms 1428 KB Output is correct
34 Correct 4 ms 1404 KB Output is correct
35 Correct 4 ms 1548 KB Output is correct
36 Correct 4 ms 1396 KB Output is correct
37 Correct 4 ms 1396 KB Output is correct
38 Correct 4 ms 1404 KB Output is correct
39 Correct 5 ms 1432 KB Output is correct
40 Correct 4 ms 1340 KB Output is correct
41 Correct 5 ms 1404 KB Output is correct
42 Correct 4 ms 1472 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1432 KB Output is correct
2 Correct 5 ms 1276 KB Output is correct
3 Correct 5 ms 1496 KB Output is correct
4 Correct 10 ms 2080 KB Output is correct
5 Correct 9 ms 2224 KB Output is correct
6 Correct 8 ms 2216 KB Output is correct
7 Correct 8 ms 2260 KB Output is correct
8 Correct 9 ms 2208 KB Output is correct
9 Correct 32 ms 6844 KB Output is correct
10 Correct 28 ms 6596 KB Output is correct
11 Correct 28 ms 6776 KB Output is correct
12 Correct 4 ms 1268 KB Output is correct
13 Correct 4 ms 1496 KB Output is correct
14 Correct 6 ms 1268 KB Output is correct
15 Correct 6 ms 1404 KB Output is correct

Subtask #4
45.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 7684 KB Output is correct
2 Correct 70 ms 7588 KB Output is correct
3 Correct 74 ms 7840 KB Output is correct
4 Correct 46 ms 5912 KB Output is correct
5 Correct 46 ms 6744 KB Output is correct
6 Correct 47 ms 6452 KB Output is correct
7 Correct 46 ms 6316 KB Output is correct
8 Correct 46 ms 6548 KB Output is correct
9 Correct 48 ms 6320 KB Output is correct
10 Correct 47 ms 6052 KB Output is correct
11 Correct 44 ms 6172 KB Output is correct
12 Correct 41 ms 5512 KB Output is correct
13 Correct 41 ms 5560 KB Output is correct
14 Correct 43 ms 5880 KB Output is correct
15 Partially correct 46 ms 6152 KB Partially correct
16 Correct 44 ms 5912 KB Output is correct
17 Correct 46 ms 5912 KB Output is correct
18 Correct 46 ms 5944 KB Output is correct
19 Correct 48 ms 6140 KB Output is correct
20 Correct 30 ms 6320 KB Output is correct
21 Partially correct 31 ms 6572 KB Partially correct
22 Correct 47 ms 6436 KB Output is correct
23 Correct 48 ms 6296 KB Output is correct
24 Correct 48 ms 6336 KB Output is correct
25 Correct 50 ms 6432 KB Output is correct
26 Correct 49 ms 6320 KB Output is correct
27 Correct 51 ms 6620 KB Output is correct
28 Correct 56 ms 6424 KB Output is correct
29 Partially correct 43 ms 6020 KB Partially correct
30 Correct 47 ms 6196 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 7620 KB Output is correct
2 Correct 68 ms 7680 KB Output is correct
3 Correct 69 ms 7684 KB Output is correct
4 Correct 45 ms 6136 KB Output is correct
5 Incorrect 47 ms 6960 KB Output isn't correct
6 Halted 0 ms 0 KB -