oj.uz

답안 #885775

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885775 2023-12-10T16:33:09 Z AlphaMale06 Sails (IOI07_sails) C++14
25 / 100
 494 ms 3824 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=2*v+2;
    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;
        }
        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< 10; i++){
        int gt=Get(0, 0, N-1, i);
        ans+=gt*(gt-1);
    }
    cout << ans/2 << '\n';
}

Compilation message

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
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 360 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 1104 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 62 ms 1460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 213 ms 2128 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 376 ms 3516 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 342 ms 3668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 494 ms 3824 KB Output isn't correct
2 Halted 0 ms 0 KB -