oj.uz

Submission #36409

# Submission time Handle Problem Language Result Execution time Memory
36409 2017-12-08T17:28:27 Z mohammad_kilani Carnival (CEOI14_carnival) C++14
100 / 100
 43 ms 3188 KB 
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define oo 2000000000
const int N = 300010;
int num[N];

int ask(int l,int r){
	if(r == l) return 1;
	printf("%d",r-l+1);
	for(int i=l;i<=r;i++) printf(" %d",i);
	puts("");
	fflush(stdout);
	int res ;
	scanf("%d",&res);
	return res;
}
 
int main() {
	//freopen("in.txt","r",stdin);
	int n , cnt = 1;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		if(num[i] == 0){
			num[i] = cnt++;
		}
		int low = i + 1, high = n , res = i;
		while(high >= low){
			int mid = (low + high) / 2;
			int cur = ask(i,mid);
			int cur2 = ask(i+1,mid);
			if(cur == cur2){
				res = mid;
				high = mid - 1;
			}
			else{
				low = mid + 1;
			}
		}
		num[res] = num[i];
	}
	putchar('0');
	for(int i=1;i<=n;i++) printf(" %d",num[i]);
	puts("");
	return 0;
}

Compilation message

carnival.cpp: In function 'int ask(int, int)':
carnival.cpp:15:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&res);
                  ^
carnival.cpp: In function 'int main()':
carnival.cpp:22:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 3188 KB Output is correct
2 Correct 19 ms 3188 KB Output is correct
3 Correct 9 ms 3188 KB Output is correct
4 Correct 16 ms 3188 KB Output is correct
5 Correct 3 ms 3188 KB Output is correct
6 Correct 26 ms 3188 KB Output is correct
7 Correct 13 ms 3188 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
20.0 / 20.0

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

Subtask #5
20.0 / 20.0

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