Submission #1729098


Source Code Expand

#include <bits/stdc++.h>
#define pb push_back
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<double> vd;

int main() {
    int i, n;
    ll val, dshift, ushift, uv, dv;
    scanf("%d", &n);
    vll l(n), r(n);
    for(i=0; i<n; i++) scanf("%lld%lld", &l[i], &r[i]);
    priority_queue<ll, vector<ll>, less<ll>> down;
    priority_queue<ll, vector<ll>, greater<ll>> up;
    down.push(l[0]);
    up.push(l[0]);
    val=dshift=ushift=0;
    for(i=1; i<n; i++) {
        dshift-=r[i]-l[i];
        ushift+=r[i-1]-l[i-1];
        dv=down.top()+dshift;
        uv=up.top()+ushift;
        if(l[i]>=dv && l[i]<=uv) {
            down.push(l[i]-dshift);
            up.push(l[i]-ushift);
        }
        else if(l[i]<=dv) {
            val+=min(abs(l[i]-dv), abs(l[i]-uv));
            down.pop();
            up.push(dv-ushift);
            down.push(l[i]-dshift);
            down.push(l[i]-dshift);
        }
        else {
            val+=min(abs(l[i]-dv), abs(l[i]-uv));
            up.pop();
            down.push(uv-dshift);
            up.push(l[i]-ushift);
            up.push(l[i]-ushift);
        }
    }
    printf("%lld\n", val);
    return 0;
}

Submission Info

Submission Time
Task E - NarrowRectangles
User Ajira
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1422 Byte
Status AC
Exec Time 37 ms
Memory 3572 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:21:55: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(i=0; i<n; i++) scanf("%lld%lld", &l[i], &r[i]);
                                                       ^

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 700 / 700
Status
AC × 5
AC × 13
AC × 37
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt
Subtask 0_000, 0_001, 0_004, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 2_018.txt, 2_019.txt, 2_020.txt, 2_021.txt, 2_022.txt, 2_023.txt, 2_024.txt, 2_025.txt, 2_026.txt, 2_027.txt, 2_028.txt, 2_029.txt, 2_030.txt, 2_031.txt, 2_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
0_003.txt AC 1 ms 256 KB
0_004.txt AC 1 ms 256 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 1 ms 256 KB
1_008.txt AC 1 ms 256 KB
1_009.txt AC 1 ms 256 KB
1_010.txt AC 1 ms 256 KB
1_011.txt AC 1 ms 256 KB
1_012.txt AC 1 ms 256 KB
1_013.txt AC 1 ms 256 KB
1_014.txt AC 1 ms 256 KB
1_015.txt AC 1 ms 256 KB
1_016.txt AC 1 ms 256 KB
1_017.txt AC 1 ms 256 KB
2_018.txt AC 30 ms 3572 KB
2_019.txt AC 28 ms 3572 KB
2_020.txt AC 26 ms 3572 KB
2_021.txt AC 34 ms 3524 KB
2_022.txt AC 34 ms 3480 KB
2_023.txt AC 34 ms 3476 KB
2_024.txt AC 34 ms 3528 KB
2_025.txt AC 34 ms 3476 KB
2_026.txt AC 34 ms 3572 KB
2_027.txt AC 34 ms 3572 KB
2_028.txt AC 34 ms 3528 KB
2_029.txt AC 34 ms 3524 KB
2_030.txt AC 34 ms 3540 KB
2_031.txt AC 36 ms 3528 KB
2_032.txt AC 36 ms 3544 KB
2_033.txt AC 36 ms 3508 KB
2_034.txt AC 37 ms 3512 KB
2_035.txt AC 33 ms 3572 KB
2_036.txt AC 30 ms 3572 KB