oj.uz

Submission #130661

# Submission time Handle Problem Language Result Execution time Memory
130661 2019-07-15T19:19:16 Z tutis Amusement Park (JOI17_amusement_park) C++17
61 / 100
 56 ms 5276 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;
void dfs(int v)
{
	if (aplankyta.count(v))
		return;
	aplankyta.insert(v);
	t++;
	t %= 60;
	bitas[v] = t;
	for (int x : adj[v])
	{
		dfs(x);
	}
}
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(0);
	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;
void dfs(int v)
{
	if (aplankyta.count(v))
		return;
	t++;
	t %= 60;
	bitas[v] = t;
	aplankyta.insert(v);
	for (int x : adj[v])
	{
		dfs(x);
	}
}
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(0);
	ll X = 0;
	vector<int>stak = {P};
	set<int>bitai;
	set<int>aplankyti;
	while (true)
	{
		X |= V * (1ll << bitas[P]);
		bitai.insert(bitas[P]);
		aplankyti.insert(P);
		if (bitai.size() == 60)
			break;
		int v1 = -1;
		for (int j : adj[P])
			if (aplankyti.count(j) == false)
				v1 = j;
		if (v1 == -1)
		{
			stak.pop_back();
			v1 = stak.back();
		}
		else
		{
			stak.push_back(v1);
		}
		V = Move(v1);
		P = v1;
	}
	return X;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1400 KB Output is correct
2 Correct 4 ms 1352 KB Output is correct
3 Correct 5 ms 1412 KB Output is correct
4 Correct 5 ms 1348 KB Output is correct
5 Correct 6 ms 1348 KB Output is correct
6 Correct 4 ms 1500 KB Output is correct
7 Correct 5 ms 1404 KB Output is correct
8 Correct 6 ms 1440 KB Output is correct
9 Correct 6 ms 1412 KB Output is correct
10 Correct 4 ms 1468 KB Output is correct
11 Correct 10 ms 1728 KB Output is correct
12 Correct 4 ms 1396 KB Output is correct
13 Correct 6 ms 1412 KB Output is correct
14 Correct 6 ms 1456 KB Output is correct
15 Correct 6 ms 1404 KB Output is correct
16 Correct 6 ms 1412 KB Output is correct
17 Correct 5 ms 1404 KB Output is correct
18 Correct 4 ms 1412 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 5192 KB Output is correct
2 Correct 51 ms 5192 KB Output is correct
3 Correct 51 ms 5192 KB Output is correct
4 Correct 31 ms 3904 KB Output is correct
5 Correct 34 ms 4328 KB Output is correct
6 Correct 33 ms 4164 KB Output is correct
7 Correct 31 ms 4356 KB Output is correct
8 Correct 31 ms 4156 KB Output is correct
9 Correct 31 ms 4340 KB Output is correct
10 Correct 40 ms 3896 KB Output is correct
11 Correct 42 ms 3972 KB Output is correct
12 Correct 31 ms 3632 KB Output is correct
13 Correct 27 ms 3604 KB Output is correct
14 Correct 34 ms 3760 KB Output is correct
15 Correct 31 ms 3904 KB Output is correct
16 Correct 35 ms 4016 KB Output is correct
17 Correct 33 ms 4020 KB Output is correct
18 Correct 32 ms 3904 KB Output is correct
19 Correct 34 ms 4024 KB Output is correct
20 Correct 24 ms 4288 KB Output is correct
21 Correct 24 ms 4280 KB Output is correct
22 Correct 32 ms 4028 KB Output is correct
23 Correct 34 ms 4152 KB Output is correct
24 Correct 32 ms 4268 KB Output is correct
25 Correct 31 ms 4152 KB Output is correct
26 Correct 31 ms 4212 KB Output is correct
27 Correct 31 ms 4280 KB Output is correct
28 Correct 32 ms 4332 KB Output is correct
29 Correct 28 ms 3884 KB Output is correct
30 Correct 30 ms 4016 KB Output is correct
31 Correct 4 ms 1368 KB Output is correct
32 Correct 5 ms 1396 KB Output is correct
33 Correct 5 ms 1408 KB Output is correct
34 Correct 6 ms 1396 KB Output is correct
35 Correct 6 ms 1268 KB Output is correct
36 Correct 6 ms 1348 KB Output is correct
37 Correct 6 ms 1432 KB Output is correct
38 Correct 4 ms 1404 KB Output is correct
39 Correct 6 ms 1476 KB Output is correct
40 Correct 5 ms 1404 KB Output is correct
41 Correct 6 ms 1396 KB Output is correct
42 Correct 6 ms 1404 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1400 KB Output is correct
2 Correct 6 ms 1340 KB Output is correct
3 Correct 4 ms 1396 KB Output is correct
4 Correct 9 ms 1832 KB Output is correct
5 Correct 8 ms 1888 KB Output is correct
6 Correct 7 ms 1952 KB Output is correct
7 Correct 9 ms 1960 KB Output is correct
8 Correct 8 ms 1956 KB Output is correct
9 Correct 23 ms 5012 KB Output is correct
10 Correct 25 ms 4972 KB Output is correct
11 Correct 26 ms 4904 KB Output is correct
12 Correct 5 ms 1268 KB Output is correct
13 Correct 6 ms 1404 KB Output is correct
14 Correct 4 ms 1508 KB Output is correct
15 Correct 4 ms 1408 KB Output is correct

Subtask #4
33.0 / 55.0

# Verdict Execution time Memory Grader output
1 Partially correct 52 ms 5276 KB Partially correct
2 Partially correct 52 ms 5012 KB Partially correct
3 Partially correct 53 ms 5168 KB Partially correct
4 Partially correct 30 ms 3640 KB Partially correct
5 Partially correct 33 ms 4544 KB Partially correct
6 Partially correct 32 ms 4160 KB Partially correct
7 Partially correct 31 ms 4228 KB Partially correct
8 Partially correct 31 ms 4032 KB Partially correct
9 Partially correct 34 ms 4336 KB Partially correct
10 Correct 41 ms 3896 KB Output is correct
11 Correct 41 ms 4008 KB Output is correct
12 Partially correct 27 ms 3720 KB Partially correct
13 Partially correct 28 ms 3720 KB Partially correct
14 Partially correct 28 ms 3980 KB Partially correct
15 Partially correct 30 ms 3864 KB Partially correct
16 Partially correct 30 ms 4044 KB Partially correct
17 Correct 30 ms 3992 KB Output is correct
18 Partially correct 31 ms 3864 KB Partially correct
19 Partially correct 30 ms 3992 KB Partially correct
20 Partially correct 23 ms 4592 KB Partially correct
21 Partially correct 23 ms 4584 KB Partially correct
22 Partially correct 34 ms 4484 KB Partially correct
23 Partially correct 32 ms 4648 KB Partially correct
24 Partially correct 33 ms 4408 KB Partially correct
25 Partially correct 25 ms 4220 KB Partially correct
26 Partially correct 31 ms 4248 KB Partially correct
27 Partially correct 31 ms 4400 KB Partially correct
28 Partially correct 31 ms 4280 KB Partially correct
29 Partially correct 28 ms 4216 KB Partially correct
30 Partially correct 28 ms 4244 KB Partially correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 56 ms 4928 KB Output isn't correct
2 Halted 0 ms 0 KB -