oj.uz

Submission #111424

# Submission time Handle Problem Language Result Execution time Memory
111424 2019-05-15T10:44:38 Z Segtree Koala Game (APIO17_koala) C++14
4 / 100
 9 ms 512 KB 
#include<iostream>
#include<algorithm>
#include"koala.h"
using namespace std;
typedef long long ll;
int B[110],R[110];
int minValue(int N,int W){
    for(int i=1;i<N;i++){B[i]=0;} B[0]=1;
    playRound(B,R);
    for(int i=0;i<N;i++){
	if(R[i]==0)return i;
    }
    return -1;
}
int maxValue(int N,int W){
    return -1;
}
int greaterValue(int N,int W){
    return -1;
}
void allValues(int N,int W,int *P){
    
}
/*
int main(){
    
    return 0;
}*/

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 512 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 7 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -