oj.uz

답안 #108540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108540 2019-04-30T06:59:08 Z E869120 Amusement Park (JOI17_amusement_park) C++14
100 / 100
 1051 ms 4268 KB 
#include "Joi.h"
#include <iostream>
#include <vector>
using namespace std;

vector<int>G[10009]; int col[10009], v[20009], cnts;

void make_ransuu1(int B) {
	for (int i = 0; i < B; i++) v[i] = i;

	unsigned long long x = 2700;
	for (int i = 0; i < 1000000; i++) {
		x ^= x << 13;
		x ^= x >> 7;
		x ^= x << 17;
		int u1 = (x % B);
		x ^= x << 13;
		x ^= x >> 7;
		x ^= x << 17;
		int u2 = (x % B);
		swap(v[u1], v[u2]);
	}
}

void dfs(int pos) {
	if (col[pos] >= 0) return;
	col[pos] = cnts % 60; cnts++;
	for (int i = 0; i < G[pos].size(); i++) dfs(G[pos][i]);
}

void Joi(int N, int M, int A[], int B[], long long X, int T) {
	make_ransuu1(M);
	for (int i = 0; i < M; i++) { G[A[v[i]]].push_back(B[v[i]]); G[B[v[i]]].push_back(A[v[i]]); }
	for (int i = 0; i < N; i++) col[i] = -1;
	dfs(0);
	for (int i = 0; i < N; i++) MessageBoard(i, (X / (1LL << col[i])) % 2);
}

#include "Ioi.h"
#include <vector>
#include <queue>
#include <algorithm>
#include <ctime>
using namespace std;

vector<int>I[10009]; int dist[10009], par[10009], cols[10009], vv[20009], cntv;
int N, M; bool used[60];

void make_ransuu2(int B) {
	for (int i = 0; i < B; i++) vv[i] = i;

	unsigned long long x = 2700;
	for (int i = 0; i < 1000000; i++) {
		x ^= x << 13;
		x ^= x >> 7;
		x ^= x << 17;
		int u1 = (x % B);
		x ^= x << 13;
		x ^= x >> 7;
		x ^= x << 17;
		int u2 = (x % B);
		swap(vv[u1], vv[u2]);
	}
}


void dfs2(int pos) {
	if (cols[pos] >= 0) return;
	cols[pos] = cntv % 60; cntv++;
	for (int i = 0; i < I[pos].size(); i++) dfs2(I[pos][i]);
}

vector<int> nearest(int sta, int rem) {
	for (int i = 0; i < N; i++) dist[i] = (1 << 30);
	
	queue<int>Q; Q.push(sta); dist[sta] = 0;
	while (!Q.empty()) {
		int pos = Q.front(); Q.pop();
		for (int i = 0; i < I[pos].size(); i++) {
			int to = I[pos][i];
			if (dist[to] > dist[pos] + 1) {
				dist[to] = dist[pos] + 1;
				par[to] = pos;
				Q.push(to);
			}
		}
	}

	int id = 0, minx = 10000;
	for (int i = 0; i < N; i++) {
		if (cols[i] == rem && dist[i] < minx) {
			minx = dist[i]; id = i;
		}
	}

	vector<int>U;
	while (true) {
		U.push_back(id); if (id == sta) break;
		id = par[id];
	}
	reverse(U.begin(), U.end());
	return U;
}

long long Ioi(int NN, int MM, int A[], int B[], int P, int V, int T) {
	srand((unsigned)time(NULL));
	N = NN; M = MM; make_ransuu2(M);
	for (int i = 0; i < M; i++) { I[A[vv[i]]].push_back(B[vv[i]]); I[B[vv[i]]].push_back(A[vv[i]]); }
	for (int i = 0; i < N; i++) cols[i] = -1;
	dfs2(0);
	
	int cx = P; long long rem = 0, cntv = 0;
	for (int i = 0; i < 60; i++) {
		vector<int>E; int id = -1;
		for (int j = 0; j < 60; j++) {
			if (used[j] == true) continue;
			vector<int>F = nearest(cx, j);
			if (E.size() == 0 || E.size() > F.size()) { E = F; id = j; }
		}
		if (cntv + (E.size() - 1) > 120 && T == 5) {
			if (rand() % 2 == 0) rem += (1LL << id);
		}
		else {
			int F = V;
			for (int j = 1; j < E.size(); j++) {
				F = Move(E[j]);
			}
			rem += 1LL * F * (1LL << id);
			if (E.size() >= 1) cx = E[E.size() - 1];
			cntv += (E.size() - 1);
		}
		used[id] = true;
	}
	return rem;
}

