oj.uz

답안 #970310

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970310 2024-04-26T10:49:40 Z bachhoangxuan 코알라 (APIO17_koala) C++17
33 / 100
 59 ms 488 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;

int B[105],R[105];

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

int maxValue(int N, int W) {
    vector<int> ord(N);
    iota(ord.begin(),ord.end(),0);
    while((int)ord.size()>1){
        for(int i=0;i<N;i++) B[i]=0;
        for(int x:ord) B[x]=N/(int)ord.size();
        vector<int> nxt;
        playRound(B,R);
        for(int x:ord) if(R[x]>B[x]) nxt.push_back(x);
        swap(nxt,ord);
    }
    return ord[0];
}

int greaterValue(int N, int W) {
    int l=1,r=8;
    while(l<=r){
        int d=(l+r)>>1;
        for(int i=0;i<N;i++) B[i]=0;
        B[0]=B[1]=d;
        playRound(B,R);
        if(R[0]>d && R[1]<=d) return 0;
        else if(R[1]>d && R[0]<=d) return 1;
        if(R[0]<=d) r=d-1;
        else l=d+1;
    }
    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
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 344 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct

Subtask #3
14.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 50 ms 476 KB Output is partially correct
2 Partially correct 59 ms 460 KB Output is partially correct
3 Partially correct 49 ms 480 KB Output is partially correct
4 Partially correct 49 ms 488 KB Output is partially correct
5 Partially correct 49 ms 468 KB Output is partially correct
6 Partially correct 50 ms 460 KB Output is partially correct
7 Partially correct 56 ms 464 KB Output is partially correct
8 Partially correct 50 ms 472 KB Output is partially correct
9 Partially correct 50 ms 472 KB Output is partially correct
10 Partially correct 47 ms 484 KB Output is partially correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -