oj.uz

답안 #887861

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887861 2023-12-15T10:28:58 Z vjudge1 코알라 (APIO17_koala) C++17
30 / 100
 165 ms 716 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;

const int mxn = 123;
int a[mxn], b[mxn];

int minValue(int n, int w)
{
    a[0] = 1;
    fill(a+1, a+n, 0);
    playRound(a, b);
    if(b[0] <= 1)
    {
        return 0;
    }
    for(int i = 1; i < n; i++)
    {
        if(!b[i])
        {
            return i;
        }
    }
}

int maxValue(int n, int w)
{
    int cnt = 0;
    bool mark[n];
    fill(mark, mark+n, 0);
    while(cnt < (n-1))
    {
        fill(a, a+n, 0);
        for(int i = 0; i < n; i++)
        {
            if(!mark[i])
            {
                a[i] = w/(n-cnt);
            }
        }
        playRound(a, b);
        for(int i = 0; i < n; i++)
        {
            if(mark[i])
            {
                continue;
            }
            if(b[i] <= a[i])
            {
                mark[i] = 1;
                cnt++;
            }
        }
    }
    for(int i = 0; i < n; i++)
    {
        if(!mark[i])
        {
            return i;
        }
    }
}

int greaterValue(int n, int w)
{
    int l = 0, r = 23, ans;
    while((r-l) > 1)
    {
        int m = (r+l)/2;
        fill(a, a+n, 0);
        a[0] = a[1] = m;
        playRound(a, b);
        if((b[0] > a[0]) && (b[1] > a[1]))
        {
            l = m;
        }
        else
        {
            ans = 1;
            if(b[0] > a[0])
            {
                ans = 0;
            }
            r = m;
        }
    }
    return ans;
}

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.
    }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:24:1: warning: control reaches end of non-void function [-Wreturn-type]
   24 | }
      | ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:62:1: warning: control reaches end of non-void function [-Wreturn-type]
   62 | }
      | ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:87:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   87 |     return ans;
      |            ^~~

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
11.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 133 ms 460 KB Output is partially correct
2 Partially correct 133 ms 716 KB Output is partially correct
3 Partially correct 125 ms 464 KB Output is partially correct
4 Partially correct 145 ms 460 KB Output is partially correct
5 Partially correct 133 ms 456 KB Output is partially correct
6 Partially correct 148 ms 456 KB Output is partially correct
7 Partially correct 165 ms 500 KB Output is partially correct
8 Partially correct 131 ms 696 KB Output is partially correct
9 Partially correct 158 ms 464 KB Output is partially correct
10 Partially correct 133 ms 468 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 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -