oj.uz

답안 #722257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722257 2023-04-11T16:10:35 Z nguyentunglam 코알라 (APIO17_koala) C++17
19 / 100
 13 ms 316 KB 
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 110;
int b[N], r[N], mark[N];
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]) return i;
    return 0;
}

int maxValue(int n, int w) {
    for(int i = 0; i < n; i++) mark[i] = 1;
    int loop = 20;
    while (loop--) {
        int cnt = 0;
        for(int i = 0; i < n; i++) cnt += mark[i];
//        cout << cnt << " " << endl;
        if (cnt == 1) break;
        int val = w / cnt;
        for(int i = 0; i < n; i++) {
            if (mark[i]) b[i] = val;
            else b[i] = 0;
        }
//        for(int i = 0; i < n; i++) cout << b[i] << " "; cout << endl;
        playRound(b, r);
//        for(int i = 0; i < n; i++) cout << r[i] << " "; cout << endl;
        for(int i = 0; i < n; i++) mark[i] &= (r[i] > 0);
    }
    for(int i = 0; i < n; i++) if (mark[i]) return i;
    return 0;
}

int greaterValue(int N, int W) {
    // 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) {
    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.
    }
}

Subtask #1
4.0 / 4.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 316 KB Output is correct
2 Correct 13 ms 208 KB Output is correct
3 Correct 13 ms 208 KB Output is correct
4 Correct 11 ms 316 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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