oj.uz

Submission #994934

# Submission time Handle Problem Language Result Execution time Memory
994934 2024-06-08T08:39:59 Z NintsiChkhaidze Library (JOI18_library) C++17
19 / 100
 267 ms 432 KB 
#include "library.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
int n;
 
void Solve(int N){
	n = N;
	
	vector<int> ans(N),fix(N),del(N);
	for(int i = 0; i < N; i++) {
		ans[i] = fix[i] = 0;
	}
	
	int cnt = 0;
	for (int i = 0; i < N; i++){
		vector <int> M(N);
		for (int j=0;j<N;j++){
			M[j] = 1;
		}
		
		M[i] = 0;
		int A;
		if (N == 1) A = 1;
		else A = Query(M);
		 
		if (A == 1){
			++cnt;
			fix[i] = 1;
			if (cnt == 1) {ans[0] = i; break;}
//			else {ans[N - 1] = i; break;}
		}
	}
	
	for (int i = 0; i + 1 < N; i++){
 
		int find = 0;
		for (int j = 0; j < 10; j++){
			vector <int> M(N);
			int ones=0,sul = 0;
			for (int w = 0; w < N; w++){
				M[w] = 0;
				if (fix[w]) M[w] = 0;
				else {
					++sul;
					int bt = ((w >> j) & 1);
					if (bt) M[w] = 1,++ones;
				}
			}
			
			if (ones == 0) continue;
			M[ans[i]] = 1;
		
			int A = Query(M);
			
			M[ans[i]] = 0;
			int B = 0;
			if (ones > 1 && ones < sul) B = Query(M);
			else B = 1;
			if (A == B) find |= (1<<j);
		}
		
		fix[find] = 1;
		ans[i + 1] = find;
	}
	
	for (int i=0;i<N;i++)
		ans[i] += 1;
	Answer(ans);
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 344 KB # of queries: 3038
2 Correct 45 ms 344 KB # of queries: 3055
3 Correct 34 ms 344 KB # of queries: 3287
4 Correct 35 ms 344 KB # of queries: 3239
5 Correct 28 ms 344 KB # of queries: 3145
6 Correct 24 ms 344 KB # of queries: 3200
7 Correct 35 ms 344 KB # of queries: 3208
8 Correct 27 ms 344 KB # of queries: 3061
9 Correct 33 ms 344 KB # of queries: 3181
10 Correct 10 ms 344 KB # of queries: 1920
11 Correct 0 ms 340 KB # of queries: 0
12 Correct 0 ms 344 KB # of queries: 2
13 Correct 0 ms 344 KB # of queries: 4
14 Correct 0 ms 344 KB # of queries: 9
15 Correct 1 ms 344 KB # of queries: 95
16 Correct 2 ms 344 KB # of queries: 256

Subtask #2
0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 344 KB # of queries: 3038
2 Correct 45 ms 344 KB # of queries: 3055
3 Correct 34 ms 344 KB # of queries: 3287
4 Correct 35 ms 344 KB # of queries: 3239
5 Correct 28 ms 344 KB # of queries: 3145
6 Correct 24 ms 344 KB # of queries: 3200
7 Correct 35 ms 344 KB # of queries: 3208
8 Correct 27 ms 344 KB # of queries: 3061
9 Correct 33 ms 344 KB # of queries: 3181
10 Correct 10 ms 344 KB # of queries: 1920
11 Correct 0 ms 340 KB # of queries: 0
12 Correct 0 ms 344 KB # of queries: 2
13 Correct 0 ms 344 KB # of queries: 4
14 Correct 0 ms 344 KB # of queries: 9
15 Correct 1 ms 344 KB # of queries: 95
16 Correct 2 ms 344 KB # of queries: 256
17 Runtime error 267 ms 432 KB Execution killed with signal 13
18 Halted 0 ms 0 KB -