oj.uz

답안 #986750

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
986750 2024-05-21T07:28:39 Z emad234 벽 (IOI14_wall) C++17
0 / 100
 2497 ms 262144 KB 
#pragma once
#include "bits/stdc++.h"
#define F first
#define S second
#define ll long long
#define pii pair<int,int>
const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = INT_MAX;
using namespace std;
struct range{
    int l,r,h,op;
    friend bool operator<(range a, range b){
        return a.l < b.l;
    }
};
struct event{
    int ty,op,id,val;
};
queue<event>q[mxN];
pii seg[mxN];
int N,s,e;
pii combine(pii a,pii b){
    pii c;
    c.F = min(max(b.F,a.F),b.S);
    c.S = max(min(a.S,b.S),c.F);
    return c;
}
pii query(int l,int r,int ind){
    if(l > e || r < s) return {0,inf};
    if(l >= s && r <= e) return seg[ind];
    int md = (l + r) / 2;
    return combine(query(l,md,ind * 2),query(md + 1,r,ind * 2 + 1));
}
void update(int ind,pii val){
    ind += N;
    seg[ind] = val;
    while(ind /= 2) seg[ind] = combine(seg[ind * 2],seg[ind * 2 + 1]);
}
void printseg(){
    int ex = 1;
    for(int i = 1;i < N * 2;i++){
        cout<<"{ "<<seg[i].F<<" , "<<seg[i].S<<" } ";
        if(ex * 2 - 1 == i){
            ex *= 2;
            cout<<'\n';
        }
    }
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    vector<range>v;
    for(int i = 0;i < k;i++) v.push_back({left[i],right[i],height[i],op[i]});
    sort(v.begin(),v.end());
    N = exp2(ceil(log2(n)));
    for(int i = 1;i <= N * 2;i++){
        seg[i] = {0,inf};
    }
    for(int i = 0;i < v.size();i++){
        auto x = v[i];
        q[x.l].push({1,x.op,i,x.h});
        q[x.r + 1].push({-1,x.op,i,x.h});
    }
    s = 1,e = n;
    for(int i = 0;i < n;i++){
        while(q[i].size()){
            auto u = q[i].front();
            q[i].pop();
            if(u.ty == -1){
                update(u.id,{0,inf});
            }else{
                if(u.op == 1)
                    update(u.id,{u.val,inf});
                else
                    update(u.id,{0,u.val});
            }
        }
        finalHeight[i] = query(1,N,1).F;
    }


}

Compilation message

wall.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
wall.cpp: In function 'void buildWall(int, int, int*, int*, int*, int*, int*)':
wall.cpp:58:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<range>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(int i = 0;i < v.size();i++){
      |                   ~~^~~~~~~~~~

Subtask #1
0 / 8.0

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

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 136772 KB Output is correct
2 Runtime error 2497 ms 262144 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

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

Subtask #4
0 / 39.0

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