oj.uz

Submission #108534

# Submission time Handle Problem Language Result Execution time Memory
108534 2019-04-30T06:48:09 Z E869120 Amusement Park (JOI17_amusement_park) C++14
82 / 100
 1119 ms 4264 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 = 2285;
	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 = 2285;
	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 56 ms 1152 KB Output is correct
2 Correct 50 ms 1264 KB Output is correct
3 Correct 51 ms 1296 KB Output is correct
4 Correct 51 ms 1416 KB Output is correct
5 Correct 55 ms 1344 KB Output is correct
6 Correct 60 ms 1388 KB Output is correct
7 Correct 52 ms 1340 KB Output is correct
8 Correct 50 ms 1380 KB Output is correct
9 Correct 56 ms 1260 KB Output is correct
10 Correct 52 ms 1332 KB Output is correct
11 Correct 76 ms 1556 KB Output is correct
12 Correct 55 ms 1244 KB Output is correct
13 Correct 53 ms 1360 KB Output is correct
14 Correct 49 ms 1292 KB Output is correct
15 Correct 54 ms 1352 KB Output is correct
16 Correct 56 ms 1396 KB Output is correct
17 Correct 51 ms 1396 KB Output is correct
18 Correct 49 ms 1480 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1052 ms 4168 KB Output is correct
2 Correct 978 ms 4040 KB Output is correct
3 Correct 949 ms 4140 KB Output is correct
4 Correct 659 ms 2936 KB Output is correct
5 Correct 895 ms 3232 KB Output is correct
6 Correct 836 ms 2984 KB Output is correct
7 Correct 780 ms 3320 KB Output is correct
8 Correct 798 ms 3140 KB Output is correct
9 Correct 741 ms 3108 KB Output is correct
10 Correct 397 ms 2964 KB Output is correct
11 Correct 412 ms 2960 KB Output is correct
12 Correct 439 ms 2736 KB Output is correct
13 Correct 521 ms 2732 KB Output is correct
14 Correct 554 ms 2896 KB Output is correct
15 Correct 653 ms 2876 KB Output is correct
16 Correct 665 ms 2764 KB Output is correct
17 Correct 637 ms 2984 KB Output is correct
18 Correct 649 ms 2852 KB Output is correct
19 Correct 662 ms 2972 KB Output is correct
20 Correct 544 ms 3080 KB Output is correct
21 Correct 506 ms 3260 KB Output is correct
22 Correct 575 ms 3060 KB Output is correct
23 Correct 539 ms 3008 KB Output is correct
24 Correct 554 ms 2984 KB Output is correct
25 Correct 573 ms 3088 KB Output is correct
26 Correct 612 ms 3184 KB Output is correct
27 Correct 618 ms 3168 KB Output is correct
28 Correct 601 ms 3204 KB Output is correct
29 Correct 563 ms 2936 KB Output is correct
30 Correct 573 ms 2960 KB Output is correct
31 Correct 49 ms 1152 KB Output is correct
32 Correct 49 ms 1152 KB Output is correct
33 Correct 52 ms 1320 KB Output is correct
34 Correct 48 ms 1144 KB Output is correct
35 Correct 47 ms 1148 KB Output is correct
36 Correct 48 ms 1236 KB Output is correct
37 Correct 52 ms 1152 KB Output is correct
38 Correct 42 ms 1152 KB Output is correct
39 Correct 44 ms 1280 KB Output is correct
40 Correct 43 ms 1164 KB Output is correct
41 Correct 41 ms 1152 KB Output is correct
42 Correct 55 ms 1280 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1152 KB Output is correct
2 Correct 50 ms 1144 KB Output is correct
3 Correct 45 ms 1152 KB Output is correct
4 Correct 87 ms 1684 KB Output is correct
5 Correct 98 ms 1808 KB Output is correct
6 Correct 102 ms 1548 KB Output is correct
7 Correct 97 ms 1556 KB Output is correct
8 Correct 94 ms 1772 KB Output is correct
9 Correct 507 ms 3508 KB Output is correct
10 Correct 670 ms 3600 KB Output is correct
11 Correct 637 ms 3436 KB Output is correct
12 Correct 47 ms 1312 KB Output is correct
13 Correct 44 ms 1144 KB Output is correct
14 Correct 44 ms 1144 KB Output is correct
15 Correct 48 ms 1152 KB Output is correct

Subtask #4
54.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 994 ms 4144 KB Output is correct
2 Correct 1010 ms 4128 KB Output is correct
3 Correct 1035 ms 4264 KB Output is correct
4 Correct 724 ms 2944 KB Output is correct
5 Correct 891 ms 3224 KB Output is correct
6 Correct 793 ms 3100 KB Output is correct
7 Correct 859 ms 3188 KB Output is correct
8 Correct 832 ms 3020 KB Output is correct
9 Correct 790 ms 3060 KB Output is correct
10 Correct 445 ms 2968 KB Output is correct
11 Correct 471 ms 3040 KB Output is correct
12 Correct 519 ms 2696 KB Output is correct
13 Correct 606 ms 2812 KB Output is correct
14 Correct 595 ms 2832 KB Output is correct
15 Partially correct 558 ms 2916 KB Partially correct
16 Correct 732 ms 2852 KB Output is correct
17 Correct 690 ms 2936 KB Output is correct
18 Correct 724 ms 2820 KB Output is correct
19 Correct 710 ms 2896 KB Output is correct
20 Correct 435 ms 3164 KB Output is correct
21 Correct 446 ms 3148 KB Output is correct
22 Correct 644 ms 3200 KB Output is correct
23 Correct 658 ms 3080 KB Output is correct
24 Correct 619 ms 3004 KB Output is correct
25 Correct 623 ms 3184 KB Output is correct
26 Correct 590 ms 3100 KB Output is correct
27 Correct 649 ms 3152 KB Output is correct
28 Correct 605 ms 3060 KB Output is correct
29 Correct 524 ms 2916 KB Output is correct
30 Correct 563 ms 3052 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1029 ms 4048 KB Output is correct
2 Correct 1119 ms 4240 KB Output is correct
3 Correct 1051 ms 4136 KB Output is correct
4 Correct 685 ms 2908 KB Output is correct
5 Correct 890 ms 3488 KB Output is correct
6 Correct 731 ms 3064 KB Output is correct
7 Correct 786 ms 3068 KB Output is correct
8 Correct 739 ms 3016 KB Output is correct
9 Correct 765 ms 3108 KB Output is correct
10 Correct 497 ms 2968 KB Output is correct
11 Correct 396 ms 3020 KB Output is correct
12 Correct 448 ms 2772 KB Output is correct
13 Incorrect 438 ms 2704 KB Output isn't correct
14 Halted 0 ms 0 KB -