# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
702812 |
2023-02-25T08:12:43 Z |
salmon |
popa (BOI18_popa) |
C++14 |
|
1 ms |
336 KB |
#include <bits/stdc++.h>
#include "popa.h"
using namespace std;
int solve(int N, int* Left, int* Right){
for(int i = 0; i < N; i++){
Left[i] = -1;
Right[i] = -1;
}
return 0;
int big = 0;
for(int i = 0; i < N - 1; i++){
if(query(i, i + 1, i + 1, i + 1) == 1){
Left[i + 1] = big;
big = i + 1;
}
else{
Right[i] = i + 1;
big = i;
}
}
return big;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
0 ms |
336 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
320 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
300 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |