# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
867497 |
2023-10-28T14:03:32 Z |
42kangaroo |
popa (BOI18_popa) |
C++17 |
|
5 ms |
700 KB |
//
// Created by 42kangaroo on 28/10/2023.
//
#include "bits/stdc++.h"
#include "popa.h"
using namespace std;
struct Node {
int p, l, r;
};
int solve(int N, int* Left, int* Right) {
int nowN = 0;
vector<Node> no(N, {-1,-1,-1});
for (int i = 1; i < N; ++i) {
if (query(i - 1, i, i - 1, i - 1)) {
no[i].p = i - 1;
no[i - 1].r = i;
}
else {
no[nowN].p = i;
no[i].l = nowN;
nowN = i;
}
}
for (int i = 0; i < N; ++i) {
Left[i] = no[i].l;
Right[i] = no[i].r;
}
return nowN;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
436 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
5 ms |
452 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
5 ms |
700 KB |
Execution killed with signal 13 |
2 |
Halted |
0 ms |
0 KB |
- |