oj.uz

답안 #239114

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
239114 2020-06-14T12:39:23 Z urd05 코알라 (APIO17_koala) C++14
19 / 100
 22 ms 384 KB 
#include <bits/stdc++.h>
#include "koala.h"
using namespace std;

int minValue(int N, int W) {
    int b[100];
    b[0]=1;
    int r[100];
    playRound(b,r);
    int ret;
    if (r[0]==2) {
        for(int i=1;i<N;i++) {
            if (r[i]==0) {
                return i;
            }
        }
    }
    else {
        return 0;
    }
    return 0;
}

int maxValue(int N, int W) {
    bool alive[100];
    int b[100];
    for(int i=0;i<N;i++) {
        alive[i]=true;
    }
    int cnt=N;
    while (1) {
        memset(b,0,sizeof(b));
        for(int i=0;i<N;i++) {
            if (alive[i]) {
                b[i]=N/cnt;
            }
        }
        int r[100];
        playRound(b,r);
        for(int i=0;i<N;i++) {
            if (r[i]<=b[i]) {
                alive[i]=false;
            }
        }
        cnt=0;
        for(int i=0;i<N;i++) {
            if (alive[i]) {
                cnt++;
            }
        }
        if (cnt==1) {
            break;
        }
    }
    for(int i=0;i<N;i++) {
        if (alive[i]) {
            return i;
        }
    }
}

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

Compilation message

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:10:9: warning: unused variable 'ret' [-Wunused-variable]
     int ret;
         ^~~
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:60:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Correct 9 ms 384 KB Output is correct
4 Correct 10 ms 384 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 384 KB Output is correct
2 Correct 22 ms 384 KB Output is correct
3 Correct 22 ms 384 KB Output is correct
4 Correct 21 ms 288 KB Output is correct

Subtask #3
0 / 18.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 53.0

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