oj.uz

Submission #92284

# Submission time Handle Problem Language Result Execution time Memory
92284 2019-01-02T12:10:11 Z igzi popa (BOI18_popa) C++17
0 / 100
 10 ms 376 KB 
#include <bits/stdc++.h>
#include "popa.h"
#define maxN 1005

using namespace std;

int solve(int n, int* l, int* d){
int i,root=0;
for(i=0;i<n;i++){
l[i]=d[i]=-1;
}
for(i=1;i<n;i++){
if(query(i-1,i,i-1,i-1)) d[i-1]=i;
else{
l[i]=root;
root=i;
}
}
return root;
}

Subtask #1
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB not a valid solution
2 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 372 KB not a valid solution
2 Halted 0 ms 0 KB -

Subtask #3
0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 324 KB not a valid solution
2 Halted 0 ms 0 KB -