Submission #1161263
Source Code Expand
#include<bits/stdc++.h> using namespace std; const int N(222222); typedef long long LL; LL s[N]; int a[N], b[N], le[N], ri[N]; int n, k; LL inf(1ll << 60); inline bool inRange(int x, int le, int ri) { if(le < ri) { return le < x && x < ri; }else { return le < x || x < ri; } } inline int getDis(int x, int ri) { if(x < ri) { return ri - x; }else { return k - x + ri; } } void print(map<int, LL> & mp) { for(auto i : mp) { printf("%d %lld\n", i.first, i.second); } printf("END\n"); } int main() { scanf("%d%d", &n, &k); map<int, LL> mp; LL ans(0); for(int i(1); i <= n; i++) { scanf("%d%d", &a[i], &b[i]); ans += a[i] * 2; s[i] = s[i - 1] + a[i]; if(b[i] == 1 && a[i] * 2 > k) { printf("-1\n"); return 0; } le[i] = (-2 * s[i] % k + k) % k; ri[i] = (-2 * s[i - 1] % k + k) % k; // cout << le[i] << ' ' << ri[i] << endl; if(b[1] == 2 || !inRange(le[i], le[1], ri[1])) { mp[le[i]] = 0; } if(b[1] == 2 || !inRange(ri[i], le[1], ri[1])) { mp[ri[i]] = 0; } } //print(mp); for(int i(2); i <= n; i++) { if(b[i] == 2) continue; LL tmp(inf); for(;;) { auto itr(mp.lower_bound(le[i] + 1)); if(itr != mp.end() && inRange(itr->first, le[i], ri[i])) { tmp = min(tmp, itr->second + getDis(itr->first, ri[i])); mp.erase(itr); }else { break; } } for(;;) { auto itr(mp.lower_bound(ri[i])); if(itr != mp.begin()) { itr--; if(inRange(itr->first, le[i], ri[i])) { tmp = min(tmp, itr->second + getDis(itr->first, ri[i])); mp.erase(itr); }else { break; } }else { break; } } if(tmp != inf) { if(!mp.count(ri[i])) mp[ri[i]] = inf; mp[ri[i]] = min(mp[ri[i]], tmp); } //print(mp); } LL ans1(inf); for(auto i : mp) ans1 = min(ans1, i.second); cout << ans + ans1 << endl; }
Submission Info
Submission Time | |
---|---|
Task | F - Train Service Planning |
User | xyz2606 |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 1906 Byte |
Status | AC |
Exec Time | 100 ms |
Memory | 11648 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:30:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &n, &k); ^ ./Main.cpp:34:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &a[i], &b[i]); ^
Judge Result
Set Name | Sample | All | subtask | subtask2 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | 500 / 500 | 500 / 500 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt, sample4.txt |
All | sample1.txt, sample2.txt, sample3.txt, sample4.txt, in1.txt, in10.txt, in101.txt, in102.txt, in103.txt, in104.txt, in105.txt, in106.txt, in107.txt, in108.txt, in109.txt, in11.txt, in110.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt, sub2in1.txt, sub2in10.txt, sub2in11.txt, sub2in12.txt, sub2in13.txt, sub2in14.txt, sub2in15.txt, sub2in16.txt, sub2in17.txt, sub2in18.txt, sub2in19.txt, sub2in2.txt, sub2in20.txt, sub2in21.txt, sub2in22.txt, sub2in23.txt, sub2in24.txt, sub2in3.txt, sub2in4.txt, sub2in5.txt, sub2in6.txt, sub2in7.txt, sub2in8.txt, sub2in9.txt, subin1.txt, subin10.txt, subin101.txt, subin102.txt, subin103.txt, subin104.txt, subin105.txt, subin106.txt, subin107.txt, subin108.txt, subin109.txt, subin11.txt, subin12.txt, subin13.txt, subin14.txt, subin15.txt, subin16.txt, subin17.txt, subin18.txt, subin19.txt, subin2.txt, subin20.txt, subin201.txt, subin21.txt, subin22.txt, subin23.txt, subin24.txt, subin3.txt, subin4.txt, subin5.txt, subin6.txt, subin7.txt, subin8.txt, subin9.txt |
subtask | sample1.txt, sample2.txt, sample3.txt, subin1.txt, subin10.txt, subin101.txt, subin102.txt, subin103.txt, subin104.txt, subin105.txt, subin106.txt, subin107.txt, subin108.txt, subin109.txt, subin11.txt, subin12.txt, subin13.txt, subin14.txt, subin15.txt, subin16.txt, subin17.txt, subin18.txt, subin19.txt, subin2.txt, subin20.txt, subin201.txt, subin21.txt, subin22.txt, subin23.txt, subin24.txt, subin3.txt, subin4.txt, subin5.txt, subin6.txt, subin7.txt, subin8.txt, subin9.txt |
subtask2 | sample1.txt, sample2.txt, sample3.txt, sample4.txt, sub2in1.txt, sub2in10.txt, sub2in11.txt, sub2in12.txt, sub2in13.txt, sub2in14.txt, sub2in15.txt, sub2in16.txt, sub2in17.txt, sub2in18.txt, sub2in19.txt, sub2in2.txt, sub2in20.txt, sub2in21.txt, sub2in22.txt, sub2in23.txt, sub2in24.txt, sub2in3.txt, sub2in4.txt, sub2in5.txt, sub2in6.txt, sub2in7.txt, sub2in8.txt, sub2in9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 2 ms | 2304 KB |
in10.txt | AC | 30 ms | 4224 KB |
in101.txt | AC | 60 ms | 6144 KB |
in102.txt | AC | 69 ms | 7680 KB |
in103.txt | AC | 53 ms | 4736 KB |
in104.txt | AC | 95 ms | 8960 KB |
in105.txt | AC | 68 ms | 9600 KB |
in106.txt | AC | 63 ms | 6144 KB |
in107.txt | AC | 70 ms | 7680 KB |
in108.txt | AC | 54 ms | 4736 KB |
in109.txt | AC | 97 ms | 9088 KB |
in11.txt | AC | 77 ms | 9856 KB |
in110.txt | AC | 68 ms | 11648 KB |
in12.txt | AC | 73 ms | 8960 KB |
in13.txt | AC | 71 ms | 9216 KB |
in14.txt | AC | 74 ms | 9856 KB |
in15.txt | AC | 76 ms | 9856 KB |
in16.txt | AC | 76 ms | 9728 KB |
in17.txt | AC | 78 ms | 9728 KB |
in18.txt | AC | 75 ms | 9856 KB |
in19.txt | AC | 73 ms | 9344 KB |
in2.txt | AC | 86 ms | 9472 KB |
in20.txt | AC | 70 ms | 9216 KB |
in21.txt | AC | 90 ms | 9856 KB |
in22.txt | AC | 80 ms | 9856 KB |
in23.txt | AC | 93 ms | 9728 KB |
in24.txt | AC | 100 ms | 9856 KB |
in25.txt | AC | 26 ms | 3584 KB |
in26.txt | AC | 27 ms | 3584 KB |
in27.txt | AC | 26 ms | 3584 KB |
in28.txt | AC | 27 ms | 3584 KB |
in3.txt | AC | 74 ms | 9216 KB |
in4.txt | AC | 52 ms | 7040 KB |
in5.txt | AC | 65 ms | 8704 KB |
in6.txt | AC | 73 ms | 9728 KB |
in7.txt | AC | 61 ms | 6144 KB |
in8.txt | AC | 39 ms | 6528 KB |
in9.txt | AC | 76 ms | 9728 KB |
sample1.txt | AC | 2 ms | 2304 KB |
sample2.txt | AC | 2 ms | 2304 KB |
sample3.txt | AC | 2 ms | 2304 KB |
sample4.txt | AC | 2 ms | 2304 KB |
sub2in1.txt | AC | 2 ms | 2304 KB |
sub2in10.txt | AC | 2 ms | 2304 KB |
sub2in11.txt | AC | 2 ms | 2304 KB |
sub2in12.txt | AC | 2 ms | 2304 KB |
sub2in13.txt | AC | 2 ms | 2304 KB |
sub2in14.txt | AC | 2 ms | 2304 KB |
sub2in15.txt | AC | 2 ms | 2304 KB |
sub2in16.txt | AC | 2 ms | 2304 KB |
sub2in17.txt | AC | 2 ms | 2304 KB |
sub2in18.txt | AC | 2 ms | 2304 KB |
sub2in19.txt | AC | 2 ms | 2304 KB |
sub2in2.txt | AC | 2 ms | 2304 KB |
sub2in20.txt | AC | 2 ms | 2304 KB |
sub2in21.txt | AC | 2 ms | 2304 KB |
sub2in22.txt | AC | 2 ms | 2304 KB |
sub2in23.txt | AC | 2 ms | 2304 KB |
sub2in24.txt | AC | 2 ms | 2304 KB |
sub2in3.txt | AC | 2 ms | 2304 KB |
sub2in4.txt | AC | 2 ms | 2304 KB |
sub2in5.txt | AC | 2 ms | 2304 KB |
sub2in6.txt | AC | 2 ms | 2304 KB |
sub2in7.txt | AC | 2 ms | 2304 KB |
sub2in8.txt | AC | 2 ms | 2304 KB |
sub2in9.txt | AC | 2 ms | 2304 KB |
subin1.txt | AC | 69 ms | 8704 KB |
subin10.txt | AC | 68 ms | 8960 KB |
subin101.txt | AC | 85 ms | 9856 KB |
subin102.txt | AC | 70 ms | 9856 KB |
subin103.txt | AC | 88 ms | 9728 KB |
subin104.txt | AC | 69 ms | 9728 KB |
subin105.txt | AC | 97 ms | 9728 KB |
subin106.txt | AC | 65 ms | 9728 KB |
subin107.txt | AC | 68 ms | 9856 KB |
subin108.txt | AC | 84 ms | 9856 KB |
subin109.txt | AC | 70 ms | 9856 KB |
subin11.txt | AC | 74 ms | 9728 KB |
subin12.txt | AC | 74 ms | 9728 KB |
subin13.txt | AC | 70 ms | 9344 KB |
subin14.txt | AC | 82 ms | 9728 KB |
subin15.txt | AC | 71 ms | 9472 KB |
subin16.txt | AC | 77 ms | 9728 KB |
subin17.txt | AC | 69 ms | 9216 KB |
subin18.txt | AC | 71 ms | 9088 KB |
subin19.txt | AC | 69 ms | 9088 KB |
subin2.txt | AC | 74 ms | 8832 KB |
subin20.txt | AC | 69 ms | 8960 KB |
subin201.txt | AC | 2 ms | 2304 KB |
subin21.txt | AC | 25 ms | 3584 KB |
subin22.txt | AC | 24 ms | 3584 KB |
subin23.txt | AC | 25 ms | 3584 KB |
subin24.txt | AC | 25 ms | 3584 KB |
subin3.txt | AC | 63 ms | 8064 KB |
subin4.txt | AC | 61 ms | 7680 KB |
subin5.txt | AC | 84 ms | 9600 KB |
subin6.txt | AC | 80 ms | 9856 KB |
subin7.txt | AC | 41 ms | 6144 KB |
subin8.txt | AC | 45 ms | 7040 KB |
subin9.txt | AC | 70 ms | 8320 KB |