제출 #307059

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
307059		ant101	Wall (IOI14_wall)	C++14	100 / 100	1673 ms	219688 KiB

wall

#include "wall.h"
#include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <assert.h>
#include <limits>
#include <cstdio>
#include <complex>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
#define mp make_pair
#define f first
#define s second

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353; // = (119<<23)+1
const int MX = 2e6+5;
const ll INF = 1e18;
const ld PI = 4*atan((ld)1);
const int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};


namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        // cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
        if (sz(s)) {
            setIn(s+".in");
            setOut(s+".out");
        } // for USACO
    }
}

using namespace io;

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }
    
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);
    
    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{",x.f,", ",x.s,"}");
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

using namespace input;

ll add(ll a, ll b) {
    a += b;
    if(a >= MOD) {
        a -= MOD;
    }
    return a;
}
ll sub(ll a, ll b) {
    a -= b;
    if(a < 0) {
        a += MOD;
    }
    return a;
}

ll mul(ll a, ll b) {
    return (a * b)%MOD;
}

void add_self(ll& a, ll b) {
    a = add(a, b);
}
void sub_self(ll& a, ll b) {
    a = sub(a, b);
}
void mul_self(ll& a, ll b) {
    a = mul(a, b);
}


pl lazy[4*MX];
pl t[4*MX];

ll N, K;

// blue = add
// green = delete

void push(ll curr) {
    if (lazy[curr].f != -2) {
//        ps(lazy[curr].f);
        t[curr*2] = {min(max(t[curr*2].f, lazy[curr].f), lazy[curr].s), max(min(t[curr*2].s, lazy[curr].s), lazy[curr].first)};
        t[curr*2+1] = {min(max(t[curr*2+1].f, lazy[curr].f), lazy[curr].s), max(min(t[curr*2+1].s, lazy[curr].s), lazy[curr].first)};
        lazy[curr*2] = {min(max(lazy[curr*2].f, lazy[curr].f), lazy[curr].s), max(min(lazy[curr*2].s, lazy[curr].s), lazy[curr].first)};
        lazy[curr*2+1] = {min(max(lazy[curr*2+1].f, lazy[curr].f), lazy[curr].s), max(min(lazy[curr*2+1].s, lazy[curr].s), lazy[curr].first)};
        lazy[curr] = {-2, 1e14};
    }
}

void upd(ll curr, ll tl, ll tr, ll l, ll r, ll f, ll s) {
    if (l > r) {
        return;
    }
    if (tl == l && tr == r) {
        t[curr] = {min(max(t[curr].f, f), s), max(min(t[curr].s, s), f)};
        lazy[curr] = {min(max(lazy[curr].f, f), s), max(min(lazy[curr].s, s), f)};
        return;
    }
    push(curr);
    ll tm = (tl+tr)/2;
    upd(curr*2, tl, tm, l, min(tm, r), f, s);
    upd(curr*2+1, tm+1, tr, max(l, tm+1), r, f, s);
    t[curr] = {min(t[curr*2].f, t[curr*2+1].f), max(t[curr*2].s, t[curr*2+1].s)};
    
}

pl qry(ll curr, ll tl, ll tr, ll l, ll r) {
    if (l > r) {
        return {1e13, -1};
    }
    if (tl == l && tr == r) {
        return t[curr];
    }
    push(curr);
    ll tm = (tl+tr)/2;
    pl q1 = qry(curr*2, tl, tm, l, min(tm, r));
    pl q2 = qry(curr*2+1, tm+1, tr, max(l, tm+1), r);
    return {min(q1.f, q2.f), max(q1.s, q2.s)};
}

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
    N = n;
    K = k;
    F0R (i, MX*4) {
        lazy[i] = {-1, 1e13};
    }
    F0R (i, K) {
        if (op[i] == 1) {
            upd(1, 1, N, left[i]+1, right[i]+1, height[i], 1e13);
        } else {
            upd(1, 1, N, left[i]+1, right[i]+1, -1, height[i]);
        }
    }
    F0R (i, N) {
        finalHeight[i] = qry(1, 1, N, i+1, i+1).f;
    }
    return;
}

컴파일 시 표준 에러 (stderr) 메시지

wall.cpp: In function 'void io::setIn(std::string)':
wall.cpp:68:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   68 |     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
      |                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
wall.cpp: In function 'void io::setOut(std::string)':
wall.cpp:69:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   69 |     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
      |                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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