oj.uz

Submission #1054359

# Submission time Handle Problem Language Result Execution time Memory
1054359 2024-08-12T09:07:41 Z 김은성(#11056) Koala Game (APIO17_koala) C++14
11 / 100
 75 ms 476 KB 
#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

int minValue(int N, int W) {
	/*int b[100], r[100];
	int i;
	for(i=0; i<N-1; i++)
		b[i] = 0;
	b[N-1] = 1;
	playRound(b, r);
	for(i=0; i<N-1; i++){
		if(r[i] == 0)
			return i;
	}*/
	return N-1;
}

int maxValue(int N, int W) {
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

int greaterValue(int N, int W) {
    int lo = 1, hi = 31, mid, i;
	int b[100], r[100];
	while(lo <= hi){
		mid = (lo+hi)/2;
		for(i=0; i<N; i++)
			b[i] = 0;
		b[0] = b[1] = mid;
		playRound(b, r);
		bool ch0 = (r[0] > mid), ch1 = (r[1] > mid);
		//printf("mid=%d ch0=%d ch1=%d\n", mid, ch0, ch1);
		if(ch0 && ch1)
			lo = mid+1;
		else if(!ch0 && !ch1)
			hi = mid-1;
		else{
			if(ch0)
				return 0;
			else
				return 1;
		}
	}
	assert(0);
    return 0;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    } else {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}

Subtask #1
0 / 4.0

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

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
11.0 / 18.0

# Verdict Execution time Memory Grader output
1 Partially correct 46 ms 476 KB Output is partially correct
2 Partially correct 48 ms 340 KB Output is partially correct
3 Partially correct 50 ms 344 KB Output is partially correct
4 Partially correct 50 ms 344 KB Output is partially correct
5 Partially correct 74 ms 452 KB Output is partially correct
6 Partially correct 46 ms 468 KB Output is partially correct
7 Partially correct 50 ms 464 KB Output is partially correct
8 Partially correct 75 ms 344 KB Output is partially correct
9 Partially correct 48 ms 344 KB Output is partially correct
10 Partially correct 47 ms 472 KB Output is partially correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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