oj.uz

답안 #674255

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674255 2022-12-23T14:41:13 Z vjudge1 사육제 (CEOI14_carnival) C++17
100 / 100
 10 ms 324 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
const int mod=1e9+7, maxn=1e5+5;
int n, c[maxn], x, ki, ka, mid, res;
vector<int> v;
bool baru[maxn];

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n;
	v.pb(1);
	c[1]=1;
	for(int i=2; i<=n; i++) {
		cout << v.size()+1 << ' ';
		for(auto x:v) cout << x << ' ';
		cout << i << endl;
		cin >> x;
		if(x>v.size()) baru[i]=true, v.pb(i), c[i]=v.size();
	}
	for(int i=2; i<=n; i++) {
		if(baru[i]) continue;
		ki=0, ka=v.size()-1;
		while(ki<=ka) {
			mid=(ki+ka)/2;
			cout << mid+2 << ' ';
			for(int i=0; i<=mid; i++) cout << v[i] << ' ';
			cout << i << endl;
			cin >> x;
			if(x==mid+2) ki=mid+1;
			else res=mid, ka=mid-1;
		}
		c[i]=c[v[res]];
	}
	cout << "0 ";
	for(int i=1; i<=n; i++) cout << c[i] << ' ';
	cout << endl;
}

Compilation message

carnival.cpp: In function 'int main()':
carnival.cpp:24:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |   if(x>v.size()) baru[i]=true, v.pb(i), c[i]=v.size();
      |      ~^~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 208 KB Output is correct
2 Correct 5 ms 208 KB Output is correct
3 Correct 10 ms 276 KB Output is correct
4 Correct 3 ms 208 KB Output is correct
5 Correct 7 ms 208 KB Output is correct
6 Correct 7 ms 208 KB Output is correct
7 Correct 7 ms 224 KB Output is correct

Subtask #4
20.0 / 20.0

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

Subtask #5
20.0 / 20.0

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