oj.uz

Submission #25912

# Submission time Handle Problem Language Result Execution time Memory
25912 2017-06-25T05:50:58 Z 서규호(#1088) Carnival (CEOI14_carnival) C++14
84 / 100
 23 ms 2020 KB 
#include <bits/stdc++.h>

#define lld long long
#define pp pair<int,int>
#define pb push_back
#define MOD 1000000007
#define left lleft
#define right rright
#define INF 2000000000
#define Linf 1000000000000000000LL
#define next nnext
#define minus mminus

using namespace std;

int N;
int a[200];
bool check[200];

void query(int s,int e,int x){
	vector<int> tmp;
	for(int i=s; i<=e; i++) tmp.pb(i);
	tmp.pb(x);
	printf("%d ",tmp.size());
	for(auto &i : tmp) printf("%d ",i);
	fflush(stdout);
}

int get(int s,int e){
	int cnt = 0;
	for(int i=s; i<=e; i++){
		if(!check[a[i]]) cnt++;
		check[a[i]] = true;
	}
	for(int i=s; i<=e; i++){
		check[a[i]] = false;
	}
	return cnt;
}

int main(){
	scanf("%d",&N);
	int color = 1;
	a[1] = 1;
	for(int i=2; i<=N; i++){
		int tmp;
		query(1,i-1,i);
		scanf("%d",&tmp);
		if(tmp == get(1,i-1)+1){
			a[i] = ++color;
			continue;
		}
		for(int j=1; j<i; j++){
			query(j,j,i);
			scanf("%d",&tmp);
			if(tmp == 1){
				a[i] = a[j];
				break;
			}
		}
	}
	printf("0 ");
	for(int i=1; i<=N; i++) printf("%d ",a[i]);
	return 0;
}

Compilation message

carnival.cpp: In function 'void query(int, int, int)':
carnival.cpp:24:25: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
  printf("%d ",tmp.size());
                         ^
carnival.cpp: In function 'int main()':
carnival.cpp:42:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&N);
                ^
carnival.cpp:48:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&tmp);
                   ^
carnival.cpp:55:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&tmp);
                    ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2020 KB Output is correct
2 Correct 9 ms 2020 KB Output is correct
3 Correct 6 ms 2020 KB Output is correct
4 Correct 6 ms 2020 KB Output is correct
5 Correct 0 ms 2020 KB Output is correct
6 Correct 6 ms 2020 KB Output is correct
7 Correct 6 ms 2020 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 6 ms 2020 KB Output is correct
3 Correct 6 ms 2020 KB Output is correct
4 Correct 3 ms 2020 KB Output is correct
5 Correct 3 ms 2020 KB Output is correct
6 Correct 3 ms 2020 KB Output is correct
7 Correct 3 ms 2020 KB Output is correct

Subtask #3
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2020 KB Output is correct
2 Correct 6 ms 2020 KB Output is correct
3 Partially correct 16 ms 2020 KB Partially correct
4 Correct 6 ms 2020 KB Output is correct
5 Correct 3 ms 2020 KB Output is correct
6 Correct 3 ms 2020 KB Output is correct
7 Correct 19 ms 2020 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 2020 KB Output is correct
2 Correct 9 ms 2020 KB Output is correct
3 Correct 9 ms 2020 KB Output is correct
4 Correct 0 ms 2020 KB Output is correct
5 Correct 0 ms 2020 KB Output is correct
6 Correct 3 ms 2020 KB Output is correct
7 Correct 9 ms 2020 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2020 KB Output is correct
2 Correct 23 ms 2020 KB Output is correct
3 Correct 16 ms 2020 KB Output is correct
4 Correct 16 ms 2020 KB Output is correct
5 Correct 6 ms 2020 KB Output is correct
6 Correct 0 ms 2020 KB Output is correct
7 Correct 9 ms 2020 KB Output is correct