Submission #880037

#	Time	Username	Problem	Language	Result	Execution time	Memory
880037		efedmrlr	Sails (IOI07_sails)	C++17	100 / 100	270 ms	5640 KiB

sails

#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 = 1e9+500;
const int N = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;

struct SegTree {
    vector<int> data;
    int sz;
    SegTree(int sz) {
        this->sz = sz;
        data.assign(4*(sz + 3), 0);
    }
    void update(int tl, int tr, int v, int l, int r, int val) {
        if(tl >= l && tr <= r) {
            data[v] += val;
            return;
        }
        if(tl > r || tr < l) return;
        int tm = (tl + tr) >> 1;
        update(tl, tm, v*2, l, r, val);
        update(tm + 1, tr, v*2+1, l, r, val);
        return;
    }
    void update(int l, int r, int val) {
        update(0, sz, 1, l , r, val);
    }
    int query(int tl, int tr, int v, int ind) {
        if(tl == tr) return data[v];
        int tm = (tl + tr) >> 1;
        if(ind <= tm) {
            return data[v] + query(tl, tm, v*2, ind);
        }
        else {
            return data[v] + query(tm + 1, tr, v*2+1, ind);
        }
    }
    int query(int ind) {
        return query(0, sz, 1, ind);
    }

    int find_rb(int x, int tl, int tr) {
        while(tl < tr) {
            int tm = (tl + tr) >> 1;
            if(query(tm) <= x) {
                tl = tm + 1;
            }
            else {
                tr = tm;
            }
        }
        int tmp = query(tl);
        if(tmp == x) {
            return tl;
        }
        else if(tmp > x) {
            return tl - 1;
        }
        return tl + 1;
    }
    int find_lb(int x, int tl, int tr) {
        while(tl < tr) {
            int tm = (tl + tr) >> 1;
            if(query(tm) < x) {
                tl = tm + 1;
            }
            else {
                tr = tm;
            }
        }
        int tmp = query(tl);
        if(tmp == x) {
            return tl;
        }
        else if(tmp > x) {
            return tl - 1;
        }
        return tl + 1;
        
    }
    void print() {
        cout<<"seg:";
        for(int i = 0; i<=sz; i++) {
            cout<<query(i)<<" ";
        }
        cout<<"\n";
    }
};

int MAXX = 0;
vector<array<int,2> > els;
inline void solve() {
    cin>>n;
    els.resize(n);
    REP(i,n) {
        
        cin>>els[i][0]>>els[i][1];
        MAXX = max(MAXX, els[i][0]);
    }
    sort(els.begin(), els.end());
    SegTree st(MAXX);
    for(auto cur : els) {
        int beg = MAXX - cur[0];
        int last = beg + cur[1] - 1ll;
        int fin = st.query(last);
        int lb = st.find_lb(fin, beg, MAXX - 1ll);
        int rb = st.find_rb(fin, beg, MAXX - 1ll);
        int cnt = last - lb + 1;
        // dbg(beg); dbg(last);
        // dbg(fin);
        // dbg(lb);
        // dbg(rb);
        // dbg(cnt);
        st.update(beg, last - cnt, 1);
        st.update(rb - cnt + 1, rb, 1);
        // st.print();
        // cout<<"\n\n";
    }
    int ans = 0ll;
    for(int i = 0; i<MAXX; i++) {
        int tmp = st.query(i);
        ans += tmp * (tmp - 1ll) / 2ll;
    }
    cout<<ans<<"\n";
}
 
signed main() {
    //fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message (stderr)

sails.cpp: In function 'std::string to_string(std::string, int, int)':
sails.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...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
sails.cpp: In function 'void solve()':
sails.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
sails.cpp:118:5: note: in expansion of macro 'REP'
  118 |     REP(i,n) {
      |     ^~~

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10
• Subtask 11: 10 / 10