oj.uz

답안 #108535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108535 2019-04-30T06:48:48 Z E869120 Amusement Park (JOI17_amusement_park) C++14
82 / 100
 1109 ms 4276 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 = 2400;
	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 = 2400;
	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 52 ms 1392 KB Output is correct
2 Correct 49 ms 1312 KB Output is correct
3 Correct 59 ms 1280 KB Output is correct
4 Correct 44 ms 1252 KB Output is correct
5 Correct 46 ms 1472 KB Output is correct
6 Correct 48 ms 1416 KB Output is correct
7 Correct 63 ms 1264 KB Output is correct
8 Correct 50 ms 1264 KB Output is correct
9 Correct 66 ms 1396 KB Output is correct
10 Correct 57 ms 1348 KB Output is correct
11 Correct 83 ms 1776 KB Output is correct
12 Correct 58 ms 1288 KB Output is correct
13 Correct 58 ms 1364 KB Output is correct
14 Correct 52 ms 1392 KB Output is correct
15 Correct 49 ms 1412 KB Output is correct
16 Correct 57 ms 1524 KB Output is correct
17 Correct 50 ms 1376 KB Output is correct
18 Correct 46 ms 1404 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 936 ms 4064 KB Output is correct
2 Correct 998 ms 4172 KB Output is correct
3 Correct 1109 ms 4276 KB Output is correct
4 Correct 745 ms 2908 KB Output is correct
5 Correct 939 ms 3248 KB Output is correct
6 Correct 882 ms 2996 KB Output is correct
7 Correct 1038 ms 3208 KB Output is correct
8 Correct 840 ms 3220 KB Output is correct
9 Correct 852 ms 3168 KB Output is correct
10 Correct 506 ms 3060 KB Output is correct
11 Correct 373 ms 2996 KB Output is correct
12 Correct 492 ms 2732 KB Output is correct
13 Correct 453 ms 2792 KB Output is correct
14 Correct 589 ms 2736 KB Output is correct
15 Correct 676 ms 2960 KB Output is correct
16 Correct 640 ms 2924 KB Output is correct
17 Correct 806 ms 2920 KB Output is correct
18 Correct 739 ms 2904 KB Output is correct
19 Correct 735 ms 2948 KB Output is correct
20 Correct 471 ms 3316 KB Output is correct
21 Correct 472 ms 3188 KB Output is correct
22 Correct 625 ms 3060 KB Output is correct
23 Correct 589 ms 3008 KB Output is correct
24 Correct 554 ms 3180 KB Output is correct
25 Correct 584 ms 3184 KB Output is correct
26 Correct 618 ms 3096 KB Output is correct
27 Correct 593 ms 3004 KB Output is correct
28 Correct 650 ms 3140 KB Output is correct
29 Correct 483 ms 2924 KB Output is correct
30 Correct 497 ms 3048 KB Output is correct
31 Correct 46 ms 1236 KB Output is correct
32 Correct 53 ms 1152 KB Output is correct
33 Correct 53 ms 1376 KB Output is correct
34 Correct 47 ms 1240 KB Output is correct
35 Correct 49 ms 1288 KB Output is correct
36 Correct 47 ms 1364 KB Output is correct
37 Correct 48 ms 1320 KB Output is correct
38 Correct 46 ms 1144 KB Output is correct
39 Correct 47 ms 1416 KB Output is correct
40 Correct 48 ms 1152 KB Output is correct
41 Correct 50 ms 1164 KB Output is correct
42 Correct 47 ms 1144 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 1280 KB Output is correct
2 Correct 66 ms 1288 KB Output is correct
3 Correct 44 ms 1152 KB Output is correct
4 Correct 91 ms 1776 KB Output is correct
5 Correct 86 ms 1708 KB Output is correct
6 Correct 90 ms 1684 KB Output is correct
7 Correct 109 ms 1688 KB Output is correct
8 Correct 111 ms 1592 KB Output is correct
9 Correct 512 ms 3512 KB Output is correct
10 Correct 585 ms 3536 KB Output is correct
11 Correct 620 ms 3476 KB Output is correct
12 Correct 48 ms 1260 KB Output is correct
13 Correct 55 ms 1288 KB Output is correct
14 Correct 48 ms 1288 KB Output is correct
15 Correct 53 ms 1236 KB Output is correct

