oj.uz

답안 #108530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108530 2019-04-30T06:43:55 Z E869120 Amusement Park (JOI17_amusement_park) C++14
83 / 100
 1094 ms 4236 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 = 1000;
	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>
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 = 1000;
	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) {
	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;
	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; }
		}
		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];
		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:31: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:40: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:81:21: 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 1304 KB Output is correct
2 Correct 48 ms 1284 KB Output is correct
3 Correct 48 ms 1368 KB Output is correct
4 Correct 55 ms 1240 KB Output is correct
5 Correct 54 ms 1376 KB Output is correct
6 Correct 56 ms 1304 KB Output is correct
7 Correct 54 ms 1276 KB Output is correct
8 Correct 64 ms 1272 KB Output is correct
9 Correct 53 ms 1384 KB Output is correct
10 Correct 48 ms 1384 KB Output is correct
11 Correct 76 ms 1616 KB Output is correct
12 Correct 44 ms 1372 KB Output is correct
13 Correct 45 ms 1296 KB Output is correct
14 Correct 47 ms 1388 KB Output is correct
15 Correct 56 ms 1404 KB Output is correct
16 Correct 50 ms 1264 KB Output is correct
17 Correct 52 ms 1308 KB Output is correct
18 Correct 62 ms 1264 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1094 ms 4104 KB Output is correct
2 Correct 942 ms 4128 KB Output is correct
3 Correct 1046 ms 4064 KB Output is correct
4 Correct 660 ms 2840 KB Output is correct
5 Correct 968 ms 3200 KB Output is correct
6 Correct 811 ms 3116 KB Output is correct
7 Correct 839 ms 3080 KB Output is correct
8 Correct 886 ms 3160 KB Output is correct
9 Correct 755 ms 3204 KB Output is correct
10 Correct 394 ms 2968 KB Output is correct
11 Correct 378 ms 2992 KB Output is correct
12 Correct 551 ms 2724 KB Output is correct
13 Correct 506 ms 2800 KB Output is correct
14 Correct 443 ms 2832 KB Output is correct
15 Correct 668 ms 2772 KB Output is correct
16 Correct 642 ms 2864 KB Output is correct
17 Correct 725 ms 2960 KB Output is correct
18 Correct 709 ms 3000 KB Output is correct
19 Correct 730 ms 2992 KB Output is correct
20 Correct 474 ms 3256 KB Output is correct
21 Correct 439 ms 3156 KB Output is correct
22 Correct 569 ms 2960 KB Output is correct
23 Correct 700 ms 3228 KB Output is correct
24 Correct 546 ms 2972 KB Output is correct
25 Correct 572 ms 3084 KB Output is correct
26 Correct 627 ms 3216 KB Output is correct
27 Correct 575 ms 3012 KB Output is correct
28 Correct 652 ms 3100 KB Output is correct
29 Correct 547 ms 2964 KB Output is correct
30 Correct 509 ms 2948 KB Output is correct
31 Correct 45 ms 1152 KB Output is correct
32 Correct 47 ms 1248 KB Output is correct
33 Correct 62 ms 1396 KB Output is correct
34 Correct 46 ms 1144 KB Output is correct
35 Correct 53 ms 1280 KB Output is correct
36 Correct 59 ms 1152 KB Output is correct
37 Correct 57 ms 1152 KB Output is correct
38 Correct 49 ms 1288 KB Output is correct
39 Correct 46 ms 1296 KB Output is correct
40 Correct 54 ms 1388 KB Output is correct
41 Correct 46 ms 1152 KB Output is correct
42 Correct 55 ms 1152 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 1440 KB Output is correct
2 Correct 47 ms 1376 KB Output is correct
3 Correct 50 ms 1152 KB Output is correct
4 Correct 104 ms 1584 KB Output is correct
5 Correct 100 ms 1736 KB Output is correct
6 Correct 102 ms 1684 KB Output is correct
7 Correct 100 ms 1580 KB Output is correct
8 Correct 105 ms 1548 KB Output is correct
9 Correct 458 ms 3504 KB Output is correct
10 Correct 590 ms 3448 KB Output is correct
11 Correct 623 ms 3484 KB Output is correct
12 Correct 53 ms 1408 KB Output is correct
13 Correct 49 ms 1236 KB Output is correct
14 Correct 54 ms 1272 KB Output is correct
15 Correct 55 ms 1244 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1033 ms 4220 KB Output is correct
2 Correct 1057 ms 4152 KB Output is correct
3 Correct 1016 ms 4064 KB Output is correct
4 Correct 684 ms 2804 KB Output is correct
5 Correct 861 ms 3332 KB Output is correct
6 Correct 801 ms 3108 KB Output is correct
7 Correct 721 ms 3256 KB Output is correct
8 Correct 799 ms 3128 KB Output is correct
9 Correct 795 ms 3040 KB Output is correct
10 Correct 513 ms 2968 KB Output is correct
11 Correct 422 ms 2968 KB Output is correct
12 Correct 471 ms 2728 KB Output is correct
13 Correct 428 ms 2728 KB Output is correct
14 Correct 468 ms 2836 KB Output is correct
15 Correct 684 ms 2932 KB Output is correct
16 Correct 717 ms 2768 KB Output is correct
17 Correct 715 ms 2888 KB Output is correct
18 Correct 766 ms 2984 KB Output is correct
19 Correct 720 ms 2988 KB Output is correct
20 Correct 464 ms 3120 KB Output is correct
21 Correct 444 ms 3156 KB Output is correct
22 Correct 593 ms 3120 KB Output is correct
23 Correct 592 ms 3144 KB Output is correct
24 Correct 570 ms 2980 KB Output is correct
25 Correct 582 ms 3004 KB Output is correct
26 Correct 562 ms 3120 KB Output is correct
27 Correct 539 ms 3244 KB Output is correct
28 Correct 556 ms 3064 KB Output is correct
29 Correct 503 ms 3004 KB Output is correct
30 Correct 627 ms 2984 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1036 ms 4060 KB Output is correct
2 Correct 992 ms 4236 KB Output is correct
3 Correct 986 ms 4236 KB Output is correct
4 Correct 729 ms 2892 KB Output is correct
5 Correct 1000 ms 3368 KB Output is correct
6 Correct 816 ms 3064 KB Output is correct
7 Correct 807 ms 3068 KB Output is correct
8 Correct 786 ms 3012 KB Output is correct
9 Correct 817 ms 3372 KB Output is correct
10 Correct 439 ms 3084 KB Output is correct
11 Correct 431 ms 3004 KB Output is correct
12 Correct 458 ms 2816 KB Output is correct
13 Correct 509 ms 2812 KB Output is correct
14 Correct 613 ms 2860 KB Output is correct
15 Correct 607 ms 2768 KB Output is correct
16 Correct 762 ms 2764 KB Output is correct
17 Correct 656 ms 2896 KB Output is correct
18 Correct 637 ms 2900 KB Output is correct
19 Correct 714 ms 2912 KB Output is correct
20 Correct 505 ms 3116 KB Output is correct
21 Correct 526 ms 3104 KB Output is correct
22 Correct 525 ms 3164 KB Output is correct
23 Correct 609 ms 3204 KB Output is correct
24 Correct 596 ms 3056 KB Output is correct
25 Correct 597 ms 3084 KB Output is correct
26 Correct 541 ms 2968 KB Output is correct
27 Correct 548 ms 3248 KB Output is correct
28 Correct 598 ms 3160 KB Output is correct
29 Correct 545 ms 3104 KB Output is correct
30 Correct 546 ms 3012 KB Output is correct
31 Incorrect 56 ms 1152 KB Output isn't correct
32 Halted 0 ms 0 KB -