이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#include "koala.h"
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 arr[101];
for(int i=0;i<n;i++){
if(i==0){
arr[i]=1;
}
else{
arr[i]=0;
}
}
int arr2[101];
playRound(arr,arr2);
for(int j=1;j<n;j++){
if(arr2[j]==0){
return j;
}
}
return 0;
return 0;
}
int maxValue(int N, int W) {
int co[101];
int co2[101];
vector<int> ac;
for(int i=0;i<100;i+=10){
for(int j=0;j<100;j++){
co[j]=0;
co2[j]=0;
}
for(int j=i;j<i+10;j++){
co[j]=9;
}
playRound(co,co2);
for(int j=i;j<i+10;j++){
if(co[j]>9){
ac.pb(j);
}
}
}
for(int j=0;j<100;j++){
co[j]=0;
co2[j]=0;
}
for(auto j:ac){
co[j]=9;
}
playRound(co,co2);
for(int i=0;i<100;i++){
if(co2[i]>9){
return i;
}
}
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.
}
}
# | 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... |