oj.uz

Submission #1012866

# Submission time Handle Problem Language Result Execution time Memory
1012866 2024-07-02T19:06:37 Z Cadoc Sails (IOI07_sails) C++14
100 / 100
 70 ms 2900 KB 
/*
    Author: Cadocx
    Codeforces: https://codeforces.com/profile/Kadoc
    VNOJ: oj.vnoi.info/user/Cadoc
*/

#include <bits/stdc++.h>
using namespace std;

// input/output
#define fastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define el cout << '\n'
#define execute cerr << "Time elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << "s"
// #pragma GCC optimize("O2", "unroll-loops", "Ofast")
// #pragma GCC target("avx,avx2,fma")
//data type
#define int128 __uint128_t
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define piv pair<int, vector<int>>
#define vi vector<int>
#define vl vector<ll>
#define vc vector<char>
//STL
#define sz(x) (int)(x).size()
#define for1(i,l,r) for(auto i = l; i <= r; i++)
#define for2(i,r,l) for(auto i = r; i >= l; i--)
#define forin(i,a) for(auto i : a)
#define pb push_back
#define eb emplace_back
#define pf push_front
#define all(x) (x).begin(), (x).end()
#define h first
#define k second
//bitmask
#define bitcnt(n) __builtin_popcount(n)
#define mask(i) (1 << (i))
#define bit(n, i) (((n) >> (i)) & 1)
#define set_on(n, i) ((n) | mask(i))
#define set_off(n, i) ((n) & ~mask(i))
//constant
#define N 100005
#define MOD 1000230007
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define base 31
#define Kadoc 0

int n;
pii a[N];
ll t[N];

void upd(int x, int v){
    for(;x<=N; x+=x&-x) t[x] += v;
}

int get(int x){
    int ans = 0;
    for(;x; x-=x&-x) ans += t[x];
    return ans;
}

void solve(){
    cin >> n;
    for(int i=1; i<=n; ++i) cin >> a[i].h >> a[i].k;

    // nhan xet: ta muon tai moi do cao, so luong canh buom la "deu" nhau nhat co the
    // tham lam bang cach chon ra k thang it buom nhat trong do cao 1 - > h[i] roi tang len 1
    sort(a+1, a+n+1);
    
    for(int i=1; i<=n; ++i){
        int h = a[i].h, k = a[i].k, L, R;

        ll cur = get(h-k+1);

        int l = 0, r = h;
        while(r-l > 1){
            int m = (l+r)>>1;
            if(get(m) <= cur) r = m;
            else l = m;
        }
        L = r;

        l = 1, r = h+1;
        while(r-l > 1){
            int m = (l+r)>>1;
            if(get(m) >= cur) l = m;
            else r = m;
        }
        R = l;

        if(h == k) R = 0;
        upd(R+1, 1);
        upd(h+1, -1);
        upd(L, 1);
        upd(L + R - h + k, -1);
    }

    ll ans = 0;
    for(int i=1; i<=a[n].h; ++i){
        ll cnt = get(i);
        ans += cnt * (cnt-1) / 2;
    }
    el;
    cout << ans;
}

int main(){
    #define NAME "TASK"
    if(fopen(NAME".inp", "r")){
        freopen(NAME".inp", "r", stdin);
        freopen(NAME".out", "w", stdout);
    }

    fastIO;
    
    if(Kadoc){
        int tc; cin >> tc;
        while(tc--){
            solve();
        }
    } else solve();
}

Compilation message

sails.cpp: In function 'int main()':
sails.cpp:113:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |         freopen(NAME".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sails.cpp:114:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |         freopen(NAME".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 816 KB Output is correct
2 Correct 11 ms 852 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1112 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1628 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 2652 KB Output is correct
2 Correct 44 ms 2652 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 2824 KB Output is correct
2 Correct 55 ms 2388 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 2900 KB Output is correct
2 Correct 44 ms 2424 KB Output is correct