This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
void playRound(int *B, int *R);
//#include "koala.h"
#include<bits/stdc++.h>
using namespace std;
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 B[N];
int R[N];
fill(B,B+N,0);
fill(R,R+N,0);
B[0] = 1;
playRound(B,R);
for(int i = 0;i < N;i++){
if(R[i] == 0) return i;
}
}
int maxValue(int N, int W) {
int B1[N], B2[N], B3[N], B4[N];
int R1[N], R2[N], R3[N], R4[N];
for(int i = 0;i < N;i++){
B1[i] = 1;
}
playRound(B1,R1);
for(int i = 0;i < N;i++){
B2[i] = R1[i];
}
playRound(B2,R2);
for(int i = 0;i < N;i++){
//printf("%d ",R2[i]);
if(R2[i] == 3) B3[i] = 4;
else B3[i] = 0;
}
playRound(B3,R3);
for(int i = 0;i < N;i++){
//printf("%d ",R3[i]);
if(R3[i] == 5) B4[i] = 11;
else B4[i] = 0;
}
playRound(B4,R4);
for(int i = 0;i < N;i++){
//printf("%d ",R4[i]);
if(R4[i] == 12) return i;
}
return 0;
}
int greaterValue(int N, int W) {
int B[N];
int R[N];
fill(B,B+N,0);
B[0] = 1;
B[1] = 1;
playRound(B,R);
if(R[0] == 0 && R[1] > 0) return 1; ///something stands out
else if(R[0] > 0 && R[1] == 0) return 0; ///something stands out
fill(B,B+N,0);
B[0] = 4;
B[1] = 4;
playRound(B,R);
if(R[0] == 0 && R[1] > 0) return 1; ///something stands out
else if(R[0] > 0 && R[1] == 0) return 0; ///something stands out
else if(R[0] == 0 && R[1] == 0){
fill(B,B+N,0);
B[0] = 2;
B[1] = 2;
playRound(B,R);
if(R[0] == 0 && R[1] > 0) return 1; ///something stands out
else if(R[0] > 0 && R[1] == 0) return 0; ///something stands out
}
else{
fill(B,B+N,0);
B[0] = 6;
B[1] = 6;
playRound(B,R);
if(R[0] == 0 && R[1] > 0) return 1; ///something stands out
else if(R[0] > 0 && R[1] == 0) return 0; ///something stands out
}
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.
}
}
Compilation message (stderr)
koala.cpp: In function 'int minValue(int, int)':
koala.cpp:19:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# | 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... |