oj.uz

Submission #885766

# Submission time Handle Problem Language Result Execution time Memory
885766 2023-12-10T16:16:03 Z AlphaMale06 Sails (IOI07_sails) C++14
0 / 100
 605 ms 5152 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define F first
#define S second

const int N = 100003;
int st[4*N];

void Push(int v){
    if(!st[v])return;
    int rc=v+1>>1;
    int lc=rc-1;
    st[lc]+=st[v];
    st[rc]+=st[v];
    st[v]=0;
}

int Get(int v, int l, int r, int ind){
    if(l>r || l>ind || r<ind)return 0;
    if(l==r)return st[v];
    Push(v);
    int mid=l+r>>1;
    return Get(2*v+1, l, mid, ind)+Get(2*v+2, mid+1, r, ind);
}
void Update(int v, int l, int r, int L, int R){
    if(l>r || l>R || r<L)return;
    if(l>=L && r<=R){
        st[v]++;
        return;
    }
    Push(v);
    int mid=l+r>>1;
    Update(2*v+1, l, mid, L, R);
    Update(2*v+2, mid+1, r, L, R);
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    pair<int, int> a[n];
    for(int i=0; i< n; i++)cin >> a[i].F >> a[i].S;
    sort(a, a+n);
    for(int i=0; i< n; i++){
        int ind=a[i].F-a[i].S;
        int val=Get(0, 0, N-1, ind);
        int l=0; int r=ind;
        int mnind=0;
        while(l<=r){
            int s=l+r>>1;
            int gt=Get(0, 0, N-1, s);
            if(gt==val){
                r=s-1;
                mnind=s;
            }
            else l=s+1;
        }
        l=ind; r=a[i].F-1;
        int mxind=0;
        while(l<=r){
            int s=l+r>>1;
            int gt=Get(0, 0, N-1, s);
            if(gt==val){
                l=s+1;
                mxind=s;
            }
            else r=s-1;
        }
        if(mxind==a[i].F-1){
            Update(0, 0, N-1, mxind-a[i].S+1, mxind);
        }
        else{
            Update(0, 0, N-1, mxind+1, a[i].F-1);
            Update(0, 0, N-1, mnind, mnind+a[i].S-a[i].F+mxind);
        }
    }
    int ans=0;
    for(int i=0; i< N; i++){
        int gt=Get(0, 0, N-1, i);
        ans+=gt*(gt-1);    }
    cout << ans/2 << '\n';
}

Compilation message

sails.cpp: In function 'void Push(long long int)':
sails.cpp:15:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   15 |     int rc=v+1>>1;
      |            ~^~
sails.cpp: In function 'long long int Get(long long int, long long int, long long int, long long int)':
sails.cpp:26:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |     int mid=l+r>>1;
      |             ~^~
sails.cpp: In function 'void Update(long long int, long long int, long long int, long long int, long long int)':
sails.cpp:36:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   36 |     int mid=l+r>>1;
      |             ~^~
sails.cpp: In function 'int main()':
sails.cpp:56:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |             int s=l+r>>1;
      |                   ~^~
sails.cpp:67:20: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   67 |             int s=l+r>>1;
      |                   ~^~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 1156 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 73 ms 1644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 279 ms 2776 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 502 ms 4352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 479 ms 4704 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 605 ms 5152 KB Output isn't correct
2 Halted 0 ms 0 KB -