oj.uz

Submission #130672

# Submission time Handle Problem Language Result Execution time Memory
130672 2019-07-15T19:45:35 Z tutis Amusement Park (JOI17_amusement_park) C++17
69 / 100
 99 ms 7856 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(), mt19937_64(15651));
	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(), mt19937_64(15651));
	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();
	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 + 1) % 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 5 ms 1400 KB Output is correct
2 Correct 5 ms 1456 KB Output is correct
3 Correct 6 ms 1416 KB Output is correct
4 Correct 4 ms 1460 KB Output is correct
5 Correct 4 ms 1396 KB Output is correct
6 Correct 4 ms 1488 KB Output is correct
7 Correct 5 ms 1404 KB Output is correct
8 Correct 5 ms 1440 KB Output is correct
9 Correct 5 ms 1460 KB Output is correct
10 Correct 4 ms 1456 KB Output is correct
11 Correct 9 ms 1728 KB Output is correct
12 Correct 4 ms 1500 KB Output is correct
13 Correct 6 ms 1404 KB Output is correct
14 Correct 6 ms 1576 KB Output is correct
15 Correct 5 ms 1412 KB Output is correct
16 Correct 6 ms 1424 KB Output is correct
17 Correct 5 ms 1412 KB Output is correct
18 Correct 6 ms 1412 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 7552 KB Output is correct
2 Correct 68 ms 7572 KB Output is correct
3 Correct 72 ms 7856 KB Output is correct
4 Correct 48 ms 6140 KB Output is correct
5 Correct 47 ms 6552 KB Output is correct
6 Correct 46 ms 6316 KB Output is correct
7 Correct 47 ms 6424 KB Output is correct
8 Correct 48 ms 6424 KB Output is correct
9 Correct 46 ms 6440 KB Output is correct
10 Correct 49 ms 6060 KB Output is correct
11 Correct 44 ms 6268 KB Output is correct
12 Correct 41 ms 5632 KB Output is correct
13 Correct 41 ms 5632 KB Output is correct
14 Correct 48 ms 5772 KB Output is correct
15 Correct 52 ms 5784 KB Output is correct
16 Correct 48 ms 6136 KB Output is correct
17 Correct 48 ms 6040 KB Output is correct
18 Correct 49 ms 6144 KB Output is correct
19 Correct 54 ms 5928 KB Output is correct
20 Correct 28 ms 6296 KB Output is correct
21 Correct 28 ms 6176 KB Output is correct
22 Correct 54 ms 6724 KB Output is correct
23 Correct 47 ms 6552 KB Output is correct
24 Correct 48 ms 6300 KB Output is correct
25 Correct 52 ms 6600 KB Output is correct
26 Correct 48 ms 6588 KB Output is correct
27 Correct 49 ms 6560 KB Output is correct
28 Correct 46 ms 6468 KB Output is correct
29 Correct 44 ms 6148 KB Output is correct
30 Correct 44 ms 6028 KB Output is correct
31 Correct 4 ms 1268 KB Output is correct
32 Correct 4 ms 1276 KB Output is correct
33 Correct 6 ms 1536 KB Output is correct
34 Correct 4 ms 1268 KB Output is correct
35 Correct 4 ms 1492 KB Output is correct
36 Correct 4 ms 1360 KB Output is correct
37 Correct 4 ms 1264 KB Output is correct
38 Correct 4 ms 1280 KB Output is correct
39 Correct 4 ms 1432 KB Output is correct
40 Correct 4 ms 1276 KB Output is correct
41 Correct 4 ms 1452 KB Output is correct
42 Correct 4 ms 1524 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1352 KB Output is correct
2 Correct 5 ms 1460 KB Output is correct
3 Correct 4 ms 1396 KB Output is correct
4 Correct 8 ms 2204 KB Output is correct
5 Correct 10 ms 2080 KB Output is correct
6 Correct 8 ms 2336 KB Output is correct
7 Correct 8 ms 2344 KB Output is correct
8 Correct 8 ms 2216 KB Output is correct
9 Correct 30 ms 6952 KB Output is correct
10 Correct 31 ms 7108 KB Output is correct
11 Correct 30 ms 6932 KB Output is correct
12 Correct 6 ms 1332 KB Output is correct
13 Correct 4 ms 1344 KB Output is correct
14 Correct 4 ms 1336 KB Output is correct
15 Correct 4 ms 1396 KB Output is correct

Subtask #4
41.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 7604 KB Output is correct
2 Correct 69 ms 7552 KB Output is correct
3 Correct 72 ms 7584 KB Output is correct
4 Correct 46 ms 5916 KB Output is correct
5 Partially correct 49 ms 6880 KB Partially correct
6 Partially correct 46 ms 6296 KB Partially correct
7 Correct 48 ms 6552 KB Output is correct
8 Correct 47 ms 6424 KB Output is correct
9 Correct 46 ms 6504 KB Output is correct
10 Correct 44 ms 6116 KB Output is correct
11 Correct 44 ms 6116 KB Output is correct
12 Correct 41 ms 5688 KB Output is correct
13 Correct 41 ms 5512 KB Output is correct
14 Correct 44 ms 5988 KB Output is correct
15 Correct 45 ms 6000 KB Output is correct
16 Correct 46 ms 6024 KB Output is correct
17 Correct 47 ms 6152 KB Output is correct
18 Correct 49 ms 6048 KB Output is correct
19 Correct 46 ms 6176 KB Output is correct
20 Correct 28 ms 6480 KB Output is correct
21 Partially correct 28 ms 6304 KB Partially correct
22 Correct 46 ms 6560 KB Output is correct
23 Correct 48 ms 6560 KB Output is correct
24 Correct 47 ms 6672 KB Output is correct
25 Correct 48 ms 6424 KB Output is correct
26 Partially correct 49 ms 6680 KB Partially correct
27 Correct 47 ms 6476 KB Output is correct
28 Correct 47 ms 6596 KB Output is correct
29 Correct 42 ms 5828 KB Output is correct
30 Partially correct 44 ms 6156 KB Partially correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 7640 KB Output is correct
2 Incorrect 99 ms 7548 KB Output isn't correct
3 Halted 0 ms 0 KB -