제출 #173053

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
173053		arnold518	코알라 (APIO17_koala)	C++14	19 / 100	17 ms	376 KiB

koala

#include "koala.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 100;

int N, W, P[MAXN+10];
int B[MAXN+10], R[MAXN+10];

int minValue(int _N, int _W)
{
    N=_N; W=_W;
    int i, j;
    memset(B, 0, sizeof(B));
    B[0]++;
    playRound(B, R);

    if(R[0]==2) for(i=0; i<N; i++) if(R[i]==0) return i;
    return 0;
}

int maxValue(int _N, int _W)
{
    N=_N; W=_W;
    int i, j;

    vector<int> V, V2;

    for(i=0; i<N; i++) V.push_back(i);

    while(V.size()>1)
    {
        //for(auto it : V) printf("%d ", it); printf("\n");

        memset(B, 0, sizeof(B));
        for(auto it : V) B[it]=N/V.size();
        playRound(B, R); for(i=0; i<N; i++) R[i]=R[i]>B[i];

        V2.clear();
        for(i=0; i<N; i++) if(R[i] && binary_search(V.begin(), V.end(), i)) V2.push_back(i);
        V=V2;
    }
    return V[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.
    }
}

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

koala.cpp: In function 'int minValue(int, int)':
koala.cpp:17:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:29:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^

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