# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
408583 | 2021-05-19T08:30:23 Z | syl123456 | 코알라 (APIO17_koala) | C++17 | 0 ms | 0 KB |
#include "koala.h" void playRound(int *B, int *R) {} int minValue(int N, int W) { // TODO: Implement Subtask 1 solution here. // You may leave this function unmodified if you are not attempting this // subtask. int a[N], b[N]; for (int &i : a) i = 1; playRound(a, b); int tmp = 0; for (int i = 0; i < N; ++i) { if (b[i] == 0) a[i] = 0; else if (tmp == 0) a[i] = 98, ++tmp; else if (tmp == 1) a[i] = 2, ++tmp; else a[i] = 0; } playRound(a, b); for (int i = 0; i < N; ++i) if (a[i] == b[i]) return i; /* B 98 2 0 0 0 .. 0 * R 0 3 1 1 1 .. 0 * ans */ } 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. } }