oj.uz

답안 #202801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
202801 2020-02-17T23:52:42 Z DavidDamian 벽 (IOI14_wall) C++11
61 / 100
 1175 ms 206840 KB 
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
int segm_tree[6000000];
int leftNode(int i)
{
    return i*2;
}
int rightNode(int i)
{
    return i*2+1;
}
void recompute(int i)
{
    segm_tree[i]=max(segm_tree[leftNode(i)],segm_tree[rightNode(i)]);
}
struct bound
{
    int on;
    int a,b;
} lazy[6000005];
#define inf 1000000
void combine(int cur,int past)
{
    if(lazy[cur].on==0){
        lazy[cur]=lazy[past];
        return;
    }
    int x=lazy[past].a;
    if(x>lazy[cur].a)
        lazy[cur].a=x;
    if(x>lazy[cur].b)
        lazy[cur].b=x;
    x=lazy[past].b;
    if(x<lazy[cur].a)
        lazy[cur].a=x;
    if(x<lazy[cur].b)
        lazy[cur].b=x;
}
void propagate(int i,int L,int R)
{
    if(lazy[i].on==0) return;
    segm_tree[i]=max(segm_tree[i],lazy[i].a);
    segm_tree[i]=min(segm_tree[i],lazy[i].b);
    if(L<R){
        combine(leftNode(i),i);
        combine(rightNode(i),i);
    }
    lazy[i].on=0;
    lazy[i].a=-inf;
    lazy[i].b=inf;
}
void update(int i,int L,int R,int x,int y,int type,int h)
{
    propagate(i,L,R);
    if(x<=L && R<=y){
        if(type==1) lazy[i].a=h;
        else lazy[i].b=h;
        lazy[i].on=1;
    }
    else{
        int mid=(L+R)/2;
        if(x<=mid)
            update(leftNode(i),L,mid,x,y,type,h);
        if(mid+1<=y)
            update(rightNode(i),mid+1,R,x,y,type,h);
        propagate(leftNode(i),L,mid);
        propagate(rightNode(i),mid+1,R);
        recompute(i);
    }
}
int query(int i,int L,int R,int x)
{
    propagate(i,L,R);
    if(L==R){
        return segm_tree[i];
    }
    else{
        int mid=(L+R)/2;
        if(x<=mid)
            return query(leftNode(i),L,mid,x);
        else
            return query(rightNode(i),mid+1,R,x);
    }
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    for(int i=1;i<=5*n;i++){
        lazy[i].on=0;
        lazy[i].a=-inf;
        lazy[i].b=inf;
    }
    for(int i=0;i<k;i++){
        update(1,1,n,left[i]+1,right[i]+1,op[i],height[i]);
    }
    for(int i=0;i<n;i++){
        finalHeight[i]=query(1,1,n,i+1);
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Correct 15 ms 1272 KB Output is correct
5 Correct 11 ms 1144 KB Output is correct
6 Correct 11 ms 1144 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 176 ms 8188 KB Output is correct
3 Correct 369 ms 5044 KB Output is correct
4 Correct 1125 ms 15636 KB Output is correct
5 Correct 334 ms 16380 KB Output is correct
6 Correct 329 ms 16248 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 17 ms 1272 KB Output is correct
5 Correct 11 ms 1304 KB Output is correct
6 Correct 11 ms 1144 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 190 ms 8184 KB Output is correct
9 Correct 374 ms 5112 KB Output is correct
10 Correct 1132 ms 15736 KB Output is correct
11 Correct 332 ms 16172 KB Output is correct
12 Correct 317 ms 16228 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 183 ms 8184 KB Output is correct
15 Correct 63 ms 2168 KB Output is correct
16 Correct 1157 ms 15992 KB Output is correct
17 Correct 325 ms 15992 KB Output is correct
18 Correct 329 ms 15996 KB Output is correct

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 7 ms 504 KB Output is correct
3 Correct 7 ms 376 KB Output is correct
4 Correct 15 ms 1144 KB Output is correct
5 Correct 12 ms 1144 KB Output is correct
6 Correct 11 ms 1144 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 177 ms 8184 KB Output is correct
9 Correct 369 ms 5112 KB Output is correct
10 Correct 1120 ms 15728 KB Output is correct
11 Correct 333 ms 16248 KB Output is correct
12 Correct 309 ms 16120 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 182 ms 8312 KB Output is correct
15 Correct 65 ms 2168 KB Output is correct
16 Correct 1175 ms 15892 KB Output is correct
17 Correct 326 ms 15992 KB Output is correct
18 Correct 319 ms 15864 KB Output is correct
19 Runtime error 378 ms 206840 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -