oj.uz

Submission #130684

# Submission time Handle Problem Language Result Execution time Memory
130684 2019-07-15T20:13:39 Z tutis Amusement Park (JOI17_amusement_park) C++17
70 / 100
 74 ms 7364 KB 
#include "Joi.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
mt19937_64 rng(111);
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(111);
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;
	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 1264 KB Output is correct
2 Correct 2 ms 1460 KB Output is correct
3 Correct 5 ms 1560 KB Output is correct
4 Correct 4 ms 1472 KB Output is correct
5 Correct 4 ms 1272 KB Output is correct
6 Correct 4 ms 1264 KB Output is correct
7 Correct 6 ms 1580 KB Output is correct
8 Correct 5 ms 1412 KB Output is correct
9 Correct 5 ms 1400 KB Output is correct
10 Correct 4 ms 1400 KB Output is correct
11 Correct 9 ms 1764 KB Output is correct
12 Correct 4 ms 1392 KB Output is correct
13 Correct 6 ms 1420 KB Output is correct
14 Correct 6 ms 1428 KB Output is correct
15 Correct 4 ms 1400 KB Output is correct
16 Correct 6 ms 1408 KB Output is correct
17 Correct 6 ms 1428 KB Output is correct
18 Correct 5 ms 1408 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 7232 KB Output is correct
2 Correct 68 ms 7364 KB Output is correct
3 Correct 70 ms 7348 KB Output is correct
4 Correct 48 ms 5892 KB Output is correct
5 Correct 48 ms 6844 KB Output is correct
6 Correct 48 ms 6336 KB Output is correct
7 Correct 48 ms 6416 KB Output is correct
8 Correct 49 ms 6604 KB Output is correct
9 Correct 47 ms 6080 KB Output is correct
10 Correct 44 ms 5984 KB Output is correct
11 Correct 44 ms 5956 KB Output is correct
12 Correct 41 ms 5640 KB Output is correct
13 Correct 42 ms 5304 KB Output is correct
14 Correct 44 ms 5820 KB Output is correct
15 Correct 45 ms 5892 KB Output is correct
16 Correct 46 ms 5856 KB Output is correct
17 Correct 52 ms 5944 KB Output is correct
18 Correct 48 ms 5824 KB Output is correct
19 Correct 60 ms 6048 KB Output is correct
20 Correct 30 ms 6544 KB Output is correct
21 Correct 35 ms 6200 KB Output is correct
22 Correct 54 ms 6300 KB Output is correct
23 Correct 49 ms 6316 KB Output is correct
24 Correct 52 ms 6404 KB Output is correct
25 Correct 46 ms 6080 KB Output is correct
26 Correct 47 ms 6344 KB Output is correct
27 Correct 53 ms 6456 KB Output is correct
28 Correct 48 ms 6324 KB Output is correct
29 Correct 43 ms 5808 KB Output is correct
30 Correct 45 ms 5972 KB Output is correct
31 Correct 5 ms 1448 KB Output is correct
32 Correct 5 ms 1392 KB Output is correct
33 Correct 6 ms 1536 KB Output is correct
34 Correct 6 ms 1404 KB Output is correct
35 Correct 5 ms 1484 KB Output is correct
36 Correct 4 ms 1264 KB Output is correct
37 Correct 4 ms 1264 KB Output is correct
38 Correct 4 ms 1392 KB Output is correct
39 Correct 4 ms 1400 KB Output is correct
40 Correct 4 ms 1400 KB Output is correct
41 Correct 5 ms 1400 KB Output is correct
42 Correct 4 ms 1272 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1392 KB Output is correct
2 Correct 4 ms 1400 KB Output is correct
3 Correct 11 ms 1400 KB Output is correct
4 Correct 8 ms 2168 KB Output is correct
5 Correct 9 ms 2192 KB Output is correct
6 Correct 8 ms 2192 KB Output is correct
7 Correct 9 ms 2136 KB Output is correct
8 Correct 8 ms 2296 KB Output is correct
9 Correct 28 ms 6592 KB Output is correct
10 Correct 30 ms 6732 KB Output is correct
11 Correct 28 ms 6592 KB Output is correct
12 Correct 4 ms 1400 KB Output is correct
13 Correct 4 ms 1508 KB Output is correct
14 Correct 4 ms 1428 KB Output is correct
15 Correct 4 ms 1500 KB Output is correct

Subtask #4
42.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 7288 KB Output is correct
2 Correct 68 ms 7360 KB Output is correct
3 Partially correct 68 ms 7232 KB Partially correct
4 Correct 45 ms 5920 KB Output is correct
5 Partially correct 48 ms 6308 KB Partially correct
6 Correct 46 ms 6348 KB Output is correct
7 Correct 47 ms 6340 KB Output is correct
8 Correct 47 ms 6144 KB Output is correct
9 Correct 46 ms 6464 KB Output is correct
10 Correct 44 ms 6024 KB Output is correct
11 Correct 45 ms 6008 KB Output is correct
12 Correct 41 ms 5416 KB Output is correct
13 Correct 41 ms 5472 KB Output is correct
14 Correct 44 ms 5860 KB Output is correct
15 Correct 45 ms 5816 KB Output is correct
16 Correct 45 ms 5688 KB Output is correct
17 Correct 45 ms 5824 KB Output is correct
18 Correct 45 ms 5824 KB Output is correct
19 Correct 46 ms 5860 KB Output is correct
20 Partially correct 30 ms 6388 KB Partially correct
21 Correct 30 ms 6128 KB Output is correct
22 Correct 47 ms 6336 KB Output is correct
23 Correct 50 ms 6328 KB Output is correct
24 Correct 51 ms 6248 KB Output is correct
25 Correct 47 ms 6096 KB Output is correct
26 Correct 51 ms 6200 KB Output is correct
27 Partially correct 48 ms 6080 KB Partially correct
28 Partially correct 48 ms 6260 KB Partially correct
29 Partially correct 44 ms 5780 KB Partially correct
30 Partially correct 46 ms 6056 KB Partially correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 7280 KB Output is correct
2 Incorrect 71 ms 7240 KB Output isn't correct
3 Halted 0 ms 0 KB -