oj.uz

답안 #534633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
534633 2022-03-08T12:17:22 Z shrimb 사육제 (CEOI14_carnival) C++17
20 / 100
 159 ms 576 KB 
#include"bits/stdc++.h"
#define int long long
// #define endl '\n'
using namespace std;

int dsu[20001];
int ans[20001];

int Find (int x) {
	return dsu[x] == x ? x : dsu[x] = Find(dsu[x]);
}

void Union (int a, int b) {
	dsu[Find(a)] = Find(b);
}

int asked[151][151];
bool Query (int a, int b) {
	if (asked[a][b] != -1) return asked[a][b];
	cout << "2 " << a << " " << b << endl;
	int x;
	cin >> x;
	return asked[a][b] = asked[b][a] = x == 1;
}
bitset<151> vis;


signed main () {
	srand(time(0));
	memset(asked, -1, sizeof asked);
	int n;
	cin >> n;
	for (int i = 1 ; i <= n ; i++) dsu[i] = i;
	for (int i = 1 ; i <= n ; i++) {
		vis = 0;
		vis[i] = 1;
		for (int j = 0 ; j < n ; j++) {
			int x = rand() % n + 1;
			if (vis[x]) {j-=(vis.count() < n); continue;}
			else {
				vis[x] = 1;
				if (Query(i, x)) Union(i, x);
			}
		}
	}

	int c = 1;
	for (int i = 1 ; i <= n ; i++) if (dsu[i] == i) ans[i] = c++;
	cout << 0 << " ";
	for (int i = 1 ; i <= n ; i++) cout << ans[Find(i)] << " ";
	cout << endl;
}

Compilation message

carnival.cpp: In function 'bool Query(long long int, long long int)':
carnival.cpp:23:21: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   23 |  return asked[a][b] = asked[b][a] = x == 1;
      |         ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
carnival.cpp: In function 'int main()':
carnival.cpp:39:33: warning: comparison of integer expressions of different signedness: 'std::size_t' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   39 |    if (vis[x]) {j-=(vis.count() < n); continue;}
      |                     ~~~~~~~~~~~~^~~

Subtask #1
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 87 ms 468 KB Partially correct
2 Partially correct 96 ms 456 KB Partially correct
3 Partially correct 95 ms 460 KB Partially correct
4 Partially correct 90 ms 456 KB Partially correct
5 Partially correct 118 ms 456 KB Partially correct
6 Partially correct 69 ms 456 KB Partially correct
7 Partially correct 83 ms 460 KB Partially correct

Subtask #2
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 101 ms 464 KB Partially correct
2 Partially correct 106 ms 460 KB Partially correct
3 Partially correct 52 ms 460 KB Partially correct
4 Partially correct 79 ms 460 KB Partially correct
5 Partially correct 114 ms 460 KB Partially correct
6 Partially correct 86 ms 456 KB Partially correct
7 Partially correct 105 ms 456 KB Partially correct

Subtask #3
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 100 ms 456 KB Partially correct
2 Partially correct 92 ms 460 KB Partially correct
3 Partially correct 102 ms 460 KB Partially correct
4 Partially correct 85 ms 468 KB Partially correct
5 Partially correct 108 ms 456 KB Partially correct
6 Partially correct 106 ms 456 KB Partially correct
7 Partially correct 87 ms 460 KB Partially correct

Subtask #4
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 69 ms 464 KB Partially correct
2 Partially correct 105 ms 456 KB Partially correct
3 Partially correct 98 ms 576 KB Partially correct
4 Partially correct 121 ms 460 KB Partially correct
5 Partially correct 96 ms 456 KB Partially correct
6 Partially correct 134 ms 456 KB Partially correct
7 Partially correct 116 ms 460 KB Partially correct

Subtask #5
4.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 47 ms 464 KB Partially correct
2 Partially correct 67 ms 464 KB Partially correct
3 Partially correct 103 ms 460 KB Partially correct
4 Partially correct 94 ms 456 KB Partially correct
5 Partially correct 84 ms 456 KB Partially correct
6 Partially correct 159 ms 460 KB Partially correct
7 Partially correct 91 ms 468 KB Partially correct