이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
int minValue(int N, int W) {
int B[N], R[N];
for (int i=0; i<N; i++) B[i] = 0;
B[0] = 1;
playRound(B, R);
for (int i=0; i<N; i++){
if (B[i] >= R[i]) return i;
}
}
int maxValue(int N, int W) {
int B[N], R[N];
for (int i=0; i<N; i++) B[i] = 1;
playRound(B, R);
vector<int> v;
for (int i=0; i<N; i++){
if (R[i] > 1) v.push_back(i);
}
//cout << v.size() << "\n";
for (int i=0; i<N; i++) B[i] = 0;
for (int x : v) B[x] = 2;
playRound(B, R);
vector<int> w;
for (int x : v){
if (R[x] > 2) w.push_back(x);
}
//cout << w.size() << "\n";
for (int i=0; i<N; i++) B[i] = 0;
for (int x : w) B[x] = 4;
playRound(B, R);
vector<int> u;
for (int x : w){
if (R[x] > 4) u.push_back(x);
}
//cout << u.size() << "\n";
for (int i=0; i<N; i++) B[i] = 0;
for (int x : u) B[x] = 11;
playRound(B, R);
for (int x : u){
if (R[x] > 11) return x;
}
}
int greaterValue(int N, int W) {
int B[N], R[N];
for (int i=0; i<N; i++) B[i] = 0;
int l = 0, r = 13;
while (l != r){
int m = (l+r)/2;
B[0] = m;
B[1] = m;
playRound(B, R);
if (R[0] > B[0] && R[1] > B[1]) l = m;
if (R[0] <= B[0] && R[1] <= B[1]) r = m;
if (R[0] > B[0] && R[1] <= B[1]) return 0;
if (R[0] <= B[0] && R[1] > B[1]) return 1;
}
}
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:13:1: warning: control reaches end of non-void function [-Wreturn-type]
13 | }
| ^
koala.cpp: In function 'int maxValue(int, int)':
koala.cpp:19:17: warning: control reaches end of non-void function [-Wreturn-type]
19 | vector<int> v;
| ^
koala.cpp: In function 'int greaterValue(int, int)':
koala.cpp:62:1: warning: control reaches end of non-void function [-Wreturn-type]
62 | }
| ^
# | 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... |