oj.uz

답안 #713496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
713496 2023-03-22T09:58:40 Z SlavicG Sails (IOI07_sails) C++17
80 / 100
 1000 ms 9844 KB 
#pragma GCC optimize("O1")
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()
 
#define int long long
 
const int N = 1e5 + 10;
int lazy[4 * N];
struct node {
    int mx, sum, mn;
} t[4 * N];
 
void push(int i, int l, int r) {
    if(!lazy[i]) return;
    t[i].mx += lazy[i];
    t[i].sum += (r - l + 1) * lazy[i];
    t[i].mn += lazy[i];
    if(l != r) {
        lazy[2 * i] += lazy[i];
        lazy[2 * i + 1] += lazy[i];
    }
    lazy[i] = 0;
}
node merge(node a, node b) {
    node c;
    c.mx = max(a.mx, b.mx);
    c.sum = a.sum + b.sum;
    c.mn = min(a.mn, b.mn);
    return c;
}
void modif(int i, int l, int r, int tl, int tr, int val) {
    push(i, l, r);
    if(l > tr || r < tl) return;
    if(l >= tl && r <= tr) {
        lazy[i] += val;
        push(i, l, r);
        return;
    }
    int mid = l + r >> 1;
    modif(2 * i, l, mid, tl, tr, val);
    modif(2 * i + 1, mid + 1, r, tl, tr, val);
    t[i] = merge(t[2 * i], t[2 * i + 1]);
}
node query(int i, int l, int r, int tl, int tr) {
    push(i, l, r);
    if(l > tr || r < tl) return {-1, 0, INT_MAX};
    if(l >= tl && r <= tr) return t[i];
    int mid = l + r >> 1;
    return merge(query(2 * i, l, mid, tl, tr), query(2 * i + 1, mid + 1, r, tl, tr));
}

void solve() {
    int n; cin >> n;
    vector<pair<int, int>> a(n);
    for(int i = 0; i < n; ++i) {
        cin >> a[i].first >> a[i].second;
    }
    ll ans = 0;
    sort(all(a));
    for(int i = 0; i < n; ++i) {
        int UP = a[i].first, DOWN = a[i].first - a[i].second + 1;
        ans += query(1, 0, N - 1, DOWN, UP).sum;
        int mn = query(1, 0, N - 1, DOWN, DOWN).sum;
        int posl = -1, posr = -1;
        int l = 1, r = DOWN;
        while(l <= r) {
            int mid = l + r >> 1;
            if(query(1, 0, N - 1, mid, DOWN).mx == mn) {
                r = mid - 1;
                posl = mid;
            } else {
                l = mid + 1;
            }
        }
        l = DOWN, r = a[i].first;
        while(l <= r) {
            int mid = l + r >> 1;
            if(query(1, 0, N - 1, DOWN, mid).mn == mn) {
                posr = mid;
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        int ln = posr - DOWN + 1;
        modif(1, 0, N - 1, posl, posl + ln - 1, 1);
        a[i].second -= ln;
        if(a[i].second) {
            modif(1, 0, N - 1, posr + 1, posr + a[i].second, 1);
        }
    }
    cout << ans << '\n';
}   
 
int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}

Compilation message

sails.cpp: In function 'void modif(long long int, long long int, long long int, long long int, long long int, long long int)':
sails.cpp:52:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   52 |     int mid = l + r >> 1;
      |               ~~^~~
sails.cpp: In function 'node query(long long int, long long int, long long int, long long int, long long int)':
sails.cpp:61:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   61 |     int mid = l + r >> 1;
      |               ~~^~~
sails.cpp: In function 'void solve()':
sails.cpp:80:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   80 |             int mid = l + r >> 1;
      |                       ~~^~~
sails.cpp:90:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   90 |             int mid = l + r >> 1;
      |                       ~~^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 4 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 700 KB Output is correct
2 Correct 19 ms 8396 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 2952 KB Output is correct
2 Correct 236 ms 1096 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 172 ms 3308 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 564 ms 5196 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1069 ms 9680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 910 ms 9844 KB Output is correct
2 Correct 598 ms 8676 KB Output is correct

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1071 ms 8852 KB Time limit exceeded
2 Halted 0 ms 0 KB -