제출 #108352

#제출 시각아이디문제언어결과실행 시간메모리
108352RezwanArefin01코알라 (APIO17_koala)C++17
4 / 100
57 ms512 KiB
#include <bits/stdc++.h>
#include "koala.h"
using namespace std; 

int p[100], q[100]; 

int minValue(int N, int W) {
    p[0] = 1; 
    playRound(p, q); 
    for(int i = 0; i < N; ++i) 
        if(!q[i]) return i; 
    return -1; 
}

int maxValue(int N, int W) {
    
    return -1; 
}

int greaterValue(int N, int W) {
    int lo = 2, hi = 8;
    while(lo <= hi) {
        int mid = lo + hi >> 1; 
        p[0] = p[1] = min(W / 2, mid); 
        playRound(p, q); 
        if(q[0] && !q[1]) return 0; 
        if(q[1] && !q[0]) return 1; 
        if(!q[0] && !q[1]) hi = mid - 1; 
        else lo = mid + 1; 
    } return -1; 
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
    } else {
    }
}

컴파일 시 표준 에러 (stderr) 메시지

koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:23:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int mid = lo + hi >> 1; 
                   ~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...