| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 604767 | HediChehaidar | 벽 (IOI14_wall) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
ll st[(int)5e6 + 10];
ll lmx[(int)5e6 + 10];
ll lmn[(int)5e6 + 10];
int rq(int pos , int l , int r , int i){
if(lmx[pos]){
st[pos] = max(st[pos] , lmx[pos]);
if(l != r){
lmx[2 * pos + 1] = max(lmx[2 * pos + 1] , lmx[pos]);
lmx[2 * pos + 2] = max(lmx[2 * pos + 2] , lmx[pos]);
}
lmx[pos] = 0;
}
if(lmn[pos] != inf){
st[pos] = min(st[pos] , lmn[pos]);
if(l != r){
lmn[2 * pos + 1] = min(lmn[2 * pos + 1] , lmn[pos]);
lmn[2 * pos + 2] = min(lmn[2 * pos + 2] , lmn[pos]);
}
lmn[pos] = inf;
}
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 p2;
}
void update(int pos , int l ,int r , int i , int j , int t , ll w){
if(lmx[pos]){
st[pos] = max(st[pos] , lmx[pos]);
if(l != r){
lmx[2 * pos + 1] = max(lmx[2 * pos + 1] , lmx[pos]);
lmx[2 * pos + 2] = max(lmx[2 * pos + 2] , lmx[pos]);
}
lmx[pos] = 0;
}
if(lmn[pos] != inf){
st[pos] = min(st[pos] , lmn[pos]);
if(l != r){
lmn[2 * pos + 1] = min(lmn[2 * pos + 1] , lmn[pos]);
lmn[2 * pos + 2] = min(lmn[2 * pos + 2] , lmn[pos]);
}
lmn[pos] = inf;
}
if(i > r || j < l) return;
if(i <= l && j >= r){
if(t) {
st[pos] = min(st[pos] , w);
if(l != r){
lmn[ 2 *pos + 1] = min(lmn[2 * pos + 1], w);
lmn[ 2 *pos + 2] = min(lmn[2 * pos + 2], w);
}
}
else{
st[pos] = max(st[pos] , w);
if(l != r){
lmx[2 * pos + 1] = max(lmx[2 * pos + 1] , w);
lmx[2 * pos + 2] = max(lmx[2 * pos + 2] , w);
}
}
return;
}
update(2 * pos + 1 , l , (l+r) / 2 , i , j , t , w); update(2 * pos + 2 , (l+r) / 2 + 1 , r , i , j , t , w);
}
void buildWall(int n, int k, vi op, vi left, vi right, vi height, vi finalHeight){
for(int i = 0 ; i < 5e6 ; i++) lmn[i] = inf;
for(int i = 0 ; i < k ; i++){
update(0 , 0 , n - 1 , left[i] , right[i] , op[i] == 2 , height[i] );
}
for(int i = 0 ; i < n ; i++) finalHeight[i] = rq(0 , 0 , n - 1 , i);
return ;
}
/*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;
vi op(k) , left(k) , right(k) , height(k) , v;
for(int i = 0 ; i < k ; i++) cin>>op[i]>>left[i]>>right[i]>>height[i];
buildWall(n , k , op , left , right , 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 !
*/