Submission #1294749
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; int N; vector<pii> S; multiset<ll> L, R; ll C, lp, rp; int main() { scanf("%d", &N); S.resize(N); for(int i = 0; i < N; i++) { scanf("%d %d", &S[i].first, &S[i].second); } L.insert(-S[0].first); R.insert(S[0].first); C = lp = rp = 0; for(int i = 1; i < N; i++) { int plen = S[i - 1].second - S[i - 1].first; int clen = S[i].second - S[i].first; ll x = S[i].first; /* set<int>::iterator it; cout << "L : "; for(it = L.begin(); it != L.end(); it++) { cout << -lp - *it << ' '; } cout << endl; cout << "R : "; for(it = R.begin(); it != R.end(); it++) { cout << rp + *it << ' '; } cout << endl; //*/ lp += clen; rp += plen; if(-lp - *L.begin() <= x && x <= rp + *R.begin()) { L.insert(-lp - x); R.insert(-rp + x); } else if(x < -lp - *L.begin()) { ll tx = -lp - *L.begin(); L.erase(L.begin()); L.insert(-lp - x); ll ttx = -lp - *L.begin(); R.insert(-rp + tx); C += tx - ttx; } else if(rp + *R.begin() < x) { ll tx = rp + *R.begin(); R.erase(R.begin()); R.insert(-rp + x); ll ttx = rp + *R.begin(); L.insert(-lp - tx); C += ttx - tx; } } printf("%lld", C); }
Submission Info
Submission Time | |
---|---|
Task | E - NarrowRectangles |
User | choikiwon |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1618 Byte |
Status | WA |
Exec Time | 74 ms |
Memory | 10368 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:12:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:15:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d", &S[i].first, &S[i].second); ^
Judge Result
Set Name | Sample | Subtask | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | 0 / 700 | ||||||||||
Status |
|
|
|
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 | WA | 1 ms | 256 KB |
1_007.txt | AC | 1 ms | 256 KB |
1_008.txt | WA | 1 ms | 256 KB |
1_009.txt | WA | 1 ms | 256 KB |
1_010.txt | WA | 1 ms | 256 KB |
1_011.txt | WA | 1 ms | 256 KB |
1_012.txt | WA | 1 ms | 256 KB |
1_013.txt | WA | 1 ms | 256 KB |
1_014.txt | WA | 1 ms | 256 KB |
1_015.txt | WA | 1 ms | 256 KB |
1_016.txt | WA | 1 ms | 256 KB |
1_017.txt | WA | 1 ms | 256 KB |
2_018.txt | AC | 49 ms | 8064 KB |
2_019.txt | WA | 62 ms | 8064 KB |
2_020.txt | AC | 72 ms | 10368 KB |
2_021.txt | WA | 47 ms | 8448 KB |
2_022.txt | WA | 46 ms | 8448 KB |
2_023.txt | WA | 46 ms | 8448 KB |
2_024.txt | WA | 47 ms | 8448 KB |
2_025.txt | WA | 46 ms | 8448 KB |
2_026.txt | WA | 47 ms | 8448 KB |
2_027.txt | WA | 46 ms | 8448 KB |
2_028.txt | WA | 46 ms | 8448 KB |
2_029.txt | WA | 46 ms | 8448 KB |
2_030.txt | WA | 46 ms | 8448 KB |
2_031.txt | WA | 61 ms | 5760 KB |
2_032.txt | WA | 61 ms | 5760 KB |
2_033.txt | WA | 61 ms | 5760 KB |
2_034.txt | WA | 58 ms | 5760 KB |
2_035.txt | WA | 48 ms | 9088 KB |
2_036.txt | AC | 74 ms | 10368 KB |