제출 #874526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
874526		efedmrlr	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	1143 ms	116048 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e12+500;
const int N = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
vector<array<int,2> > a;
set<array<int,2> > st;
struct SegTree {
    vector<array<int,2> > data;
    int sz;
    SegTree(int sz) {
        this->sz = sz;
        data.resize(4*sz);

    }
    void build(int tl ,int tr, int v, vector<int> &arr) {
        if(tl == tr) {
            data[v] = {arr[tl], tl};
            return;
        }
        int tm = (tl + tr) >> 1;
        build(tl, tm, v*2, arr);
        build(tm + 1, tr, v*2+1, arr);
        data[v] = min(data[v*2], data[v*2+1]);
    }
    void build(vector<int> &arr) {
        assert(arr.size() == sz);
        build(0, sz - 1, 1, arr);
    }
    void update(int tl, int tr, int v, int ind ,int val) {
        if(tl == tr) {
            data[v] = {val, ind};
            return;
        }
        int tm = (tl + tr) >> 1;
        if(ind <= tm) {
            update(tl, tm, v*2, ind ,val);
        }
        else {
            update(tm+1, tr ,v*2+1, ind, val);
        }
        data[v] = min(data[v*2], data[v*2+1]);
    }
    void update(int ind, int val) {
        update(0, sz - 1, 1, ind ,val);
    }
    array<int,2> query(int tl, int tr, int v, int l, int r) {
        if(tl >= l && tr <= r) {
            return data[v];
        }
        if(tl > r || tr < l) {
            return {INF, INF};
        }
        int tm = (tl + tr) >> 1;
        return min(query(tl, tm, v*2, l, r) , query(tm+1, tr, v*2+1, l, r));

    }
    array<int,2> query(int l, int r) { 
        return query(0, sz - 1, 1, l , r);
    }

};



inline void solve() {
    cin>>n;
    a.resize(n);
    REP(i,n) {
        cin>>a[i][0]>>a[i][1];
        
    }
    sort(a.begin(), a.end());
    for(int i = 0; i<n; i++) {
        st.insert({a[i][1], i});
    }
    SegTree sums(n), subts(n);
    vector<int> tmp(n);
    REP(i,n) {
        tmp[i] = a[i][1] - a[i][0];
    }
    subts.build(tmp);
    REP(i,n) {
        tmp[i] = a[i][1] + a[i][0];
    }
    sums.build(tmp);
    int ans = 0;
    while(st.size()) {
        auto cur = *prev(st.end());
        ans++;
        st.erase(prev(st.end()));
        subts.update(cur[1], INF);
        sums.update(cur[1], INF);
        while(1) {
            array<int,2> tmp = subts.query(0, cur[1]);
            if(tmp[0] > a[cur[1]][1] - a[cur[1]][0]) {
                break;
            }
            st.erase({a[tmp[1]][1], tmp[1]});
            subts.update(tmp[1], INF);
            sums.update(tmp[1], INF);
        }
        while(1) {
            array<int,2> tmp = sums.query(cur[1], n-1);
            if(tmp[0] > a[cur[1]][1] + a[cur[1]][0]) {
                break;
            }
            st.erase({a[tmp[1]][1], tmp[1]});
            subts.update(tmp[1], INF);
            sums.update(tmp[1], INF);
        }
    }
    cout<<ans<<"\n";

}
 
signed main() {
    //freopen("milkvisits.in", "r", stdin);
    //freopen("milkvisits.out", "w", stdout);
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

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

Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from Main.cpp:1:
Main.cpp: In member function 'void SegTree::build(std::vector<long long int>&)':
Main.cpp:50:27: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   50 |         assert(arr.size() == sz);
      |                ~~~~~~~~~~~^~~~~
Main.cpp: In function 'void solve()':
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:92:5: note: in expansion of macro 'REP'
   92 |     REP(i,n) {
      |     ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:102:5: note: in expansion of macro 'REP'
  102 |     REP(i,n) {
      |     ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:106:5: note: in expansion of macro 'REP'
  106 |     REP(i,n) {
      |     ^~~

• Subtask 1: 10 / 10
• Subtask 2: 23 / 23
• Subtask 3: 36 / 36
• Subtask 4: 31 / 31