oj.uz

답안 #1016588

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016588 2024-07-08T08:36:02 Z n3rm1n 벽 (IOI14_wall) C++17
8 / 100
 231 ms 21748 KB 
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN = 1e5 + 10;
int nn, kk;
int lazy_max[4 * MAXN], lazy_min[4 * MAXN];
int add[MAXN], rem[MAXN];
int ql, qr, h;

void makeit(int i, int l, int r)
{
    lazy_max[i] = -1;
    lazy_min[i] = 1e6;
    if(l == r)
    {
        return;
    }
    int mid = (l + r)/2;
    makeit(2*i, l, mid);
    makeit(2*i+1, mid+1, r);

}
void update_maxx(int i, int l, int r)
{
    if(ql <= l && r <= qr)
    {
        lazy_max[i] = max(lazy_max[i], h);
        return;
    }
    if(ql > r || qr < l)
        return;
    int mid = (l + r)/2;
    update_maxx(2*i, l, mid);
    update_maxx(2*i+1, mid+1, r);
}

void update_minn(int i, int l, int r)
{
    if(ql <= l && r <= qr)
    {
        lazy_min[i] = min(lazy_min[i], h);
        return;
    }
    if(ql > r || qr < l)
        return;
    int mid = (l + r)/2;
    update_minn(2*i, l, mid);
    update_minn(2*i+1, mid+1, r);
}
void build_add(int i, int l, int r, int move_down)
{
    if(l == r)
    {
        add[l] = max(lazy_max[i], move_down);
        return ;
    }
    int mid = (l + r)/2;

    build_add(2*i, l, mid, max(move_down, lazy_max[i]));
    build_add(2*i+1, mid+1, r, max(move_down, lazy_max[i]));
}
void build_rem(int i, int l, int r, int move_down)
{
    if(l == r)
    {
        rem[l] = min(lazy_min[i], move_down);
        return;
    }
    int mid = (l + r)/2;

    build_rem(2*i, l, mid, min(move_down, lazy_min[i]));
    build_rem(2*i+1, mid+1, r, min(move_down, lazy_min[i]));
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
    if(n <= 10000)
    {
        for (int i = 0; i < k; ++ i)
        {

            for (int j = left[i]; j <= right[i]; ++ j)
            {
                if(op[i] == 1)finalHeight[j] = max(finalHeight[j], height[i]);
                else finalHeight[j] = min(finalHeight[j], height[i]);
            }
        }
        return;
    }
    makeit(1, 0, n-1);
    for (int i = 0; i < k; ++ i)
    {
        ql = left[i];
        qr = right[i];
        h = height[i];
        if(op[i] == 1)
        {
            update_maxx(1, 0, n-1);
        }
        else update_minn(1, 0, n-1);
    }
    build_add(1, 0, n-1, -1);
    build_rem(1, 0, n-1, 1e6);
    for (int i = 0; i < n; ++ i)
    {
        finalHeight[i] = add[i];
        finalHeight[i] = min(finalHeight[i], rem[i]);
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 13 ms 556 KB Output is correct
5 Correct 14 ms 604 KB Output is correct
6 Correct 13 ms 556 KB Output is correct

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 106 ms 8248 KB Output is correct
3 Correct 90 ms 6128 KB Output is correct
4 Incorrect 220 ms 21564 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 19 ms 560 KB Output is correct
5 Correct 13 ms 560 KB Output is correct
6 Correct 13 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 76 ms 8192 KB Output is correct
9 Correct 79 ms 5968 KB Output is correct
10 Incorrect 231 ms 21700 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 13 ms 552 KB Output is correct
5 Correct 15 ms 604 KB Output is correct
6 Correct 15 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 78 ms 8224 KB Output is correct
9 Correct 79 ms 5972 KB Output is correct
10 Incorrect 218 ms 21748 KB Output isn't correct
11 Halted 0 ms 0 KB -