| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 235956 |
2020-05-30T13:37:37 Z |
crossing0ver |
Wall (IOI14_wall) |
C++17 |
|
11 ms |
640 KB |
#include<bits/stdc++.h>
#include "wall.h"
using namespace std;
const int N = 2E6;
int t[4*N][2],lazy[4*N][2],l,r,val;// min h, max h
bool type;
void push(int v,int tl,int tr) {
if (lazy[v][0]) {
if (lazy[v*2][0] < lazy[v][0])
lazy[v*2][0] = t[v*2][0] = lazy[v][0];
if (lazy[v*2|1][0] < lazy[v][0])
lazy[v*2|1][0] = t[v*2|1][0] = lazy[v][0];
lazy[v][0] = 0;
}
if (lazy[v][1]) {
if (lazy[v*2][1] > lazy[v][1])
lazy[v*2][1] = t[v*2][1] = lazy[v][1];
if (lazy[v*2|1][1] > lazy[v][1])
lazy[v*2|1][1] = t[v*2|1][1] = lazy[v][1];
lazy[v][1] = 0;
}
}
void upd (int v,int tl,int tr) {
if (l > tr || r < tl) return;
if (tl >= l && tr <= r) {
if (type == 0) {
if (t[v][0] >= val) return;
t[v][0] = val;
lazy[v][0] = val;
if (t[v][1] < val) {
t[v][1] = lazy[v][1] = val;
}
}
else {
if (t[v][1] <= val) return;
t[v][1] = val;
lazy[v][1] = val;
if (t[v][0] > val) {
t[v][0] = lazy[v][0] = val;
}
}
return;
}
push (v,tl,tr);
int tm = (tl + tr)/2;
upd (v*2,tl,tm);
upd (v*2|1,tm+1,tr);
}
int A[N];
void get (int v,int tl,int tr) {
if (tl == tr) A[tl] = t[v][0];
else {
int tm = (tl + tr)/2;
push(v,tl,tr);
get(v*2,tl,tm);
get(v*2+1,tm+1,tr);
}
}
void buildWall(int n, int k, int op[], int left[], int right[],int height[], int finalHeight[]) {
for (int i = 0; i < k; i++) {
type = op[i] - 1;
l = left[i];
r = right[i];
val = height[i] + 1;
upd (1,0,n-1);
}
get(1,0,n-1);
for (int i = 0;i < N; i++)
finalHeight[i] = max (A[i] - 1,0);
}
Compilation message
wall.cpp: In function 'void push(int, int, int)':
wall.cpp:19:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
if (lazy[v*2|1][1] > lazy[v][1])
^~
wall.cpp:21:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
lazy[v][1] = 0;
^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
11 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
11 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
10 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
11 ms |
640 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
