oj.uz

답안 #108539

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108539 2019-04-30T06:58:38 Z E869120 Amusement Park (JOI17_amusement_park) C++14
83 / 100
 1163 ms 4240 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 46 ms 1368 KB Output is correct
2 Correct 44 ms 1328 KB Output is correct
3 Correct 49 ms 1384 KB Output is correct
4 Correct 53 ms 1368 KB Output is correct
5 Correct 54 ms 1408 KB Output is correct
6 Correct 48 ms 1256 KB Output is correct
7 Correct 47 ms 1276 KB Output is correct
8 Correct 73 ms 1328 KB Output is correct
9 Correct 54 ms 1404 KB Output is correct
10 Correct 48 ms 1148 KB Output is correct
11 Correct 74 ms 1560 KB Output is correct
12 Correct 46 ms 1388 KB Output is correct
13 Correct 53 ms 1360 KB Output is correct
14 Correct 60 ms 1352 KB Output is correct
15 Correct 57 ms 1404 KB Output is correct
16 Correct 51 ms 1352 KB Output is correct
17 Correct 52 ms 1400 KB Output is correct
18 Correct 51 ms 1276 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1027 ms 4144 KB Output is correct
2 Correct 988 ms 4040 KB Output is correct
3 Correct 1055 ms 4156 KB Output is correct
4 Correct 769 ms 2872 KB Output is correct
5 Correct 927 ms 3260 KB Output is correct
6 Correct 847 ms 3000 KB Output is correct
7 Correct 870 ms 2992 KB Output is correct
8 Correct 787 ms 3008 KB Output is correct
9 Correct 774 ms 3312 KB Output is correct
10 Correct 397 ms 2992 KB Output is correct
11 Correct 412 ms 3120 KB Output is correct
12 Correct 436 ms 2860 KB Output is correct
13 Correct 415 ms 2792 KB Output is correct
14 Correct 552 ms 2812 KB Output is correct
15 Correct 661 ms 2932 KB Output is correct
16 Correct 602 ms 2844 KB Output is correct
17 Correct 652 ms 2900 KB Output is correct
18 Correct 726 ms 3000 KB Output is correct
19 Correct 814 ms 2868 KB Output is correct
20 Correct 490 ms 3304 KB Output is correct
21 Correct 488 ms 3200 KB Output is correct
22 Correct 573 ms 3056 KB Output is correct
23 Correct 616 ms 3100 KB Output is correct
24 Correct 579 ms 3084 KB Output is correct
25 Correct 666 ms 3228 KB Output is correct
26 Correct 623 ms 3016 KB Output is correct
27 Correct 594 ms 3204 KB Output is correct
28 Correct 635 ms 3188 KB Output is correct
29 Correct 577 ms 3016 KB Output is correct
30 Correct 570 ms 3016 KB Output is correct
31 Correct 51 ms 1352 KB Output is correct
32 Correct 49 ms 1288 KB Output is correct
33 Correct 51 ms 1264 KB Output is correct
34 Correct 59 ms 1164 KB Output is correct
35 Correct 53 ms 1280 KB Output is correct
36 Correct 49 ms 1344 KB Output is correct
37 Correct 46 ms 1368 KB Output is correct
38 Correct 48 ms 1292 KB Output is correct
39 Correct 48 ms 1240 KB Output is correct
40 Correct 48 ms 1228 KB Output is correct
41 Correct 54 ms 1376 KB Output is correct
42 Correct 49 ms 1244 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 1476 KB Output is correct
2 Correct 56 ms 1296 KB Output is correct
3 Correct 59 ms 1376 KB Output is correct
4 Correct 105 ms 1692 KB Output is correct
5 Correct 108 ms 1600 KB Output is correct
6 Correct 95 ms 1704 KB Output is correct
7 Correct 100 ms 1676 KB Output is correct
8 Correct 105 ms 1604 KB Output is correct
9 Correct 523 ms 3484 KB Output is correct
10 Correct 599 ms 3448 KB Output is correct
11 Correct 630 ms 3448 KB Output is correct
12 Correct 50 ms 1280 KB Output is correct
13 Correct 48 ms 1248 KB Output is correct
14 Correct 46 ms 1236 KB Output is correct
15 Correct 48 ms 1272 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1163 ms 4164 KB Output is correct
2 Correct 1075 ms 4240 KB Output is correct
3 Correct 1014 ms 4180 KB Output is correct
4 Correct 751 ms 2912 KB Output is correct
5 Correct 1060 ms 3368 KB Output is correct
6 Correct 994 ms 3196 KB Output is correct
7 Correct 803 ms 3184 KB Output is correct
8 Correct 889 ms 2940 KB Output is correct
9 Correct 749 ms 3040 KB Output is correct
10 Correct 474 ms 3016 KB Output is correct
11 Correct 437 ms 3116 KB Output is correct
12 Correct 573 ms 2804 KB Output is correct
13 Correct 447 ms 2708 KB Output is correct
14 Correct 472 ms 2804 KB Output is correct
15 Correct 725 ms 2880 KB Output is correct
16 Correct 620 ms 2868 KB Output is correct
17 Correct 810 ms 2924 KB Output is correct
18 Correct 743 ms 2960 KB Output is correct
19 Correct 686 ms 2992 KB Output is correct
20 Correct 509 ms 3208 KB Output is correct
21 Correct 431 ms 3232 KB Output is correct
22 Correct 532 ms 3176 KB Output is correct
23 Correct 623 ms 2992 KB Output is correct
24 Correct 634 ms 3132 KB Output is correct
25 Correct 630 ms 3288 KB Output is correct
26 Correct 615 ms 3172 KB Output is correct
27 Correct 661 ms 3236 KB Output is correct
28 Correct 634 ms 2996 KB Output is correct
29 Correct 489 ms 2992 KB Output is correct
30 Correct 577 ms 2908 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1030 ms 4136 KB Output is correct
2 Correct 1107 ms 4140 KB Output is correct
3 Correct 1047 ms 4048 KB Output is correct
4 Correct 718 ms 2976 KB Output is correct
5 Correct 911 ms 3336 KB Output is correct
6 Correct 801 ms 3016 KB Output is correct
7 Correct 842 ms 3064 KB Output is correct
8 Correct 807 ms 3140 KB Output is correct
9 Correct 826 ms 3112 KB Output is correct
10 Correct 386 ms 2972 KB Output is correct
11 Correct 388 ms 3148 KB Output is correct
12 Correct 547 ms 2692 KB Output is correct
13 Correct 512 ms 2836 KB Output is correct
14 Correct 524 ms 2744 KB Output is correct
15 Correct 645 ms 2864 KB Output is correct
16 Correct 754 ms 2860 KB Output is correct
17 Correct 767 ms 2940 KB Output is correct
18 Correct 695 ms 2944 KB Output is correct
19 Correct 762 ms 2948 KB Output is correct
20 Correct 460 ms 3176 KB Output is correct
21 Correct 612 ms 3196 KB Output is correct
22 Correct 790 ms 3212 KB Output is correct
23 Correct 698 ms 3076 KB Output is correct
24 Correct 618 ms 3052 KB Output is correct
25 Correct 655 ms 3168 KB Output is correct
26 Correct 632 ms 3028 KB Output is correct
27 Correct 615 ms 3204 KB Output is correct
28 Correct 639 ms 3216 KB Output is correct
29 Correct 546 ms 3016 KB Output is correct
30 Correct 583 ms 3068 KB Output is correct
31 Correct 44 ms 1340 KB Output is correct
32 Correct 59 ms 1536 KB Output is correct
33 Correct 56 ms 1360 KB Output is correct
34 Correct 56 ms 1432 KB Output is correct
35 Correct 46 ms 1416 KB Output is correct
36 Correct 46 ms 1308 KB Output is correct
37 Correct 54 ms 1192 KB Output is correct
38 Correct 49 ms 1364 KB Output is correct
39 Correct 57 ms 1244 KB Output is correct
40 Correct 48 ms 1412 KB Output is correct
41 Incorrect 50 ms 1260 KB Wrong Answer [7]
42 Halted 0 ms 0 KB -