oj.uz

Submission #863407

# Submission time Handle Problem Language Result Execution time Memory
863407 2023-10-20T07:35:02 Z 8pete8 Sails (IOI07_sails) C++14
100 / 100
 104 ms 2664 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<pii,pii>
#define vi vector<int>
#define pb push_back
//#define p push
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define int long long
const int mod=9901,mxn=2*1e5+5,inf=1e18,lg=25,minf=-1e18;
int fwk[mxn+10];
void update(int pos,int val){for(int i=pos;i<mxn;i+=(i&-i))fwk[i]+=val;}
int qry(int pos){
    int sum=0;
    for(int i=pos;i>0;i-=(i&-i))sum+=fwk[i];
    return sum;
}
int32_t main(){
    int n;cin>>n;
    vector<pii>v(n);
    for(int i=0;i<n;i++)cin>>v[i].f>>v[i].s;
    sort(all(v));
    for(auto i:v){
        int cmn=qry(i.f-i.s+1);
        int l=1,r=i.f;
        int pos=minf;
        while(l<=r){
            int mid=l+(r-l)/2;
            if(qry(mid)>=cmn)l=mid+1,pos=max(pos,mid);
            else r=mid-1;
        }
        update(pos+1,1);
        update(i.f+1,-1);
        int diff=i.s-(i.f-pos);
        if(diff<=0)continue;
        l=1,r=i.f;
        int pos2=inf;
        while(l<=r){
            int mid=l+(r-l)/2;
            if(qry(mid)<=cmn)r=mid-1,pos2=min(pos2,mid);
            else l=mid+1;
        }
        update(pos2,1);
        update(pos2+diff,-1);
    }
    int ans=0,k;
    for(int i=1;i<mxn;i++){
        k=qry(i)-1;
        ans+=(k*(k+1))/2;
    }
    cout<<ans;
    
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 604 KB Output is correct
2 Correct 23 ms 920 KB Output is correct

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1616 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 2396 KB Output is correct
2 Correct 72 ms 2384 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 2520 KB Output is correct
2 Correct 62 ms 2548 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 2664 KB Output is correct
2 Correct 70 ms 2128 KB Output is correct