oj.uz

Submission #108537

# Submission time Handle Problem Language Result Execution time Memory
108537 2019-04-30T06:51:19 Z E869120 Amusement Park (JOI17_amusement_park) C++14
83 / 100
 1103 ms 4328 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>
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) {
	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

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1152 KB Output is correct
2 Correct 47 ms 1236 KB Output is correct
3 Correct 48 ms 1372 KB Output is correct
4 Correct 46 ms 1384 KB Output is correct
5 Correct 43 ms 1160 KB Output is correct
6 Correct 50 ms 1152 KB Output is correct
7 Correct 61 ms 1412 KB Output is correct
8 Correct 57 ms 1292 KB Output is correct
9 Correct 64 ms 1292 KB Output is correct
10 Correct 60 ms 1400 KB Output is correct
11 Correct 83 ms 1696 KB Output is correct
12 Correct 50 ms 1292 KB Output is correct
13 Correct 56 ms 1420 KB Output is correct
14 Correct 55 ms 1304 KB Output is correct
15 Correct 47 ms 1292 KB Output is correct
16 Correct 49 ms 1392 KB Output is correct
17 Correct 56 ms 1400 KB Output is correct
18 Correct 49 ms 1292 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1000 ms 4328 KB Output is correct
2 Correct 988 ms 4268 KB Output is correct
3 Correct 1059 ms 4164 KB Output is correct
4 Correct 735 ms 3016 KB Output is correct
5 Correct 929 ms 3244 KB Output is correct
6 Correct 829 ms 3128 KB Output is correct
7 Correct 859 ms 3280 KB Output is correct
8 Correct 782 ms 3256 KB Output is correct
9 Correct 774 ms 3108 KB Output is correct
10 Correct 401 ms 3056 KB Output is correct
11 Correct 371 ms 3068 KB Output is correct
12 Correct 450 ms 2848 KB Output is correct
13 Correct 536 ms 2848 KB Output is correct
14 Correct 528 ms 2872 KB Output is correct
15 Correct 572 ms 2864 KB Output is correct
16 Correct 573 ms 2872 KB Output is correct
17 Correct 744 ms 2860 KB Output is correct
18 Correct 722 ms 2988 KB Output is correct
19 Correct 710 ms 2864 KB Output is correct
20 Correct 449 ms 3296 KB Output is correct
21 Correct 491 ms 3256 KB Output is correct
22 Correct 550 ms 2992 KB Output is correct
23 Correct 526 ms 3140 KB Output is correct
24 Correct 586 ms 3064 KB Output is correct
25 Correct 535 ms 3060 KB Output is correct
26 Correct 562 ms 3268 KB Output is correct
27 Correct 590 ms 3120 KB Output is correct
28 Correct 577 ms 3120 KB Output is correct
29 Correct 525 ms 2976 KB Output is correct
30 Correct 471 ms 3096 KB Output is correct
31 Correct 51 ms 1392 KB Output is correct
32 Correct 48 ms 1288 KB Output is correct
33 Correct 47 ms 1372 KB Output is correct
34 Correct 44 ms 1392 KB Output is correct
35 Correct 47 ms 1368 KB Output is correct
36 Correct 49 ms 1144 KB Output is correct
37 Correct 48 ms 1280 KB Output is correct
38 Correct 43 ms 1152 KB Output is correct
39 Correct 45 ms 1156 KB Output is correct
40 Correct 55 ms 1412 KB Output is correct
41 Correct 53 ms 1288 KB Output is correct
42 Correct 45 ms 1288 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1252 KB Output is correct
2 Correct 48 ms 1408 KB Output is correct
3 Correct 48 ms 1304 KB Output is correct
4 Correct 107 ms 1644 KB Output is correct
5 Correct 120 ms 1556 KB Output is correct
6 Correct 97 ms 1684 KB Output is correct
7 Correct 107 ms 1688 KB Output is correct
8 Correct 102 ms 1628 KB Output is correct
9 Correct 516 ms 3580 KB Output is correct
10 Correct 659 ms 3576 KB Output is correct
11 Correct 587 ms 3512 KB Output is correct
12 Correct 46 ms 1288 KB Output is correct
13 Correct 47 ms 1388 KB Output is correct
14 Correct 54 ms 1316 KB Output is correct
15 Correct 48 ms 1416 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1103 ms 4040 KB Output is correct
2 Correct 1010 ms 4132 KB Output is correct
3 Correct 932 ms 4276 KB Output is correct
4 Correct 639 ms 2992 KB Output is correct
5 Correct 925 ms 3264 KB Output is correct
6 Correct 775 ms 3128 KB Output is correct
7 Correct 790 ms 3120 KB Output is correct
8 Correct 824 ms 2992 KB Output is correct
9 Correct 766 ms 2996 KB Output is correct
10 Correct 403 ms 3112 KB Output is correct
11 Correct 393 ms 2932 KB Output is correct
12 Correct 504 ms 2720 KB Output is correct
13 Correct 474 ms 2764 KB Output is correct
14 Correct 513 ms 2996 KB Output is correct
15 Correct 677 ms 2992 KB Output is correct
16 Correct 627 ms 2864 KB Output is correct
17 Correct 709 ms 2992 KB Output is correct
18 Correct 702 ms 2992 KB Output is correct
19 Correct 757 ms 2992 KB Output is correct
20 Correct 469 ms 3332 KB Output is correct
21 Correct 456 ms 3256 KB Output is correct
22 Correct 632 ms 2988 KB Output is correct
23 Correct 564 ms 3128 KB Output is correct
24 Correct 572 ms 3176 KB Output is correct
25 Correct 584 ms 3124 KB Output is correct
26 Correct 589 ms 3188 KB Output is correct
27 Correct 565 ms 2996 KB Output is correct
28 Correct 557 ms 3048 KB Output is correct
29 Correct 596 ms 2920 KB Output is correct
30 Correct 517 ms 3144 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 998 ms 4048 KB Output is correct
2 Correct 1030 ms 4240 KB Output is correct
3 Correct 1010 ms 4288 KB Output is correct
4 Correct 707 ms 2992 KB Output is correct
5 Correct 949 ms 3584 KB Output is correct
6 Correct 757 ms 3004 KB Output is correct
7 Correct 811 ms 2992 KB Output is correct
8 Correct 792 ms 3392 KB Output is correct
9 Correct 742 ms 3372 KB Output is correct
10 Correct 490 ms 3184 KB Output is correct
11 Correct 439 ms 3212 KB Output is correct
12 Correct 503 ms 2852 KB Output is correct
13 Correct 519 ms 2720 KB Output is correct
14 Correct 436 ms 2768 KB Output is correct
15 Correct 648 ms 3056 KB Output is correct
16 Correct 699 ms 3044 KB Output is correct
17 Correct 757 ms 2896 KB Output is correct
18 Correct 726 ms 3092 KB Output is correct
19 Correct 717 ms 2992 KB Output is correct
20 Correct 459 ms 3232 KB Output is correct
21 Correct 423 ms 3344 KB Output is correct
22 Correct 516 ms 3120 KB Output is correct
23 Correct 596 ms 3120 KB Output is correct
24 Correct 598 ms 2984 KB Output is correct
25 Correct 617 ms 3128 KB Output is correct
26 Correct 647 ms 2992 KB Output is correct
27 Correct 559 ms 3256 KB Output is correct
28 Correct 598 ms 3368 KB Output is correct
29 Correct 524 ms 3068 KB Output is correct
30 Correct 582 ms 3016 KB Output is correct
31 Correct 57 ms 1288 KB Output is correct
32 Correct 51 ms 1152 KB Output is correct
33 Correct 57 ms 1404 KB Output is correct
34 Correct 49 ms 1288 KB Output is correct
35 Correct 52 ms 1288 KB Output is correct
36 Correct 55 ms 1152 KB Output is correct
37 Correct 43 ms 1152 KB Output is correct
38 Correct 47 ms 1244 KB Output is correct
39 Correct 47 ms 1408 KB Output is correct
40 Correct 53 ms 1280 KB Output is correct
41 Incorrect 56 ms 1292 KB Output isn't correct
42 Halted 0 ms 0 KB -