Submission #1735959
Source Code Expand
#include<set> #include<map> #include<deque> #include<queue> #include<stack> #include<cmath> #include<ctime> #include<bitset> #include<string> #include<vector> #include<cstdio> #include<cstdlib> #include<cstring> #include<climits> #include<complex> #include<iostream> #include<algorithm> #define ll long long #define inf 1e10 using namespace std; const int maxn = 210000; int n; multiset<ll>ql,qr; multiset<ll>::iterator it; ll addL,addR,len,re; int main() { scanf("%d",&n); for(int i=1,las=0;i<=n;i++,las=len) { ll l,r; scanf("%lld%lld",&l,&r); len=r-l; if(i==1) { ql.insert(-inf); ql.insert(l); qr.insert(inf); qr.insert(l); continue; } addL-=len,addR+=las; ll pl=*ql.rbegin()+addL,pr=*qr.begin()+addR; if(l<pl) { it=ql.end();it--; ql.erase(it); ql.insert(l-addL); ql.insert(l-addL); re+=pl-l; qr.insert(pl-addR); } else if(l<=pr) ql.insert(l-addL),qr.insert(l-addR); else { it=qr.begin(); qr.erase(it); qr.insert(l-addR); qr.insert(l-addR); re+=l-pr; ql.insert(pr-addL); } } printf("%lld\n",re); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - NarrowRectangles |
User | lichangdongtw |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1149 Byte |
Status | AC |
Exec Time | 90 ms |
Memory | 9600 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:31:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:34:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] ll l,r; scanf("%lld%lld",&l,&r); ^
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | 700 / 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 | 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 | 83 ms | 9600 KB |
2_019.txt | AC | 83 ms | 9600 KB |
2_020.txt | AC | 73 ms | 9600 KB |
2_021.txt | AC | 53 ms | 9600 KB |
2_022.txt | AC | 53 ms | 9600 KB |
2_023.txt | AC | 56 ms | 9600 KB |
2_024.txt | AC | 54 ms | 9600 KB |
2_025.txt | AC | 54 ms | 9600 KB |
2_026.txt | AC | 53 ms | 9600 KB |
2_027.txt | AC | 54 ms | 9600 KB |
2_028.txt | AC | 54 ms | 9600 KB |
2_029.txt | AC | 54 ms | 9600 KB |
2_030.txt | AC | 54 ms | 9600 KB |
2_031.txt | AC | 89 ms | 9600 KB |
2_032.txt | AC | 90 ms | 9600 KB |
2_033.txt | AC | 88 ms | 9600 KB |
2_034.txt | AC | 89 ms | 9600 KB |
2_035.txt | AC | 66 ms | 9600 KB |
2_036.txt | AC | 77 ms | 9600 KB |