oj.uz

답안 #972694

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
972694 2024-05-01T01:12:49 Z bachhoangxuan 코알라 (APIO17_koala) C++17
47 / 100
 53 ms 620 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) {
    vector<int> x(8);
    iota(x.begin(),x.end(),1);
    x.pop_back();x.back()++;
    int l=0,r=6;
    while(l<=r){
        int mid=(l+r)>>1,d=x[mid];
        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=mid-1;
        else l=mid+1;
    }
    return 0;
}

void allValues(int N, int W, int *P) {
    if (W == 2*N) {
        vector<int> ord(N);
        iota(ord.begin(),ord.end(),0);
        stable_sort(ord.begin(),ord.end(),[&](int x,int y){
            for(int i=0;i<N;i++) B[i]=0;
            B[x]=B[y]=N;
            playRound(B,R);
            return R[y];
        });
        for(int i=0;i<N;i++) P[ord[i]]=i+1;
    } 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 356 KB Output is correct
2 Correct 4 ms 356 KB Output is correct
3 Correct 3 ms 356 KB Output is correct
4 Correct 3 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 472 KB Output is correct
2 Correct 53 ms 356 KB Output is correct
3 Correct 47 ms 620 KB Output is correct
4 Correct 48 ms 608 KB Output is correct
5 Correct 51 ms 476 KB Output is correct
6 Correct 50 ms 500 KB Output is correct
7 Correct 47 ms 476 KB Output is correct
8 Correct 49 ms 476 KB Output is correct
9 Correct 50 ms 612 KB Output is correct
10 Correct 46 ms 552 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 344 KB Output is correct
2 Correct 28 ms 344 KB Output is correct
3 Correct 29 ms 344 KB Output is correct
4 Correct 28 ms 344 KB Output is correct
5 Correct 27 ms 344 KB Output is correct
6 Correct 28 ms 460 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 27 ms 344 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 428 KB Output is correct
14 Correct 24 ms 344 KB Output is correct
15 Correct 24 ms 344 KB Output is correct
16 Correct 25 ms 344 KB Output is correct
17 Correct 25 ms 344 KB Output is correct
18 Correct 26 ms 344 KB Output is correct
19 Correct 25 ms 344 KB Output is correct
20 Correct 25 ms 344 KB Output is correct

Subtask #5
0 / 53.0

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