oj.uz

Submission #36398

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

int main() {
	//freopen("in.txt","r",stdin);
	int n , cnt = 1;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		if(num[i]) continue;
		num[i] = cnt;
		for(int j=i+1;j<=n;j++){
			if(num[j]) continue;
			printf("2 %d %d\n",i,j);
			fflush(stdout);
			int a;
			scanf("%d",&a);
			if(a == 1) num[j] = cnt;
		}
		cnt++;
	}
	putchar('0');
	for(int i=1;i<=n;i++) printf(" %d",num[i]);
	puts("");
	return 0;
}

Compilation message

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

Subtask #1
4.0 / 20.0

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

Subtask #2
4.0 / 20.0

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

Subtask #3
4.0 / 20.0

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

Subtask #4
4.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3188 KB Output is correct
2 Correct 0 ms 3188 KB Output is correct
3 Partially correct 13 ms 3188 KB Partially correct
4 Partially correct 33 ms 3188 KB Partially correct
5 Correct 3 ms 3188 KB Output is correct
6 Correct 16 ms 3188 KB Output is correct
7 Correct 6 ms 3188 KB Output is correct

Subtask #5
4.0 / 20.0

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