oj.uz

답안 #1090087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090087 2024-09-17T17:25:11 Z alexander707070 코알라 (APIO17_koala) C++14
37 / 100
 82 ms 1160 KB 
#include<bits/stdc++.h>
#define MAXN 107
#include "koala.h"

using namespace std;

int b[MAXN],r[MAXN];

int minValue(int N, int W) {
    b[0]=1;
    playRound(b,r);

    for(int i=0;i<N;i++){
        if(r[i]==0)return i;
    }
    return 0;
}

vector<int> can,best;

void reset(){
    best.clear(); can.clear();
    for(int i=0;i<100;i++)b[i]=0;
}

int maxValue(int N, int W) {
    reset();

    for(int i=0;i<100;i++)can.push_back(i);
    
    while(can.size()>1){
        for(int i=0;i<100;i++)b[i]=0;

        for(int i:can){
            b[i]=W/int(can.size());
        }

        playRound(b,r);

        for(int i:can){
            if(r[i]>b[i])best.push_back(i);
        }

        can=best; best={};
    }

    return can[0];
}

int from[MAXN],to[MAXN];

bool compare(int x,int y){
    for(int i=0;i<100;i++)b[i]=0;
    
    int ll=0,rr=10,tt;

    while(ll+1<rr){
        tt=(ll+rr)/2;

        b[x]=b[y]=tt;
        playRound(b,r);

        if(r[x]<=tt and r[y]<=tt){
            rr=tt;
        }else if(r[x]>tt and r[y]>tt){
            ll=tt;
        }else{
            if(r[x]>=tt)return false;
            else return true;
        }
    }

    return false;
}

int greaterValue(int N, int W) {

    if(compare(0,1))return 1;
    else return 0;
}

vector<int> solve(vector<int> w,int p){
    if(w.size()<=1)return w;

    int pivot=p;

    for(int i=0;i<100;i++)b[i]=0;
    for(int i:w)b[i]=pivot;

    playRound(b,r);

    vector<int> ll,rr;
    for(int i:w){
        if(r[i]>pivot){
            rr.push_back(i);
        }else{
            ll.push_back(i);
        }
    }

    if(ll.empty())return solve(w,p+2);
    if(rr.empty())return solve(w,p-2);

    ll=solve(ll,100/int(ll.size()));
    rr=solve(rr,100/int(rr.size()));

    vector<int> res;
    for(int i:ll)res.push_back(i);
    for(int i:rr)res.push_back(i);

    return res;
}

vector<int> s;

void allValues(int N, int W, int *P) {
    s={};
    for(int i=0;i<100;i++){
        s.push_back(i);
    }

    solve(s,1);

    for(int i=0;i<N;i++){
        P[s[i]]=i+1;
    }
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 3 ms 456 KB Output is correct
3 Correct 4 ms 344 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 452 KB Output is correct
2 Correct 10 ms 344 KB Output is correct
3 Correct 11 ms 344 KB Output is correct
4 Correct 9 ms 344 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 344 KB Output is correct
2 Correct 52 ms 344 KB Output is correct
3 Correct 38 ms 344 KB Output is correct
4 Correct 40 ms 468 KB Output is correct
5 Correct 38 ms 344 KB Output is correct
6 Correct 39 ms 344 KB Output is correct
7 Correct 46 ms 344 KB Output is correct
8 Correct 39 ms 344 KB Output is correct
9 Correct 41 ms 344 KB Output is correct
10 Correct 37 ms 344 KB Output is 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 82 ms 1160 KB Output isn't correct
2 Halted 0 ms 0 KB -