oj.uz

답안 #108529

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108529 2019-04-30T06:43:04 Z E869120 Amusement Park (JOI17_amusement_park) C++14
83 / 100
 1083 ms 4216 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 = 787;
	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 = 787;
	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 57 ms 1388 KB Output is correct
2 Correct 47 ms 1416 KB Output is correct
3 Correct 66 ms 1292 KB Output is correct
4 Correct 50 ms 1400 KB Output is correct
5 Correct 52 ms 1400 KB Output is correct
6 Correct 52 ms 1316 KB Output is correct
7 Correct 64 ms 1436 KB Output is correct
8 Correct 57 ms 1368 KB Output is correct
9 Correct 49 ms 1368 KB Output is correct
10 Correct 47 ms 1152 KB Output is correct
11 Correct 66 ms 1580 KB Output is correct
12 Correct 48 ms 1280 KB Output is correct
13 Correct 56 ms 1388 KB Output is correct
14 Correct 63 ms 1404 KB Output is correct
15 Correct 54 ms 1276 KB Output is correct
16 Correct 52 ms 1304 KB Output is correct
17 Correct 57 ms 1372 KB Output is correct
18 Correct 54 ms 1292 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1038 ms 4148 KB Output is correct
2 Correct 964 ms 4132 KB Output is correct
3 Correct 1004 ms 4180 KB Output is correct
4 Correct 715 ms 2992 KB Output is correct
5 Correct 943 ms 3196 KB Output is correct
6 Correct 829 ms 3076 KB Output is correct
7 Correct 843 ms 3120 KB Output is correct
8 Correct 840 ms 3144 KB Output is correct
9 Correct 834 ms 3180 KB Output is correct
10 Correct 544 ms 3040 KB Output is correct
11 Correct 500 ms 2952 KB Output is correct
12 Correct 546 ms 2748 KB Output is correct
13 Correct 500 ms 2788 KB Output is correct
14 Correct 523 ms 2828 KB Output is correct
15 Correct 691 ms 2904 KB Output is correct
16 Correct 647 ms 2852 KB Output is correct
17 Correct 840 ms 2972 KB Output is correct
18 Correct 717 ms 2996 KB Output is correct
19 Correct 766 ms 2996 KB Output is correct
20 Correct 498 ms 3340 KB Output is correct
21 Correct 495 ms 3188 KB Output is correct
22 Correct 629 ms 2964 KB Output is correct
23 Correct 564 ms 3104 KB Output is correct
24 Correct 574 ms 3200 KB Output is correct
25 Correct 564 ms 2964 KB Output is correct
26 Correct 593 ms 3012 KB Output is correct
27 Correct 556 ms 3012 KB Output is correct
28 Correct 517 ms 3104 KB Output is correct
29 Correct 454 ms 3016 KB Output is correct
30 Correct 485 ms 2964 KB Output is correct
31 Correct 46 ms 1152 KB Output is correct
32 Correct 46 ms 1152 KB Output is correct
33 Correct 50 ms 1368 KB Output is correct
34 Correct 50 ms 1256 KB Output is correct
35 Correct 50 ms 1384 KB Output is correct
36 Correct 47 ms 1384 KB Output is correct
37 Correct 52 ms 1256 KB Output is correct
38 Correct 48 ms 1144 KB Output is correct
39 Correct 44 ms 1152 KB Output is correct
40 Correct 48 ms 1476 KB Output is correct
41 Correct 50 ms 1152 KB Output is correct
42 Correct 43 ms 1292 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 1152 KB Output is correct
2 Correct 46 ms 1152 KB Output is correct
3 Correct 51 ms 1280 KB Output is correct
4 Correct 118 ms 1676 KB Output is correct
5 Correct 105 ms 1624 KB Output is correct
6 Correct 107 ms 1748 KB Output is correct
7 Correct 98 ms 1796 KB Output is correct
8 Correct 109 ms 1528 KB Output is correct
9 Correct 497 ms 3576 KB Output is correct
10 Correct 588 ms 3384 KB Output is correct
11 Correct 663 ms 3372 KB Output is correct
12 Correct 48 ms 1152 KB Output is correct
13 Correct 48 ms 1152 KB Output is correct
14 Correct 51 ms 1392 KB Output is correct
15 Correct 56 ms 1244 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1083 ms 4168 KB Output is correct
2 Correct 1052 ms 4132 KB Output is correct
3 Correct 969 ms 4056 KB Output is correct
4 Correct 755 ms 2904 KB Output is correct
5 Correct 894 ms 3372 KB Output is correct
6 Correct 747 ms 3176 KB Output is correct
7 Correct 759 ms 3124 KB Output is correct
8 Correct 791 ms 3040 KB Output is correct
9 Correct 729 ms 3100 KB Output is correct
10 Correct 370 ms 3016 KB Output is correct
11 Correct 457 ms 3008 KB Output is correct
12 Correct 496 ms 2804 KB Output is correct
13 Correct 515 ms 2848 KB Output is correct
14 Correct 500 ms 2892 KB Output is correct
15 Correct 657 ms 2940 KB Output is correct
16 Correct 585 ms 2968 KB Output is correct
17 Correct 730 ms 2976 KB Output is correct
18 Correct 800 ms 2992 KB Output is correct
19 Correct 715 ms 2768 KB Output is correct
20 Correct 430 ms 3308 KB Output is correct
21 Correct 446 ms 3236 KB Output is correct
22 Correct 549 ms 3220 KB Output is correct
23 Correct 642 ms 3076 KB Output is correct
24 Correct 578 ms 3116 KB Output is correct
25 Correct 572 ms 3092 KB Output is correct
26 Correct 622 ms 3132 KB Output is correct
27 Correct 584 ms 3192 KB Output is correct
28 Correct 563 ms 3068 KB Output is correct
29 Correct 505 ms 2900 KB Output is correct
30 Correct 504 ms 3064 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 943 ms 4216 KB Output is correct
2 Correct 1046 ms 4028 KB Output is correct
3 Correct 1063 ms 4056 KB Output is correct
4 Correct 715 ms 2988 KB Output is correct
5 Correct 946 ms 3396 KB Output is correct
6 Correct 724 ms 3104 KB Output is correct
7 Correct 793 ms 3060 KB Output is correct
8 Correct 739 ms 3184 KB Output is correct
9 Correct 792 ms 3376 KB Output is correct
10 Correct 429 ms 3128 KB Output is correct
11 Correct 451 ms 2968 KB Output is correct
12 Correct 503 ms 2664 KB Output is correct
13 Correct 515 ms 2820 KB Output is correct
14 Correct 515 ms 3016 KB Output is correct
15 Correct 685 ms 2992 KB Output is correct
16 Correct 682 ms 2852 KB Output is correct
17 Correct 722 ms 2868 KB Output is correct
18 Correct 720 ms 2904 KB Output is correct
19 Correct 731 ms 2964 KB Output is correct
20 Correct 455 ms 3264 KB Output is correct
21 Correct 496 ms 3244 KB Output is correct
22 Correct 631 ms 3164 KB Output is correct
23 Correct 652 ms 3024 KB Output is correct
24 Correct 619 ms 3020 KB Output is correct
25 Correct 624 ms 2992 KB Output is correct
26 Correct 581 ms 2992 KB Output is correct
27 Correct 602 ms 3192 KB Output is correct
28 Correct 667 ms 3332 KB Output is correct
29 Correct 603 ms 2976 KB Output is correct
30 Correct 535 ms 3068 KB Output is correct
31 Correct 53 ms 1152 KB Output is correct
32 Correct 48 ms 1144 KB Output is correct
33 Correct 61 ms 1276 KB Output is correct
34 Correct 44 ms 1152 KB Output is correct
35 Correct 50 ms 1152 KB Output is correct
36 Correct 49 ms 1236 KB Output is correct
37 Correct 50 ms 1272 KB Output is correct
38 Correct 46 ms 1152 KB Output is correct
39 Correct 43 ms 1152 KB Output is correct
40 Incorrect 49 ms 1436 KB Output isn't correct
41 Halted 0 ms 0 KB -