oj.uz

답안 #919294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
919294 2024-01-31T14:34:26 Z vnm06 코알라 (APIO17_koala) C++14
47 / 100
 77 ms 600 KB 
#include<bits/stdc++.h>
#include "koala.h"
using namespace std;

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

int maxValue(int N, int W) {
    vector<int> pos, pos2;
    pos.resize(N);
    for(int i=0; i<N; i++) pos[i]=i;
    int B[105], R[105];
    for(int i=0; i<N; i++) B[i]=R[i]=0;

    while(pos.size()>1)
    {
        int k=pos.size(), v=W/k;
        for(int i=0; i<N; i++) B[i]=R[i]=0;
        for(int i=0; i<k; i++) B[pos[i]]=v;
        playRound(B, R);
        pos2.resize(0);
        for(int i=0; i<k; i++)
        {
            if(R[pos[i]]>B[pos[i]]) pos2.push_back(pos[i]);
        }
        pos.resize(pos2.size());
        for(int i=0; i<pos.size(); i++) pos[i]=pos2[i];
    }
    // TODO: Implement Subtask 2 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return pos[0];
}

int greaterValue(int N, int W) {
    int B[105], R[105];
    for(int i=0; i<N; i++) B[i]=R[i]=0;
    int le=0, ri=13;
    while(ri-le>1)
    {
        int mid=(le+ri)/2;
        B[0]=B[1]=mid;
        playRound(B, R);
        if(R[0]<=B[0] && R[1]<=B[1]) ri=mid;
        else if(R[0]>B[1] && R[1]>B[1]) le=mid;
        else return R[0]<R[1];
    }
    // TODO: Implement Subtask 3 solution here.
    // You may leave this function unmodified if you are not attempting this
    // subtask.
    return 0;
}

void allValues(int N, int W, int *P)
{
    int B[105], R[105];
    for(int i=0; i<N; i++) B[i]=R[i]=0;

    int ord[105];
    int gr[105];

    for(int i=0; i<N; i++)
    {
        ord[i]=i;
        gr[i]=0;
    }

    while(1)
    {
        int i;
        for(i=0; i<N-1; i++)
        {
            if(!gr[i]) break;
        }
        if(i==N-1) break;
        int le=i;
        int ri=i;
        while(ri+1<N-1 && !gr[ri+1]) ri++;
        ri++;
        int br=ri-le+1, v=(W-le)/br;
        for(int i=0; i<N; i++) B[i]=0;
        for(int j=le; j<=ri; j++) B[ord[j]]=v;
        playRound(B, R);

        for(int j=le; j<=ri; j++)
        {
            if(B[ord[j]]<R[ord[j]])
            {
                swap(ord[j], ord[le]);
                le++;
            }
        }
        gr[le-1]=1;
    }
    for(int i=0; i<N; i++) P[ord[i]]=N-i;
}

Compilation message

koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:33:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for(int i=0; i<pos.size(); i++) pos[i]=pos2[i];
      |                      ~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 452 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 13 ms 504 KB Output is correct
4 Correct 10 ms 596 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 484 KB Output is correct
2 Correct 47 ms 460 KB Output is correct
3 Correct 39 ms 344 KB Output is correct
4 Correct 38 ms 600 KB Output is correct
5 Correct 36 ms 480 KB Output is correct
6 Correct 39 ms 476 KB Output is correct
7 Correct 43 ms 600 KB Output is correct
8 Correct 45 ms 456 KB Output is correct
9 Correct 40 ms 460 KB Output is correct
10 Correct 36 ms 492 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 352 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 5 ms 596 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 6 ms 452 KB Output is correct
19 Correct 5 ms 344 KB Output is correct
20 Correct 5 ms 344 KB Output is correct

Subtask #5
0 / 53.0

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