# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1228212 | abdelhakim | 코알라 (APIO17_koala) | C++20 | 0 ms | 408 KiB |
#include "koala.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int minValue(int N, int W) {
int arr[N];
for (int i=0;i<N;i++) arr[i]=1;
int r[N];
playRound(arr,r);
ll f=0;
for (int i=0;i<N;i++)
{
if(r[i] > 1 && f)
{
f=1;
arr[i]=1;
}
else
{
arr[i]=0;
}
}
playRound(arr,r);
for (int i=0;i<N;i++)
{
if(r[i]==0)
{
return i;
}
}
}
int maxValue(int N, int W) {
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
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.
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |