oj.uz

Submission #860949

# Submission time Handle Problem Language Result Execution time Memory
860949 2023-10-14T22:03:30 Z BlancaHM Carnival (CEOI14_carnival) C++14
20 / 100
 67 ms 596 KB 
#include <iostream>
#include <vector>
#include <map>
#include <unordered_set>
#include <set>
#include <algorithm>
using namespace std;

vector<int> resolver(int N) {
	vector<vector<int>> mismoDisfraz = vector<vector<int>>(N, vector<int>(N, 0));
	int respuesta;
	for (int i = 0; i < N; i++) {
		for (int j = i+1; j < N; j++) {
			cout << "2 " << i+1 << ' ' << j+1 << '\n';
			cin >> respuesta;
			mismoDisfraz[i][j] = mismoDisfraz[j][i] = 2-respuesta;
		}
	}
	vector<int> disfraces(N, 0);
	int disfracesDescubiertos = 0;
	for (int j = 0; j < N; j++) {
		for (int i = 0; i < j; i++) {
			if (mismoDisfraz[i][j]) {
				disfraces[j] = disfraces[i];
			}
		}
		if (disfraces[j] == 0) {
			disfracesDescubiertos++;
			disfraces[j] = disfracesDescubiertos;
		}
	}
	return disfraces;
}

int main() {
	int N;
	cin >> N;
	vector<int> disfraces = resolver(N);
	cout << '0';
	for (int & disfraz: disfraces) {
		cout << ' ' << disfraz;
	}
	cout << '\n';
	return 0;
}

Subtask #1
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 35 ms 344 KB Partially correct
2 Partially correct 46 ms 344 KB Partially correct
3 Partially correct 45 ms 344 KB Partially correct
4 Partially correct 43 ms 344 KB Partially correct
5 Partially correct 39 ms 344 KB Partially correct
6 Partially correct 42 ms 344 KB Partially correct
7 Partially correct 42 ms 344 KB Partially correct

Subtask #2
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 47 ms 344 KB Partially correct
2 Partially correct 55 ms 344 KB Partially correct
3 Partially correct 30 ms 344 KB Partially correct
4 Partially correct 62 ms 344 KB Partially correct
5 Partially correct 42 ms 344 KB Partially correct
6 Partially correct 47 ms 344 KB Partially correct
7 Partially correct 51 ms 344 KB Partially correct

Subtask #3
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 36 ms 596 KB Partially correct
2 Partially correct 39 ms 344 KB Partially correct
3 Partially correct 42 ms 344 KB Partially correct
4 Partially correct 50 ms 344 KB Partially correct
5 Partially correct 53 ms 344 KB Partially correct
6 Partially correct 59 ms 344 KB Partially correct
7 Partially correct 45 ms 344 KB Partially correct

Subtask #4
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 49 ms 344 KB Partially correct
2 Partially correct 43 ms 340 KB Partially correct
3 Partially correct 54 ms 340 KB Partially correct
4 Partially correct 49 ms 344 KB Partially correct
5 Partially correct 44 ms 344 KB Partially correct
6 Partially correct 52 ms 344 KB Partially correct
7 Partially correct 49 ms 344 KB Partially correct

Subtask #5
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 42 ms 340 KB Partially correct
2 Partially correct 48 ms 340 KB Partially correct
3 Partially correct 54 ms 344 KB Partially correct
4 Partially correct 67 ms 344 KB Partially correct
5 Partially correct 46 ms 344 KB Partially correct
6 Partially correct 42 ms 344 KB Partially correct
7 Partially correct 43 ms 344 KB Partially correct