# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211579 | Akashi | Building 4 (JOI20_building4) | C++14 | 622 ms | 64000 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
struct usu{
int mina, maxb, maxa, minb;
};
usu seg[1000005][2];
int n;
int a[1000005], b[1000005];
int val[1000005][2];
inline void solve(int n, int k, int nra, int nrb){
if(k == 0) --nra;
else --nrb;
if(n > 1){
for(int k2 = 0; k2 <= 1 ; ++k2){
if(seg[n - 1][k2].mina != INF && seg[n - 1][k2].mina <= nra && seg[n - 1][k2].maxa >= nra && val[n - 1][k2] <= val[n][k]){
solve(n - 1, k2, nra, nrb);
break ;
}
}
}
if(k == 0) printf("A");
else printf("B");
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |