oj.uz

답안 #65486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
65486 2018-08-07T17:49:43 Z theknife2001 벽 (IOI14_wall) C++17
0 / 100
 234 ms 8320 KB 
#include "wall.h"
#include <bits/stdc++.h>
#define mid (l+r)/2

using std::max;

const int N=2e6+55;
int lazy[N*4];
int tree[N*4];

void propagate(int l , int r , int node)
{
    if(lazy[node]==0)
        return ;
    tree[node]+=lazy[node];
    tree[node]=max(0,tree[node]);
    if(l!=r)
    {
        lazy[node*2]+=lazy[node];
        lazy[node*2+1]+=lazy[node];
    }
    lazy[node]=0;
}

void update(int l , int r , int node , int x , int y , int val)
{
    propagate(l,r,node);
    if(r<x||l>y)
        return ;
    if(x<=l&&r<=y)
    {
        lazy[node]+=val;
        propagate(l,r,node);
        return ;
    }
    update(l,mid,node*2,x,y,val);
    update(mid+1,r,node*2+1,x,y,val);
}

int query(int l , int r , int node , int ind)
{
    propagate(l,r,node);
    if(l==r&&l==ind)
        return tree[node];
    if(ind<=mid)
        return query(l,mid,node*2,ind);
    else
        return query(mid+1,r,node*2+1,ind);
}

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
    for(int i=0;i<k;i++)
    {
        if(op[i]==2)
            height[i]*=-1;
        update(0,n-1,1,right[i],left[i],height[i]);
    }
    for(int i=0;i<n;i++)
        finalHeight[i]=query(0,n-1,1,i);
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 248 KB Output is correct
2 Incorrect 4 ms 612 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 612 KB Output is correct
2 Incorrect 234 ms 8320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8320 KB Output is correct
2 Incorrect 5 ms 8320 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8320 KB Output is correct
2 Incorrect 4 ms 8320 KB Output isn't correct
3 Halted 0 ms 0 KB -