oj.uz

답안 #984186

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
984186 2024-05-16T11:15:40 Z Unforgettablepl 코알라 (APIO17_koala) C++17
24 / 100
 133 ms 708 KB 
#include <bits/stdc++.h>
using namespace std;

//#define int long long

void playRound(int *B, int *R);

int minValue(int N, int W) {
    int arr[100];fill(arr,arr+100,0);
    int res[100];fill(res,res+100,0);
    arr[0] = 1;
    playRound(arr,res);
    for(int i=0;i<N;i++)if(res[i]<=arr[i])return i;
}

int maxValue(int N, int W) {
    vector<int> poss(N);iota(poss.begin(), poss.end(),0);
    while(poss.size()>1){
        int arr[100];fill(arr,arr+100,0);
        int res[100];fill(res,res+100,0);
        int distrib = W/poss.size();
        for(int&i:poss)arr[i]=distrib;
        playRound(arr,res);
        poss.clear();
        for(int i=0;i<N;i++)if(arr[i] and res[i]>arr[i])poss.emplace_back(i);
    }
    return poss[0];
}

int greaterValue(int N, int W) {
    for(int x=1;x;x++){
        int arr[100];fill(arr,arr+100,0);
        int res[100];fill(res,res+100,0);
        arr[0]=arr[1]=x;
        playRound(arr,res);
        bool zerogud = res[0]>arr[0];
        bool onegud = res[1]>arr[1];
        if(zerogud==onegud)continue;
        return onegud;
    }
    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.
    }
}

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:14:1: warning: control reaches end of non-void function [-Wreturn-type]
   14 | }
      | ^

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 3 ms 596 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 344 KB Output is correct
2 Correct 10 ms 452 KB Output is correct
3 Correct 10 ms 344 KB Output is correct
4 Correct 10 ms 448 KB Output is correct

Subtask #3
5.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 122 ms 704 KB Output is partially correct
2 Partially correct 123 ms 460 KB Output is partially correct
3 Partially correct 115 ms 464 KB Output is partially correct
4 Partially correct 133 ms 464 KB Output is partially correct
5 Partially correct 114 ms 456 KB Output is partially correct
6 Partially correct 119 ms 460 KB Output is partially correct
7 Partially correct 114 ms 456 KB Output is partially correct
8 Partially correct 125 ms 708 KB Output is partially correct
9 Partially correct 114 ms 460 KB Output is partially correct
10 Partially correct 111 ms 460 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 -