제출 #1317653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1317653		eri16	Koala Game (APIO17_koala)	C++20	19 / 100	8 ms	504 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>

using namespace std;

int minValue(int n, int w){
    int* b=new int[n];
    int* r=new int[n];
    for(int i=0; i<n; i++){b[i]=0;}
    b[0]=1;
    
    playRound(b,r);
    
    for (int i=1; i<n; i++){
        if (r[i]==0){
            return i;
        }
    }
    return 0;
}

int maxValue(int n, int w){
    vector <int> v(n,1);
    int* b=new int[n];
    int* r=new int[n];
    for(int i=0; i<n; i++){b[i]=1;}
    
    playRound(b,r);// 51-100
    
    for (int i=0; i<n; i++){if (r[i]<2){v[i]=0;}}
    for (int i=0; i<n; i++){b[i]=0;}
    for (int i=0; i<n; i++){if (v[i]){b[i]=2;}}
    
    playRound(b,r);//76-100
    
    for (int i=0; i<n; i++){if (r[i]<3){v[i]=0;}}    
    for (int i=0; i<n; i++){b[i]=0;}
    for (int i=0; i<n; i++){if (v[i]){b[i]=4;}}
    
    playRound(b,r);//92-100
    
    for (int i=0; i<n; i++){if (r[i]<5){v[i]=0;}}    
    for (int i=0; i<n; i++){b[i]=0;}
    for (int i=0; i<n; i++){if (v[i]){b[i]=11;}}    
    
    playRound(b,r);//100
    
    for (int i=0; i<n; i++){if (r[i]<12){v[i]=0;}}
    for (int i=0; i<n; i++){if (v[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.
    }
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 53