oj.uz

답안 #108538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108538 2019-04-30T06:58:06 Z E869120 Amusement Park (JOI17_amusement_park) C++14
83 / 100
 1151 ms 4280 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>
#include <ctime>
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) {
	srand((unsigned)time(NULL));
	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, cntv = 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; }
		}
		if (cntv + (E.size() - 1) > 120 && T == 5) {
			if (rand() % 2 == 0) rem += (1LL << id);
		}
		else {
			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];
			cntv += (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:32: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:41: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:87:22: 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 51 ms 1280 KB Output is correct
2 Correct 49 ms 1280 KB Output is correct
3 Correct 51 ms 1496 KB Output is correct
4 Correct 44 ms 1152 KB Output is correct
5 Correct 52 ms 1372 KB Output is correct
6 Correct 47 ms 1288 KB Output is correct
7 Correct 54 ms 1264 KB Output is correct
8 Correct 54 ms 1292 KB Output is correct
9 Correct 53 ms 1524 KB Output is correct
10 Correct 44 ms 1236 KB Output is correct
11 Correct 65 ms 1648 KB Output is correct
12 Correct 45 ms 1152 KB Output is correct
13 Correct 49 ms 1284 KB Output is correct
14 Correct 54 ms 1292 KB Output is correct
15 Correct 58 ms 1412 KB Output is correct
16 Correct 67 ms 1552 KB Output is correct
17 Correct 56 ms 1292 KB Output is correct
18 Correct 55 ms 1292 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 995 ms 4180 KB Output is correct
2 Correct 921 ms 4280 KB Output is correct
3 Correct 957 ms 4276 KB Output is correct
4 Correct 804 ms 2980 KB Output is correct
5 Correct 905 ms 3252 KB Output is correct
6 Correct 804 ms 3076 KB Output is correct
7 Correct 814 ms 3084 KB Output is correct
8 Correct 844 ms 3132 KB Output is correct
9 Correct 838 ms 3124 KB Output is correct
10 Correct 448 ms 3048 KB Output is correct
11 Correct 401 ms 3080 KB Output is correct
12 Correct 417 ms 2768 KB Output is correct
13 Correct 523 ms 2780 KB Output is correct
14 Correct 524 ms 2872 KB Output is correct
15 Correct 713 ms 2936 KB Output is correct
16 Correct 618 ms 2952 KB Output is correct
17 Correct 701 ms 3016 KB Output is correct
18 Correct 736 ms 2984 KB Output is correct
19 Correct 865 ms 3000 KB Output is correct
20 Correct 469 ms 3200 KB Output is correct
21 Correct 468 ms 3220 KB Output is correct
22 Correct 567 ms 3024 KB Output is correct
23 Correct 566 ms 3120 KB Output is correct
24 Correct 578 ms 3044 KB Output is correct
25 Correct 605 ms 3120 KB Output is correct
26 Correct 605 ms 3176 KB Output is correct
27 Correct 606 ms 3236 KB Output is correct
28 Correct 611 ms 3436 KB Output is correct
29 Correct 523 ms 2984 KB Output is correct
30 Correct 485 ms 2960 KB Output is correct
31 Correct 49 ms 1152 KB Output is correct
32 Correct 52 ms 1152 KB Output is correct
33 Correct 50 ms 1412 KB Output is correct
34 Correct 49 ms 1152 KB Output is correct
35 Correct 45 ms 1152 KB Output is correct
36 Correct 53 ms 1244 KB Output is correct
37 Correct 47 ms 1152 KB Output is correct
38 Correct 49 ms 1152 KB Output is correct
39 Correct 46 ms 1288 KB Output is correct
40 Correct 53 ms 1280 KB Output is correct
41 Correct 69 ms 1248 KB Output is correct
42 Correct 45 ms 1244 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 1288 KB Output is correct
2 Correct 50 ms 1152 KB Output is correct
3 Correct 48 ms 1152 KB Output is correct
4 Correct 95 ms 1664 KB Output is correct
5 Correct 99 ms 1692 KB Output is correct
6 Correct 98 ms 1592 KB Output is correct
7 Correct 98 ms 1688 KB Output is correct
8 Correct 96 ms 1700 KB Output is correct
9 Correct 538 ms 3448 KB Output is correct
10 Correct 603 ms 3528 KB Output is correct
11 Correct 583 ms 3548 KB Output is correct
12 Correct 49 ms 1152 KB Output is correct
13 Correct 50 ms 1272 KB Output is correct
14 Correct 52 ms 1244 KB Output is correct
15 Correct 53 ms 1152 KB Output is correct

Subtask #4
55.0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1126 ms 4212 KB Output is correct
2 Correct 984 ms 4176 KB Output is correct
3 Correct 1083 ms 4140 KB Output is correct
4 Correct 749 ms 2916 KB Output is correct
5 Correct 986 ms 3236 KB Output is correct
6 Correct 740 ms 3304 KB Output is correct
7 Correct 787 ms 3012 KB Output is correct
8 Correct 758 ms 2964 KB Output is correct
9 Correct 763 ms 2980 KB Output is correct
10 Correct 448 ms 3032 KB Output is correct
11 Correct 419 ms 3180 KB Output is correct
12 Correct 432 ms 2784 KB Output is correct
13 Correct 448 ms 2592 KB Output is correct
14 Correct 519 ms 2740 KB Output is correct
15 Correct 747 ms 2780 KB Output is correct
16 Correct 686 ms 2864 KB Output is correct
17 Correct 781 ms 2908 KB Output is correct
18 Correct 675 ms 2944 KB Output is correct
19 Correct 744 ms 2992 KB Output is correct
20 Correct 463 ms 3172 KB Output is correct
21 Correct 499 ms 3244 KB Output is correct
22 Correct 599 ms 3188 KB Output is correct
23 Correct 544 ms 3156 KB Output is correct
24 Correct 567 ms 3204 KB Output is correct
25 Correct 612 ms 3176 KB Output is correct
26 Correct 681 ms 3160 KB Output is correct
27 Correct 578 ms 3124 KB Output is correct
28 Correct 658 ms 3032 KB Output is correct
29 Correct 554 ms 2924 KB Output is correct
30 Correct 554 ms 2972 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 986 ms 4144 KB Output is correct
2 Correct 1046 ms 4200 KB Output is correct
3 Correct 1151 ms 4064 KB Output is correct
4 Correct 710 ms 2932 KB Output is correct
5 Correct 942 ms 3512 KB Output is correct
6 Correct 854 ms 3100 KB Output is correct
7 Correct 806 ms 3104 KB Output is correct
8 Correct 768 ms 3116 KB Output is correct
9 Correct 744 ms 3160 KB Output is correct
10 Correct 439 ms 2980 KB Output is correct
11 Correct 483 ms 3036 KB Output is correct
12 Correct 464 ms 2784 KB Output is correct
13 Correct 585 ms 2792 KB Output is correct
14 Correct 592 ms 2828 KB Output is correct
15 Correct 769 ms 2884 KB Output is correct
16 Correct 763 ms 2936 KB Output is correct
17 Correct 709 ms 2912 KB Output is correct
18 Correct 765 ms 2772 KB Output is correct
19 Correct 717 ms 2992 KB Output is correct
20 Correct 449 ms 3220 KB Output is correct
21 Correct 461 ms 3164 KB Output is correct
22 Correct 617 ms 3084 KB Output is correct
23 Correct 670 ms 3072 KB Output is correct
24 Correct 505 ms 3048 KB Output is correct
25 Correct 696 ms 3116 KB Output is correct
26 Correct 559 ms 3056 KB Output is correct
27 Correct 550 ms 3220 KB Output is correct
28 Correct 632 ms 3132 KB Output is correct
29 Correct 564 ms 2944 KB Output is correct
30 Correct 564 ms 3112 KB Output is correct
31 Correct 48 ms 1252 KB Output is correct
32 Correct 50 ms 1280 KB Output is correct
33 Correct 52 ms 1468 KB Output is correct
34 Correct 70 ms 1152 KB Output is correct
35 Correct 49 ms 1260 KB Output is correct
36 Correct 51 ms 1364 KB Output is correct
37 Correct 48 ms 1236 KB Output is correct
38 Correct 51 ms 1152 KB Output is correct
39 Correct 48 ms 1280 KB Output is correct
40 Correct 54 ms 1388 KB Output is correct
41 Incorrect 48 ms 1236 KB Wrong Answer [7]
42 Halted 0 ms 0 KB -