제출 #604834

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
604834		HediChehaidar	벽 (IOI14_wall)	C++17	32 / 100	438 ms	39688 KiB

wall

#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define dte  tuple<double , double , double>
using namespace std;
const int INF = 1000*1000*1000; // 1 e 9
const int MOD = 1e9 + 7;//998244353 ;
const double EPS = 0.000000001; // 1 e -9
const ll inf = (ll)1e18;

int st[(int)5e6 + 10];
int lazy[(int)5e6 + 10];
int rq(int pos , int l , int r , int i){
    if(i > r || i < l ) return -1;
    if(l == r) return st[pos];
    int p1 = rq(2 * pos + 1 , l , (l+r) / 2 , i ) , p2 = rq(2 * pos + 2 , (l+r) / 2 + 1 , r , i);
    if(p1 == -1) return p2;
    return p1;
}
void update2(int pos , int l , int r , int i, int j , int w){
    if(l != r){
        lazy[2 * pos + 1] = min(lazy[2 * pos + 1] , lazy[pos]);
        lazy[2 * pos + 2] = min(lazy[2 * pos + 2] , lazy[pos]);
    }
    if(i > r || j < l) return;
    if(i <= l && j >= r){
        if(l == r){
            st[pos] = min(st[pos] , w);
            st[pos] = min(st[pos] , lazy[pos]);
        }
        if(l != r){
            lazy[2 * pos + 2] = min(lazy[2 * pos + 2] , w);
            lazy[2 * pos + 1] = min(lazy[2 * pos + 1] , w);
        }
        return ;
    }
    update2(2 * pos + 1 , l , (l+r) / 2 , i , j , w); update2(2 * pos + 2 , (l+r) / 2 + 1 , r , i, j , w);
}
void update(int pos , int l , int r , int i, int j , int w){
    if(l != r) {
        lazy[2 * pos + 1] = max(lazy[2 * pos + 1] , lazy[pos]);
        lazy[2 * pos + 2] = max(lazy[2 * pos + 2] , lazy[pos]);
    }
    if(i > r || j < l) return;
    if(i <= l && j >= r){
        if(l == r){
            st[pos] = max(st[pos] , w);
            st[pos] = max(st[pos] , lazy[pos]);
        }
        if(l != r){
            lazy[2 * pos + 2] = max(lazy[2 * pos + 2] , w);
            lazy[2 * pos + 1] = max(lazy[2 * pos + 1] , w);
        }
        return ;
    }
    update(2 * pos + 1 , l , (l+r) / 2 , i , j , w); update(2 * pos + 2 , (l+r) / 2 + 1 , r , i, j , w);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
    for(int i = 0 ; i < n ; i++) finalHeight[i] = 0;
    if(n <= 1e4 && k <= 5000){
        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]);
            }
        }
        //for(int i = 0 ; i < n ; i++) cout << finalHeight[i] << " " ; cout << "\n";
        return;
    }
    bool ok = false;
    for(int i = 0 ; i < k ; i++){
        if(op[i] == 2){
            if(!ok){
                for(int j = 0 ; j < n ; j++) update(0 , 0 , n - 1 , j , j,  0);
                ok = true; for(int j = 0 ; j < 5e6 ; j++) lazy[j] = MOD;
            }
            update2(0 , 0 , n - 1 , left[i] , right[i] , height[i]);
            if(i == k - 1) for(int j = 0 ; j < n ; j++) update2(0 , 0 , n - 1 , j , j , INF);
        }
        else{
            update(0 , 0 , n - 1 , left[i] , right[i] , height[i] );
        }
    }

    for(int i = 0 ; i < n ; i++) finalHeight[i] = rq(0 , 0 , n - 1 , i);
    //for(int i = 0 ; i < n ; i++) cout << finalHeight[i] << " " ; cout << "\n";
    return ;
}
int op[101];
int l[101];
int r[101];
int height[101];
int v[101];
/*int main(){
    //ifstream fin ("testing.txt");
    //ofstream fout ("output.txt");
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int  n , k; cin>>n>>k;
    for(int i = 0 ; i < k ; i++) cin>>op[i]>>l[i]>>r[i]>>height[i];
    buildWall(n , k , op , l , r , height , v);
    //for(auto c : v) cout << c << " "; cout << "\n";
    return 0;
}*/
/*
10 6
1 1 8 4
2 4 9 1
2 3 6 5
1 0 5 3
1 2 2 5
2 6 7 0
*/
/*
    Think of : BS / DFS / BFS / SSSP / SCC / MSP / MAX FLOW / TOPSORT / LCA / MATRIX / DP(bitmask) / 2 POINTERS / SEG TREE / MATH / UN FIND / MO / HLD
    Read the statement CAREFULLY !!
    Make a GREADY APPROACH !!!! (start from highest / lowest)
    Make your own TESTS !!
    Be careful from CORNER CASES !
*/

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