oj.uz

답안 #1099493

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099493 2024-10-11T12:44:21 Z rahidilbayramli 벽 (IOI14_wall) C++17
0 / 100
 142 ms 11480 KB 
#include "wall.h"
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define p_b pop_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int sz = 2e6+5;
int res[sz];
pii segtree[4*sz];
void build(int v, int l, int r)
{
    if(l == r)
        segtree[v] = {0, 0};
    else
    {
        int mid = (l + r) / 2;
        build(2*v, l, mid);
        build(2*v+1, mid+1, r);
        segtree[v] = {0, 0};
    }
}
void push1(int v, int l, int r)
{
    if(l != r)
    {
        if(segtree[v].f >= segtree[2*v].s)
            segtree[2*v] = {segtree[v].f, segtree[v].f};
        else    if(segtree[v].s <= segtree[2*v].f)
            segtree[2*v] = {segtree[v].s, segtree[v].s};
        else
            segtree[2*v] = {max(segtree[v].f, segtree[2*v].f), min(segtree[v].s, segtree[2*v].s)};
        if(segtree[v].f >= segtree[2*v+1].s)
            segtree[2*v+1] = {segtree[v].f, segtree[v].f};
        else    if(segtree[v].s <= segtree[2*v+1].f)
            segtree[2*v+1] = {segtree[v].s, segtree[v].s};
        else
            segtree[2*v+1] = {max(segtree[v].f, segtree[2*v+1].f), min(segtree[v].s, segtree[2*v+1].s)};
        segtree[v] = {0, INT_MAX};
    }
}
void update1(int v, int l, int r, int tl, int tr, int val)
{
    push1(v, l, r);
    if(l > r || l > tr || r < tl)
        return;
    if(tl <= l && r <= tr)
    {
        if(l == r){
            segtree[v] = {max(val, segtree[v].f), max(val, segtree[v].f)};
            return;
        }
        segtree[v] = {val, LLONG_MAX};
        push1(v, l, r);
        return;
    }
    int mid = (l + r) / 2;
    update1(2*v, l, mid, tl, tr, val);
    update1(2*v+1, mid+1, r, tl, tr, val);
}
void update2(int v, int l, int r, int tl, int tr, int val)
{
    push1(v, l, r);
    if(l > r || l > tr || r < tl)
        return;
    if(tl <= l && r <= tr)
    {
        if(l == r){
            segtree[v] = {min(val, segtree[v].f), min(val, segtree[v].f)};
            return;
        }
        segtree[v] = {0, val};
        push1(v, l, r);
        return;
    }
    int mid = (l + r) / 2;
    update2(2*v, l, mid, tl, tr, val);
    update2(2*v+1, mid+1, r, tl, tr, val);
}
void findres(int v, int l, int r)
{
    if(l == r)
        res[l] = segtree[v].f;
    else
    {
        int mid = (l + r) / 2;
        findres(2*v, l, mid);
        findres(2*v+1, mid+1, r);
    }
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    build(1, 1, n);
    for(int i = 0; i < k; i++)
    {
        if(op[i] == 1)
            update1(1, 1, n, left[i]+1, right[i]+1, height[i]);
        else
            update2(1, 1, n, left[i]+1, right[i]+1, height[i]);
    }
    findres(1, 1, n);
    for(int i = 0; i < n; i++)
        finalHeight[i] = res[i+1];
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 29.0

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

Subtask #4
0 / 39.0

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