oj.uz

Submission #957829

# Submission time Handle Problem Language Result Execution time Memory
957829 2024-04-04T11:20:26 Z oolimry Koala Game (APIO17_koala) C++17
19 / 100
 132 ms 600 KB 
#include "koala.h"
#include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int) x.size())
using namespace std;

int B[100]; int R[100];
int minValue(int N, int W) {
	fill(B,B+N,0); B[0] = 1;
    playRound(B,R);
    for(int i = 0;i < N;i++){
        if(R[i] == 0) return i;
    }
}

int big[105];
int maxValue(int n, int W) {
	fill(big,big+n,1);
	vector<int> witness = {};
	for(int x : witness){
		for(int i = 0;i < n;i++){
			if(big[i]) B[i] = x;
			else B[i] = 0;
		}
		playRound(B,R);
		
	}
	
	for(int i = 0;i < n;i++) if(big[i]) return i;
	return 0;
}

int greaterValue(int n, int W){
	for(int x = 1;x < n;x++){
		B[0] = x;
		B[1] = x;
		playRound(B,R);
		
		if(R[0] > R[1]) return 0;
		if(R[1] > R[0]) return 1;
	}
	return -1;
}

void allValues1(int n, int W, int *P){
	int B[n]; int R[n]; int A[n];
	for(int i = 0;i < n;i++) A[i] = i;
	
	stable_sort(A, A+n, [&](int a, int b){
		fill(B,B+n,0);
		B[a] = n, B[b] = n;
		playRound(B,R);

		if(R[a] == 0) return true;
		else return false;
	});
	
	for(int i = 0;i < n;i++) P[A[i]] = i+1;
}

vector<int> precompX = {1,1,1,1,1,1,1,1,1,2,1,1,2,3,3,1,3,1,1,2,3,4,2,3,4,4,1,2,3,3,4,1,5,1,2,2,3,5,3,4,5,2,5,2,3,4,5,4,4,6,1,2,3,5,6,3,4,6,5,6,1,4,5,6,1,7,1,2,2,2,3,4,5,7,3,4,7,5,6,7,2,5,6,7,2,2,3,4,5,6,8,3,4,6,8,5,8,6,8};
int ptr = 0;

void allValues2(int n, int *P, int s, int e, vector<int> stuff){
	if(sz(stuff) == 1){
		P[stuff[0]] = s;
		return;
	}
	
	int X = precompX[ptr]; ptr++;
	fill(B,B+n,0);
	for(int i : stuff) B[i] = X;
	playRound(B,R);
	
	vector<int> left, right;
	for(int i : stuff){
		if(R[i] == 0) left.push_back(i);
		else right.push_back(i);
	}
	
	if(sz(left) != 0 and sz(right) != 0){
		cout << X << ",";
		int m = s + sz(left);
		allValues2(n, P, s, m-1, left);
		allValues2(n, P, m, e, right);
		return;
	}
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) allValues1(N, W, P);
    else{
		vector<int> stuff;
		for(int i = 0;i < N;i++) stuff.push_back(i);
		allValues2(N, P, 1, N, stuff);
	}
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:14:1: warning: control reaches end of non-void function [-Wreturn-type]
   14 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
5.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 117 ms 464 KB Output is partially correct
2 Partially correct 132 ms 452 KB Output is partially correct
3 Partially correct 115 ms 464 KB Output is partially correct
4 Partially correct 119 ms 464 KB Output is partially correct
5 Partially correct 115 ms 468 KB Output is partially correct
6 Partially correct 120 ms 600 KB Output is partially correct
7 Partially correct 114 ms 464 KB Output is partially correct
8 Partially correct 123 ms 460 KB Output is partially correct
9 Partially correct 120 ms 468 KB Output is partially correct
10 Partially correct 112 ms 464 KB Output is partially correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 344 KB Output is correct
2 Correct 28 ms 344 KB Output is correct
3 Correct 28 ms 600 KB Output is correct
4 Correct 27 ms 596 KB Output is correct
5 Correct 27 ms 344 KB Output is correct
6 Correct 27 ms 344 KB Output is correct
7 Correct 27 ms 344 KB Output is correct
8 Correct 28 ms 344 KB Output is correct
9 Correct 27 ms 344 KB Output is correct
10 Correct 26 ms 596 KB Output is correct
11 Correct 28 ms 344 KB Output is correct
12 Correct 12 ms 344 KB Output is correct
13 Correct 26 ms 452 KB Output is correct
14 Correct 24 ms 344 KB Output is correct
15 Correct 24 ms 428 KB Output is correct
16 Correct 25 ms 596 KB Output is correct
17 Correct 24 ms 344 KB Output is correct
18 Correct 24 ms 344 KB Output is correct
19 Correct 25 ms 452 KB Output is correct
20 Correct 25 ms 344 KB Output is correct

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -