Submission #1103969

#	Time	Username	Problem	Language	Result	Execution time	Memory
1103969		vjudge1	Wall (IOI14_wall)	C++17	8 / 100	3070 ms	13888 KiB

wall

#include "wall.h"
#include<iostream>
using namespace std;
const int N=2000000;
int seg[4*N+7];

void update(int l,int r,int idx1,int idx2,int val,int node,int mode){
    if(l>idx2 || r<idx1) return ;
    if(l==r){
        if(mode==1) seg[node]=max(seg[node],val);
        else seg[node]=min(seg[node],val);
        return ;
    }
    int mid=(l+r)>>1;
    update(l,mid,idx1,idx2,val,node*2,mode);
    update(mid+1,r,idx1,idx2,val,node*2+1,mode);
}

void print(int l,int r,int idx1,int idx2, int node,int arr[]){
    if(l>idx2 && r<idx1) return ;
    if(l==r){
        arr[l-1]=seg[node];
        return ;
    }
    int mid=(l+r)>>1;
    print(l,mid,idx1,idx2,node*2,arr);
    print(mid+1,r,idx1,idx2,node*2+1,arr);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    for (int i=0;i<k;++i) {
        update(1, n, left[i]+1, right[i]+1, height[i], 1, op[i]);
    }
    print(1,n,1,n,1,finalHeight);
    return;
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 24
• Subtask 3: 0 / 29
• Subtask 4: 0 / 39