oj.uz

답안 #1084334

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

int odp[152];
int dif[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);
	vec.push_back(ind);
	int query=zap(vec);

	if (query==(dif[md]-dif[l-1]))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;
	dif[1]=1;
	int spoj=1;
	vector<int> vec;
	vec.push_back(1);
	for (int i = 2; i<=n; i++){
		vec.push_back(i);
		dif[i]=zap(vec);
		if (dif[i]>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
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 600 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Incorrect 5 ms 344 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 600 KB Output is correct
2 Incorrect 6 ms 600 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 344 KB Output is correct
2 Incorrect 5 ms 456 KB Incorrect
3 Halted 0 ms 0 KB -