oj.uz

답안 #130683

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
130683 2019-07-15T20:11:34 Z tutis Amusement Park (JOI17_amusement_park) C++17
70 / 100
 79 ms 7384 KB 
#include "Joi.h"
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
mt19937_64 rng(1891894948594);
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(1891894948594);
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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1272 KB Output is correct
2 Correct 4 ms 1396 KB Output is correct
3 Correct 6 ms 1540 KB Output is correct
4 Correct 5 ms 1520 KB Output is correct
5 Correct 4 ms 1276 KB Output is correct
6 Correct 4 ms 1396 KB Output is correct
7 Correct 5 ms 1404 KB Output is correct
8 Correct 5 ms 1428 KB Output is correct
9 Correct 5 ms 1440 KB Output is correct
10 Correct 4 ms 1460 KB Output is correct
11 Correct 9 ms 1864 KB Output is correct
12 Correct 4 ms 1480 KB Output is correct
13 Correct 6 ms 1428 KB Output is correct
14 Correct 6 ms 1420 KB Output is correct
15 Correct 6 ms 1424 KB Output is correct
16 Correct 6 ms 1428 KB Output is correct
17 Correct 6 ms 1412 KB Output is correct
18 Correct 5 ms 1404 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 7316 KB Output is correct
2 Correct 70 ms 7384 KB Output is correct
3 Correct 78 ms 7104 KB Output is correct
4 Correct 51 ms 6012 KB Output is correct
5 Correct 54 ms 6712 KB Output is correct
6 Correct 54 ms 6200 KB Output is correct
7 Correct 55 ms 6144 KB Output is correct
8 Correct 51 ms 6556 KB Output is correct
9 Correct 59 ms 6432 KB Output is correct
10 Correct 50 ms 6120 KB Output is correct
11 Correct 48 ms 6140 KB Output is correct
12 Correct 42 ms 5688 KB Output is correct
13 Correct 41 ms 5500 KB Output is correct
14 Correct 43 ms 5884 KB Output is correct
15 Correct 45 ms 5796 KB Output is correct
16 Correct 45 ms 5940 KB Output is correct
17 Correct 45 ms 6144 KB Output is correct
18 Correct 46 ms 6116 KB Output is correct
19 Correct 45 ms 5912 KB Output is correct
20 Correct 36 ms 6432 KB Output is correct
21 Correct 32 ms 6552 KB Output is correct
22 Correct 48 ms 6436 KB Output is correct
23 Correct 49 ms 6296 KB Output is correct
24 Correct 48 ms 6552 KB Output is correct
25 Correct 48 ms 6424 KB Output is correct
26 Correct 48 ms 6552 KB Output is correct
27 Correct 47 ms 6444 KB Output is correct
28 Correct 52 ms 6424 KB Output is correct
29 Correct 45 ms 5888 KB Output is correct
30 Correct 45 ms 6292 KB Output is correct
31 Correct 4 ms 1396 KB Output is correct
32 Correct 4 ms 1476 KB Output is correct
33 Correct 5 ms 1532 KB Output is correct
34 Correct 4 ms 1276 KB Output is correct
35 Correct 4 ms 1396 KB Output is correct
36 Correct 4 ms 1276 KB Output is correct
37 Correct 4 ms 1396 KB Output is correct
38 Correct 4 ms 1480 KB Output is correct
39 Correct 4 ms 1396 KB Output is correct
40 Correct 4 ms 1396 KB Output is correct
41 Correct 4 ms 1404 KB Output is correct
42 Correct 4 ms 1344 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1264 KB Output is correct
2 Correct 4 ms 1468 KB Output is correct
3 Correct 4 ms 1400 KB Output is correct
4 Correct 8 ms 2428 KB Output is correct
5 Correct 8 ms 2200 KB Output is correct
6 Correct 8 ms 2200 KB Output is correct
7 Correct 8 ms 2236 KB Output is correct
8 Correct 8 ms 2196 KB Output is correct
9 Correct 28 ms 6588 KB Output is correct
10 Correct 30 ms 6940 KB Output is correct
11 Correct 32 ms 6736 KB Output is correct
12 Correct 4 ms 1340 KB Output is correct
13 Correct 4 ms 1392 KB Output is correct
14 Correct 5 ms 1400 KB Output is correct
15 Correct 5 ms 1400 KB Output is correct

Subtask #4
42.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 7232 KB Output is correct
2 Correct 79 ms 7364 KB Output is correct
3 Partially correct 70 ms 7348 KB Partially correct
4 Partially correct 47 ms 5944 KB Partially correct
5 Correct 46 ms 6764 KB Output is correct
6 Correct 46 ms 6540 KB Output is correct
7 Correct 51 ms 6448 KB Output is correct
8 Correct 48 ms 6424 KB Output is correct
9 Correct 48 ms 6396 KB Output is correct
10 Correct 44 ms 6180 KB Output is correct
11 Correct 44 ms 6112 KB Output is correct
12 Correct 40 ms 5632 KB Output is correct
13 Correct 41 ms 5568 KB Output is correct
14 Correct 43 ms 5908 KB Output is correct
15 Correct 45 ms 6144 KB Output is correct
16 Correct 46 ms 6300 KB Output is correct
17 Correct 47 ms 6044 KB Output is correct
18 Correct 53 ms 5916 KB Output is correct
19 Correct 48 ms 6148 KB Output is correct
20 Partially correct 31 ms 6436 KB Partially correct
21 Correct 30 ms 6556 KB Output is correct
22 Correct 51 ms 6304 KB Output is correct
23 Correct 47 ms 6468 KB Output is correct
24 Partially correct 49 ms 6552 KB Partially correct
25 Partially correct 48 ms 6552 KB Partially correct
26 Partially correct 47 ms 6556 KB Partially correct
27 Correct 55 ms 6564 KB Output is correct
28 Correct 46 ms 6332 KB Output is correct
29 Partially correct 45 ms 6120 KB Partially correct
30 Partially correct 44 ms 6372 KB Partially correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 7368 KB Output is correct
2 Correct 70 ms 7328 KB Output is correct
3 Correct 69 ms 7360 KB Output is correct
4 Correct 50 ms 5892 KB Output is correct
5 Correct 47 ms 6808 KB Output is correct
6 Correct 46 ms 6476 KB Output is correct
7 Correct 47 ms 6432 KB Output is correct
8 Correct 46 ms 6304 KB Output is correct
9 Correct 46 ms 6464 KB Output is correct
10 Correct 45 ms 6172 KB Output is correct
11 Correct 44 ms 6172 KB Output is correct
12 Correct 41 ms 5692 KB Output is correct
13 Correct 43 ms 5532 KB Output is correct
14 Correct 47 ms 5780 KB Output is correct
15 Correct 47 ms 6076 KB Output is correct
16 Correct 48 ms 5940 KB Output is correct
17 Incorrect 46 ms 5808 KB Output isn't correct
18 Halted 0 ms 0 KB -