oj.uz

답안 #130669

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
130669 2019-07-15T19:41:56 Z tutis Amusement Park (JOI17_amusement_park) C++17
41 / 100
 74 ms 7360 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;
	for (int x : adj[v])
	{
		if (aplankyta.count(x))
			continue;
		dfs(x, v);
		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;
		int v1 = order[(ii + 1) % order.size()];
		V = Move(v1);
		P = v1;
		ii++;
	}
	return X;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 1268 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 7180 KB Output is correct
2 Correct 69 ms 7316 KB Output is correct
3 Correct 74 ms 7356 KB Output is correct
4 Correct 46 ms 5884 KB Output is correct
5 Correct 51 ms 6372 KB Output is correct
6 Correct 49 ms 6128 KB Output is correct
7 Correct 49 ms 6440 KB Output is correct
8 Correct 48 ms 6328 KB Output is correct
9 Correct 52 ms 6408 KB Output is correct
10 Correct 44 ms 5816 KB Output is correct
11 Correct 47 ms 5816 KB Output is correct
12 Correct 42 ms 5288 KB Output is correct
13 Correct 43 ms 5396 KB Output is correct
14 Correct 46 ms 5600 KB Output is correct
15 Correct 49 ms 5840 KB Output is correct
16 Correct 46 ms 5868 KB Output is correct
17 Correct 46 ms 5884 KB Output is correct
18 Correct 47 ms 5824 KB Output is correct
19 Correct 64 ms 6128 KB Output is correct
20 Correct 28 ms 6232 KB Output is correct
21 Correct 28 ms 5948 KB Output is correct
22 Correct 49 ms 6328 KB Output is correct
23 Correct 50 ms 6328 KB Output is correct
24 Incorrect 48 ms 6152 KB Wrong Answer [7]
25 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1396 KB Output is correct
2 Correct 5 ms 1400 KB Output is correct
3 Incorrect 4 ms 1500 KB Wrong Answer [7]
4 Halted 0 ms 0 KB -

Subtask #4
41.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 7360 KB Output is correct
2 Correct 70 ms 7360 KB Output is correct
3 Correct 69 ms 7232 KB Output is correct
4 Correct 46 ms 5892 KB Output is correct
5 Partially correct 48 ms 6584 KB Partially correct
6 Partially correct 46 ms 6124 KB Partially correct
7 Correct 50 ms 6256 KB Output is correct
8 Correct 49 ms 6316 KB Output is correct
9 Correct 47 ms 6300 KB Output is correct
10 Correct 44 ms 5864 KB Output is correct
11 Correct 44 ms 5860 KB Output is correct
12 Correct 41 ms 5296 KB Output is correct
13 Correct 41 ms 5340 KB Output is correct
14 Correct 45 ms 5604 KB Output is correct
15 Correct 45 ms 5824 KB Output is correct
16 Correct 46 ms 5824 KB Output is correct
17 Correct 46 ms 5892 KB Output is correct
18 Correct 46 ms 5916 KB Output is correct
19 Correct 47 ms 5688 KB Output is correct
20 Correct 28 ms 6184 KB Output is correct
21 Partially correct 28 ms 6168 KB Partially correct
22 Correct 48 ms 6388 KB Output is correct
23 Correct 49 ms 6208 KB Output is correct
24 Correct 52 ms 6436 KB Output is correct
25 Correct 47 ms 6336 KB Output is correct
26 Partially correct 49 ms 6512 KB Partially correct
27 Correct 48 ms 6200 KB Output is correct
28 Correct 54 ms 6528 KB Output is correct
29 Correct 42 ms 5808 KB Output is correct
30 Partially correct 45 ms 5984 KB Partially correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 7320 KB Output is correct
2 Incorrect 71 ms 7168 KB Output isn't correct
3 Halted 0 ms 0 KB -