Subtask #4
54.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 990 ms 4244 KB Output is correct
2 Correct 910 ms 4260 KB Output is correct
3 Correct 927 ms 4164 KB Output is correct
4 Correct 728 ms 3068 KB Output is correct
5 Correct 916 ms 3256 KB Output is correct
6 Correct 846 ms 3020 KB Output is correct
7 Correct 758 ms 3204 KB Output is correct
8 Correct 779 ms 2948 KB Output is correct
9 Correct 834 ms 3060 KB Output is correct
10 Correct 378 ms 2992 KB Output is correct
11 Correct 386 ms 2992 KB Output is correct
12 Correct 439 ms 2808 KB Output is correct
13 Partially correct 431 ms 2864 KB Partially correct
14 Correct 522 ms 2896 KB Output is correct
15 Correct 616 ms 2940 KB Output is correct
16 Correct 642 ms 2868 KB Output is correct
17 Correct 657 ms 3028 KB Output is correct
18 Correct 733 ms 3000 KB Output is correct
19 Partially correct 653 ms 2904 KB Partially correct
20 Correct 459 ms 3256 KB Output is correct
21 Correct 458 ms 3304 KB Output is correct
22 Correct 613 ms 3092 KB Output is correct
23 Correct 544 ms 2988 KB Output is correct
24 Correct 573 ms 3200 KB Output is correct
25 Correct 546 ms 3120 KB Output is correct
26 Correct 534 ms 2996 KB Output is correct
27 Correct 591 ms 3196 KB Output is correct
28 Correct 545 ms 3248 KB Output is correct
29 Correct 499 ms 2984 KB Output is correct
30 Correct 558 ms 2968 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1057 ms 4136 KB Output is correct
2 Correct 922 ms 4128 KB Output is correct
3 Correct 1044 ms 4036 KB Output is correct
4 Correct 716 ms 2968 KB Output is correct
5 Correct 1010 ms 3412 KB Output is correct
6 Correct 808 ms 2976 KB Output is correct
7 Correct 845 ms 3064 KB Output is correct
8 Correct 807 ms 3120 KB Output is correct
9 Correct 828 ms 3284 KB Output is correct
10 Correct 432 ms 3036 KB Output is correct
11 Correct 439 ms 3136 KB Output is correct
12 Correct 535 ms 2720 KB Output is correct
13 Correct 522 ms 2884 KB Output is correct
14 Correct 455 ms 2748 KB Output is correct
15 Correct 600 ms 2860 KB Output is correct
16 Correct 753 ms 2916 KB Output is correct
17 Correct 724 ms 2936 KB Output is correct
18 Correct 680 ms 2996 KB Output is correct
19 Correct 736 ms 2856 KB Output is correct
20 Correct 509 ms 3184 KB Output is correct
21 Correct 480 ms 3248 KB Output is correct
22 Correct 574 ms 3220 KB Output is correct
23 Correct 558 ms 3044 KB Output is correct
24 Correct 655 ms 3144 KB Output is correct
25 Correct 620 ms 2992 KB Output is correct
26 Correct 611 ms 2972 KB Output is correct
27 Correct 539 ms 3156 KB Output is correct
28 Correct 561 ms 3112 KB Output is correct
29 Correct 551 ms 2952 KB Output is correct
30 Correct 636 ms 3044 KB Output is correct
31 Correct 49 ms 1288 KB Output is correct
32 Correct 60 ms 1256 KB Output is correct
33 Correct 47 ms 1404 KB Output is correct
34 Correct 50 ms 1152 KB Output is correct
35 Correct 50 ms 1308 KB Output is correct
36 Correct 43 ms 1252 KB Output is correct
37 Correct 46 ms 1244 KB Output is correct
38 Correct 48 ms 1152 KB Output is correct
39 Correct 46 ms 1152 KB Output is correct
40 Incorrect 44 ms 1236 KB Output isn't correct
41 Halted 0 ms 0 KB -