oj.uz

Submission #108526

# Submission time Handle Problem Language Result Execution time Memory
108526 2019-04-30T06:41:05 Z E869120 Amusement Park (JOI17_amusement_park) C++14
82 / 100
 1087 ms 4184 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 = 334;
	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 = 334;
	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 1260 KB Output is correct
2 Correct 46 ms 1396 KB Output is correct
3 Correct 48 ms 1316 KB Output is correct
4 Correct 50 ms 1364 KB Output is correct
5 Correct 49 ms 1236 KB Output is correct
6 Correct 56 ms 1356 KB Output is correct
7 Correct 50 ms 1320 KB Output is correct
8 Correct 47 ms 1412 KB Output is correct
9 Correct 45 ms 1284 KB Output is correct
10 Correct 49 ms 1264 KB Output is correct
11 Correct 65 ms 1516 KB Output is correct
12 Correct 44 ms 1152 KB Output is correct
13 Correct 49 ms 1412 KB Output is correct
14 Correct 50 ms 1308 KB Output is correct
15 Correct 51 ms 1376 KB Output is correct
16 Correct 53 ms 1488 KB Output is correct
17 Correct 53 ms 1344 KB Output is correct
18 Correct 53 ms 1384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1052 ms 4052 KB Output is correct
2 Correct 1039 ms 4184 KB Output is correct
3 Correct 1057 ms 4060 KB Output is correct
4 Correct 761 ms 2904 KB Output is correct
5 Correct 990 ms 3220 KB Output is correct
6 Correct 841 ms 3256 KB Output is correct
7 Correct 848 ms 3048 KB Output is correct
8 Correct 858 ms 3332 KB Output is correct
9 Correct 909 ms 3184 KB Output is correct
10 Correct 471 ms 3016 KB Output is correct
11 Correct 488 ms 3100 KB Output is correct
12 Correct 523 ms 2752 KB Output is correct
13 Correct 518 ms 2796 KB Output is correct
14 Correct 441 ms 2832 KB Output is correct
15 Correct 637 ms 2844 KB Output is correct
16 Correct 606 ms 2972 KB Output is correct
17 Correct 725 ms 2932 KB Output is correct
18 Correct 761 ms 2940 KB Output is correct
19 Correct 734 ms 2936 KB Output is correct
20 Correct 482 ms 3228 KB Output is correct
21 Correct 429 ms 3248 KB Output is correct
22 Correct 610 ms 3044 KB Output is correct
23 Correct 671 ms 3200 KB Output is correct
24 Correct 608 ms 3108 KB Output is correct
25 Correct 574 ms 3028 KB Output is correct
26 Correct 607 ms 3088 KB Output is correct
27 Correct 597 ms 3012 KB Output is correct
28 Correct 677 ms 3020 KB Output is correct
29 Correct 529 ms 2976 KB Output is correct
30 Correct 558 ms 3068 KB Output is correct
31 Correct 53 ms 1152 KB Output is correct
32 Correct 50 ms 1272 KB Output is correct
33 Correct 65 ms 1380 KB Output is correct
34 Correct 49 ms 1244 KB Output is correct
35 Correct 52 ms 1408 KB Output is correct
36 Correct 51 ms 1152 KB Output is correct
37 Correct 57 ms 1144 KB Output is correct
38 Correct 55 ms 1152 KB Output is correct
39 Correct 44 ms 1152 KB Output is correct
40 Correct 54 ms 1152 KB Output is correct
41 Correct 55 ms 1416 KB Output is correct
42 Correct 46 ms 1236 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 1228 KB Output is correct
2 Correct 52 ms 1152 KB Output is correct
3 Correct 49 ms 1152 KB Output is correct
4 Correct 90 ms 1600 KB Output is correct
5 Correct 93 ms 1776 KB Output is correct
6 Correct 101 ms 1688 KB Output is correct
7 Correct 105 ms 1620 KB Output is correct
8 Correct 105 ms 1564 KB Output is correct
9 Correct 478 ms 3508 KB Output is correct
10 Correct 555 ms 3476 KB Output is correct
11 Correct 590 ms 3508 KB Output is correct
12 Correct 47 ms 1280 KB Output is correct
13 Correct 45 ms 1188 KB Output is correct
14 Correct 47 ms 1260 KB Output is correct
15 Correct 49 ms 1288 KB Output is correct

Subtask #4
54.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 952 ms 3944 KB Output is correct
2 Correct 1040 ms 4136 KB Output is correct
3 Correct 1058 ms 4136 KB Output is correct
4 Correct 740 ms 2936 KB Output is correct
5 Correct 963 ms 3232 KB Output is correct
6 Partially correct 819 ms 3172 KB Partially correct
7 Correct 746 ms 3268 KB Output is correct
8 Correct 867 ms 2980 KB Output is correct
9 Correct 946 ms 3028 KB Output is correct
10 Correct 375 ms 2844 KB Output is correct
11 Correct 460 ms 2960 KB Output is correct
12 Correct 465 ms 2840 KB Output is correct
13 Correct 455 ms 2804 KB Output is correct
14 Correct 607 ms 2824 KB Output is correct
15 Correct 752 ms 2928 KB Output is correct
16 Correct 623 ms 2768 KB Output is correct
17 Correct 704 ms 2860 KB Output is correct
18 Correct 735 ms 2992 KB Output is correct
19 Correct 755 ms 3004 KB Output is correct
20 Correct 496 ms 3316 KB Output is correct
21 Correct 552 ms 3184 KB Output is correct
22 Correct 632 ms 3120 KB Output is correct
23 Correct 565 ms 3160 KB Output is correct
24 Correct 546 ms 3052 KB Output is correct
25 Correct 598 ms 3004 KB Output is correct
26 Correct 574 ms 3120 KB Output is correct
27 Correct 560 ms 3168 KB Output is correct
28 Correct 626 ms 3108 KB Output is correct
29 Correct 509 ms 2996 KB Output is correct
30 Correct 544 ms 3116 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 979 ms 4172 KB Output is correct
2 Correct 1044 ms 4136 KB Output is correct
3 Correct 1087 ms 4184 KB Output is correct
4 Correct 774 ms 2908 KB Output is correct
5 Correct 953 ms 3272 KB Output is correct
6 Correct 736 ms 3104 KB Output is correct
7 Correct 829 ms 3060 KB Output is correct
8 Correct 870 ms 3076 KB Output is correct
9 Correct 828 ms 3164 KB Output is correct
10 Correct 401 ms 3004 KB Output is correct
11 Correct 469 ms 3064 KB Output is correct
12 Correct 537 ms 2688 KB Output is correct
13 Incorrect 464 ms 2772 KB Output isn't correct
14 Halted 0 ms 0 KB -