oj.uz

답안 #1084335

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084335 2024-09-05T22:46:06 Z 4QT0R 사육제 (CEOI14_carnival) C++17
100 / 100
 13 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;

int odp[152];

int zap(vector<int> vec){
	cout << vec.size();
	for (auto u : vec)cout << ' ' << u;
	cout << endl;
	int wynik;
	cin >> wynik;
	return wynik; 
}

int comm(int l, int r, int ind){
	if (l==r)return l;
	int md=(l+r)/2;

	vector<int> vec;
	for (int j = l; j<=md; j++)vec.push_back(j);
	int query1=zap(vec);
	vec.push_back(ind);
	int query2=zap(vec);

	if (query1==query2)return comm(l,md,ind);
	else return comm(md+1,r,ind);
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;
	odp[1]=1;
	int spoj=1;
	vector<int> vec;
	vec.push_back(1);
	for (int i = 2; i<=n; i++){
		vec.push_back(i);
		int q=zap(vec);
		if (q>spoj){
			odp[i]=++spoj;
			continue;
		}
		odp[i]=odp[comm(1,i-1,i)];
	}
	cout << "0 ";
	for (int i = 1; i<=n; i++)cout << odp[i] << ' ';
	cout << endl;
	return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 11 ms 456 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 13 ms 344 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 10 ms 604 KB Output is correct
3 Correct 3 ms 456 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 10 ms 600 KB Output is correct
6 Correct 9 ms 460 KB Output is correct
7 Correct 9 ms 456 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 9 ms 452 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 7 ms 600 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 10 ms 600 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 9 ms 456 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 11 ms 600 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct