oj.uz

Submission #130685

# Submission time Handle Problem Language Result Execution time Memory
130685 2019-07-15T20:17:31 Z tutis Amusement Park (JOI17_amusement_park) C++17
72 / 100
 71 ms 7368 KB 
#include "Joi.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
mt19937_64 rng(123);
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(123);
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 1504 KB Output is correct
2 Correct 5 ms 1400 KB Output is correct
3 Correct 5 ms 1456 KB Output is correct
4 Correct 4 ms 1392 KB Output is correct
5 Correct 4 ms 1472 KB Output is correct
6 Correct 4 ms 1428 KB Output is correct
7 Correct 5 ms 1404 KB Output is correct
8 Correct 5 ms 1456 KB Output is correct
9 Correct 4 ms 1528 KB Output is correct
10 Correct 4 ms 1392 KB Output is correct
11 Correct 9 ms 1756 KB Output is correct
12 Correct 4 ms 1404 KB Output is correct
13 Correct 5 ms 1436 KB Output is correct
14 Correct 5 ms 1400 KB Output is correct
15 Correct 4 ms 1400 KB Output is correct
16 Correct 5 ms 1588 KB Output is correct
17 Correct 6 ms 1412 KB Output is correct
18 Correct 6 ms 1452 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 71 ms 7360 KB Output is correct
3 Correct 68 ms 7232 KB Output is correct
4 Correct 47 ms 5816 KB Output is correct
5 Correct 47 ms 6456 KB Output is correct
6 Correct 47 ms 6296 KB Output is correct
7 Correct 47 ms 6204 KB Output is correct
8 Correct 47 ms 6328 KB Output is correct
9 Correct 48 ms 6016 KB Output is correct
10 Correct 42 ms 5972 KB Output is correct
11 Correct 44 ms 5952 KB Output is correct
12 Correct 42 ms 5416 KB Output is correct
13 Correct 42 ms 5420 KB Output is correct
14 Correct 46 ms 5760 KB Output is correct
15 Correct 45 ms 5688 KB Output is correct
16 Correct 45 ms 5924 KB Output is correct
17 Correct 46 ms 5820 KB Output is correct
18 Correct 45 ms 5824 KB Output is correct
19 Correct 48 ms 5888 KB Output is correct
20 Correct 30 ms 6448 KB Output is correct
21 Correct 28 ms 6216 KB Output is correct
22 Correct 46 ms 6380 KB Output is correct
23 Correct 46 ms 6092 KB Output is correct
24 Correct 48 ms 6204 KB Output is correct
25 Correct 46 ms 6100 KB Output is correct
26 Correct 47 ms 6428 KB Output is correct
27 Correct 46 ms 6200 KB Output is correct
28 Correct 48 ms 6384 KB Output is correct
29 Correct 43 ms 5780 KB Output is correct
30 Correct 45 ms 6032 KB Output is correct
31 Correct 4 ms 1264 KB Output is correct
32 Correct 4 ms 1264 KB Output is correct
33 Correct 6 ms 1276 KB Output is correct
34 Correct 5 ms 1392 KB Output is correct
35 Correct 5 ms 1400 KB Output is correct
36 Correct 4 ms 1404 KB Output is correct
37 Correct 5 ms 1496 KB Output is correct
38 Correct 4 ms 1272 KB Output is correct
39 Correct 4 ms 1392 KB Output is correct
40 Correct 4 ms 1432 KB Output is correct
41 Correct 4 ms 1392 KB Output is correct
42 Correct 4 ms 1344 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 1536 KB Output is correct
3 Correct 4 ms 1264 KB Output is correct
4 Correct 8 ms 2136 KB Output is correct
5 Correct 8 ms 2192 KB Output is correct
6 Correct 8 ms 2288 KB Output is correct
7 Correct 8 ms 2296 KB Output is correct
8 Correct 8 ms 2324 KB Output is correct
9 Correct 28 ms 6564 KB Output is correct
10 Correct 30 ms 6608 KB Output is correct
11 Correct 31 ms 7128 KB Output is correct
12 Correct 4 ms 1340 KB Output is correct
13 Correct 4 ms 1476 KB Output is correct
14 Correct 4 ms 1496 KB Output is correct
15 Correct 4 ms 1392 KB Output is correct

Subtask #4
44.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 7360 KB Output is correct
2 Correct 68 ms 7368 KB Output is correct
3 Correct 67 ms 7368 KB Output is correct
4 Correct 45 ms 5824 KB Output is correct
5 Correct 48 ms 6912 KB Output is correct
6 Correct 46 ms 6444 KB Output is correct
7 Correct 48 ms 6400 KB Output is correct
8 Correct 50 ms 6212 KB Output is correct
9 Correct 64 ms 6164 KB Output is correct
10 Partially correct 45 ms 5824 KB Partially correct
11 Partially correct 49 ms 5956 KB Partially correct
12 Partially correct 44 ms 5276 KB Partially correct
13 Correct 45 ms 5432 KB Output is correct
14 Correct 47 ms 5608 KB Output is correct
15 Correct 49 ms 5816 KB Output is correct
16 Correct 47 ms 5688 KB Output is correct
17 Correct 46 ms 5952 KB Output is correct
18 Correct 48 ms 5744 KB Output is correct
19 Correct 55 ms 5912 KB Output is correct
20 Partially correct 31 ms 6332 KB Partially correct
21 Partially correct 32 ms 6468 KB Partially correct
22 Correct 52 ms 6380 KB Output is correct
23 Partially correct 49 ms 6488 KB Partially correct
24 Correct 47 ms 6328 KB Output is correct
25 Correct 47 ms 6208 KB Output is correct
26 Correct 47 ms 6416 KB Output is correct
27 Correct 47 ms 6496 KB Output is correct
28 Correct 49 ms 6336 KB Output is correct
29 Correct 42 ms 5672 KB Output is correct
30 Partially correct 45 ms 6200 KB Partially correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 7340 KB Output is correct
2 Correct 69 ms 7288 KB Output is correct
3 Incorrect 68 ms 7300 KB Output isn't correct
4 Halted 0 ms 0 KB -