Compilation message

Joi.cpp: In function 'void dfs(int)':
Joi.cpp:28:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < G[pos].size(); i++) dfs(G[pos][i]);
                  ~~^~~~~~~~~~~~~~~

Ioi.cpp: In function 'void dfs2(int)':
Ioi.cpp:32:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < I[pos].size(); i++) dfs2(I[pos][i]);
                  ~~^~~~~~~~~~~~~~~
Ioi.cpp: In function 'std::vector<int> nearest(int, int)':
Ioi.cpp:41:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < I[pos].size(); i++) {
                   ~~^~~~~~~~~~~~~~~
Ioi.cpp: In function 'long long int Ioi(int, int, int*, int*, int, int, int)':
Ioi.cpp:87:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = 1; j < E.size(); j++) {
                    ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 1380 KB Output is correct
2 Correct 50 ms 1332 KB Output is correct
3 Correct 52 ms 1272 KB Output is correct
4 Correct 64 ms 1344 KB Output is correct
5 Correct 54 ms 1416 KB Output is correct
6 Correct 54 ms 1240 KB Output is correct
7 Correct 49 ms 1292 KB Output is correct
8 Correct 56 ms 1352 KB Output is correct
9 Correct 58 ms 1308 KB Output is correct
10 Correct 56 ms 1532 KB Output is correct
11 Correct 80 ms 1580 KB Output is correct
12 Correct 46 ms 1240 KB Output is correct
13 Correct 50 ms 1272 KB Output is correct
14 Correct 53 ms 1260 KB Output is correct
15 Correct 57 ms 1492 KB Output is correct
16 Correct 50 ms 1348 KB Output is correct
17 Correct 58 ms 1384 KB Output is correct
18 Correct 55 ms 1312 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1039 ms 4136 KB Output is correct
2 Correct 1051 ms 4204 KB Output is correct
3 Correct 1018 ms 4140 KB Output is correct
4 Correct 823 ms 2964 KB Output is correct
5 Correct 1049 ms 3376 KB Output is correct
6 Correct 796 ms 3160 KB Output is correct
7 Correct 842 ms 3104 KB Output is correct
8 Correct 896 ms 3080 KB Output is correct
9 Correct 836 ms 3192 KB Output is correct
10 Correct 528 ms 3008 KB Output is correct
11 Correct 447 ms 2980 KB Output is correct
12 Correct 632 ms 2796 KB Output is correct
13 Correct 790 ms 2644 KB Output is correct
14 Correct 481 ms 2824 KB Output is correct
15 Correct 720 ms 3000 KB Output is correct
16 Correct 662 ms 2960 KB Output is correct
17 Correct 779 ms 2928 KB Output is correct
18 Correct 853 ms 3112 KB Output is correct
19 Correct 778 ms 2996 KB Output is correct
20 Correct 507 ms 3216 KB Output is correct
21 Correct 472 ms 3192 KB Output is correct
22 Correct 650 ms 3056 KB Output is correct
23 Correct 607 ms 3196 KB Output is correct
24 Correct 533 ms 2996 KB Output is correct
25 Correct 610 ms 3088 KB Output is correct
26 Correct 531 ms 3232 KB Output is correct
27 Correct 530 ms 3012 KB Output is correct
28 Correct 579 ms 3108 KB Output is correct
29 Correct 535 ms 2956 KB Output is correct
30 Correct 577 ms 2968 KB Output is correct
31 Correct 60 ms 1200 KB Output is correct
32 Correct 60 ms 1244 KB Output is correct
33 Correct 55 ms 1292 KB Output is correct
34 Correct 65 ms 1264 KB Output is correct
35 Correct 60 ms 1584 KB Output is correct
36 Correct 48 ms 1264 KB Output is correct
37 Correct 53 ms 1244 KB Output is correct
38 Correct 60 ms 1344 KB Output is correct
39 Correct 46 ms 1152 KB Output is correct
40 Correct 50 ms 1464 KB Output is correct
41 Correct 45 ms 1288 KB Output is correct
42 Correct 50 ms 1392 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 1308 KB Output is correct
2 Correct 55 ms 1244 KB Output is correct
3 Correct 53 ms 1368 KB Output is correct
4 Correct 98 ms 1616 KB Output is correct
5 Correct 87 ms 1680 KB Output is correct
6 Correct 99 ms 1684 KB Output is correct
7 Correct 125 ms 1548 KB Output is correct
8 Correct 105 ms 1632 KB Output is correct
9 Correct 517 ms 3456 KB Output is correct
10 Correct 624 ms 3544 KB Output is correct
11 Correct 594 ms 3556 KB Output is correct
12 Correct 44 ms 1152 KB Output is correct
13 Correct 47 ms 1284 KB Output is correct
14 Correct 44 ms 1248 KB Output is correct
15 Correct 50 ms 1288 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 983 ms 4184 KB Output is correct
2 Correct 922 ms 4152 KB Output is correct
3 Correct 1002 ms 4216 KB Output is correct
4 Correct 763 ms 2992 KB Output is correct
5 Correct 956 ms 3416 KB Output is correct
6 Correct 779 ms 3184 KB Output is correct
7 Correct 819 ms 3088 KB Output is correct
8 Correct 832 ms 2996 KB Output is correct
9 Correct 760 ms 3024 KB Output is correct
10 Correct 462 ms 2824 KB Output is correct
11 Correct 449 ms 3064 KB Output is correct
12 Correct 534 ms 2748 KB Output is correct
13 Correct 538 ms 2804 KB Output is correct
14 Correct 546 ms 2840 KB Output is correct
15 Correct 701 ms 2892 KB Output is correct
16 Correct 752 ms 2936 KB Output is correct
17 Correct 774 ms 2908 KB Output is correct
18 Correct 752 ms 2860 KB Output is correct
19 Correct 752 ms 2904 KB Output is correct
20 Correct 556 ms 3248 KB Output is correct
21 Correct 535 ms 3192 KB Output is correct
22 Correct 523 ms 3164 KB Output is correct
23 Correct 605 ms 3080 KB Output is correct
24 Correct 616 ms 3156 KB Output is correct
25 Correct 614 ms 3100 KB Output is correct
26 Correct 613 ms 3168 KB Output is correct
27 Correct 598 ms 3212 KB Output is correct
28 Correct 631 ms 3012 KB Output is correct
29 Correct 595 ms 3004 KB Output is correct
30 Correct 586 ms 2976 KB Output is correct

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1012 ms 4108 KB Output is correct
2 Correct 996 ms 4268 KB Output is correct
3 Correct 993 ms 4136 KB Output is correct
4 Correct 730 ms 2904 KB Output is correct
5 Correct 974 ms 3376 KB Output is correct
6 Correct 850 ms 3144 KB Output is correct
7 Correct 841 ms 3044 KB Output is correct
8 Correct 718 ms 3016 KB Output is correct
9 Correct 744 ms 3132 KB Output is correct
10 Correct 378 ms 3024 KB Output is correct
11 Correct 395 ms 2992 KB Output is correct
12 Correct 499 ms 2720 KB Output is correct
13 Correct 531 ms 2700 KB Output is correct
14 Correct 482 ms 2864 KB Output is correct
15 Correct 573 ms 2864 KB Output is correct
16 Correct 622 ms 2860 KB Output is correct
17 Correct 729 ms 2864 KB Output is correct
18 Correct 677 ms 2996 KB Output is correct
19 Correct 716 ms 2872 KB Output is correct
20 Correct 465 ms 3204 KB Output is correct
21 Correct 520 ms 3156 KB Output is correct
22 Correct 567 ms 3016 KB Output is correct
23 Correct 648 ms 3112 KB Output is correct
24 Correct 545 ms 3072 KB Output is correct
25 Correct 613 ms 3128 KB Output is correct
26 Correct 625 ms 3032 KB Output is correct
27 Correct 606 ms 3232 KB Output is correct
28 Correct 599 ms 3232 KB Output is correct
29 Correct 485 ms 2952 KB Output is correct
30 Correct 566 ms 3116 KB Output is correct
31 Correct 45 ms 1152 KB Output is correct
32 Correct 54 ms 1356 KB Output is correct
33 Correct 49 ms 1432 KB Output is correct
34 Correct 51 ms 1248 KB Output is correct
35 Correct 48 ms 1272 KB Output is correct
36 Correct 46 ms 1332 KB Output is correct
37 Correct 45 ms 1256 KB Output is correct
38 Correct 47 ms 1368 KB Output is correct
39 Correct 54 ms 1144 KB Output is correct
40 Correct 54 ms 1328 KB Output is correct
41 Correct 49 ms 1152 KB Output is correct
42 Correct 45 ms 1376 KB Output is correct