Submission #1696168


Source Code Expand

#include<bits/stdc++.h>
#define ll long long

using namespace std;

const ll INF = 100000;

ll MAX_SIZE;
ll segMax[400005],segAdd[400005];


struct StarrySkyTree{

    StarrySkyTree(){}
    StarrySkyTree(int n){
        MAX_SIZE = 1;
        while(MAX_SIZE < n)MAX_SIZE *= 2;
    }

    void add(int a, int b, int x, int k = 0, int l = 0, int r = MAX_SIZE){
        if(r <= a || b <= l)return;

        if(a <= l && r <= b){
            segAdd[k] += x;
            return;
        }
        add(a, b, x, k * 2 + 1, l, (l + r) / 2);
        add(a, b, x, k * 2 + 2, (l + r) / 2, r);

        segMax[k] = max(segMax[k * 2 + 1] + segAdd[k * 2 + 1], segMax[k * 2 + 2] + segAdd[k * 2 +2]);
    }

    ll getMax(int a, int b, int k = 0, int l = 0, int r = MAX_SIZE){
        if(r <= a || b <= l)return 0;
        if(a <= l && r <= b)return (segMax[k] + segAdd[k]);

        ll left = getMax(a, b, k * 2 + 1, l, (l + r) / 2);
        ll right = getMax(a, b, k * 2 + 2, (l + r) / 2, r);

        return (max(left, right) + segAdd[k]);
    }
};

ll fi[100005],af[100005];

int main(){
    StarrySkyTree st(100004);
    int n;
    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        cin >> fi[i] >> af[i];
        st.add(fi[i], af[i], 1);
    }
    ll ans = INF;
    for(int i = 0; i < n; i++){
        st.add(fi[i], af[i], -1);
        ans = min(ans, st.getMax(0, MAX_SIZE));
        st.add(fi[i], af[i], 1);
    }
    printf("%d\n", ans);
    return 0;
}

Submission Info

Submission Time
Task D - 足ゲームII
User hanahana
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1513 Byte
Status AC
Exec Time 169 ms
Memory 6272 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:60:23: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
     printf("%d\n", ans);
                       ^
./Main.cpp:49:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 34
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 2 ms 4352 KB
01-02.txt AC 1 ms 4480 KB
01-03.txt AC 2 ms 4480 KB
01-04.txt AC 4 ms 4736 KB
01-05.txt AC 166 ms 6272 KB
01-06.txt AC 165 ms 6272 KB
01-07.txt AC 165 ms 6272 KB
01-08.txt AC 166 ms 6272 KB
01-09.txt AC 166 ms 6272 KB
01-10.txt AC 2 ms 4736 KB
01-11.txt AC 166 ms 6272 KB
01-12.txt AC 169 ms 6272 KB
01-13.txt AC 167 ms 6272 KB
01-14.txt AC 168 ms 6272 KB
01-15.txt AC 6 ms 4736 KB
01-16.txt AC 165 ms 6272 KB
01-17.txt AC 165 ms 6272 KB
01-18.txt AC 165 ms 6272 KB
01-19.txt AC 165 ms 6272 KB
01-20.txt AC 5 ms 4736 KB
01-21.txt AC 161 ms 6272 KB
01-22.txt AC 161 ms 6272 KB
01-23.txt AC 161 ms 6272 KB
01-24.txt AC 104 ms 5888 KB
01-25.txt AC 2 ms 4352 KB
01-26.txt AC 2 ms 4352 KB
01-27.txt AC 110 ms 5888 KB
01-28.txt AC 110 ms 5888 KB
sample-01.txt AC 2 ms 4352 KB
sample-02.txt AC 2 ms 4352 KB
sample-03.txt AC 2 ms 4352 KB