# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
211690 | skylee | Building 4 (JOI20_building4) | C++17 | 297 ms | 60996 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<cstdio>
#include<cctype>
#include<climits>
#include<cstring>
#include<algorithm>
inline int getint() {
register char ch;
while(!isdigit(ch=getchar()));
register int x=ch^'0';
while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');
return x;
}
using int64=long long;
constexpr int N=1e6+1;
int v[N][2];
int f[N][2][2],g[N][2][2];
char s[N];
int main() {
const int n=getint()*2;
for(register int i=1;i<=n;i++) v[i][0]=getint();
for(register int i=1;i<=n;i++) v[i][1]=getint();
for(register int i=1;i<=n;i++) {
for(register int j=0;j<2;j++) {
for(register int k=0;k<2;k++) {
const int l=std::min(f[i-1][k][0],f[i-1][k][1]);
const int r=std::max(g[i-1][k][0],g[i-1][k][1]);
if(v[i][j]<v[i-1][k]||l==INT_MAX||r==INT_MIN) {
f[i][j][k]=INT_MAX;
g[i][j][k]=INT_MIN;
continue;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |