Submission #1159629
Source Code Expand
#include <iostream> #include <fstream> #include <set> #include <map> #include <string> #include <vector> #include <bitset> #include <algorithm> #include <cstring> #include <cstdlib> #include <cmath> #include <cassert> #include <queue> #define mp make_pair #define pb push_back typedef long long ll; typedef long double ld; using namespace std; struct st { ll l, r; ll x, d; }; bool operator<(const st& a, const st& b) { return a.l < b.l; } int n; ll k; ll a[120000]; int b[120000]; set<st> ss; int main() { scanf("%d%lld", &n, &k); ll ans = 0; for (int i = 0; i < n; ++i) { scanf("%lld%d", a + i, b + i); a[i] *= 2; ans += a[i]; if (a[i] > k && b[i] == 1) { cout << -1 << "\n"; return 0; } if (b[i] == 2) a[i] %= k; } ss.insert({0, k, 0, 0}); ll cur = 0; for (int i = 0; i < n; ++i) { ll d = a[i]; ll nx = cur + d; if (nx > k) nx -= k; if (b[i] == 1) { if (cur < nx) { auto it = ss.lower_bound({cur, 0, 0, 0}); while (it->r < nx) ss.erase(it++); st x1 = *it; st x2 = *it; ss.erase(it); x1.l = cur; x1.r = nx; x2.l = nx; x1.d = 1; x1.x = x2.x + x2.d * (x2.r - nx); ss.insert(x1); if (x2.l != x2.r) ss.insert(x2); } else { auto it = ss.lower_bound({cur, 0, 0, 0}); while (it != ss.end()) ss.erase(it++); it = ss.begin(); while (it->r < nx) ss.erase(it++); st x1 = *it; st x2 = *it; ss.erase(it); x1.l = 0; x1.r = nx; x2.l = nx; x1.d = 1; x1.x = x2.x + x2.d * (x2.r - nx); ss.insert(x1); if (x2.l != x2.r) ss.insert(x2); x2.l = cur; x2.r = k; x2.d = 1; x2.x = x1.x + x1.d * x1.r; ss.insert(x2); } cur = (cur + a[i]) % k; } else { cur += a[i]; cur %= k; auto it = ss.lower_bound({cur, 0, 0, 0}); if (it == ss.begin()) continue; --it; if (it->r <= cur) continue; st x1 = *it; st x2 = *it; ss.erase(it); x2.l = cur; x1.x = x2.x + x2.d * (x2.r - cur); x1.r = cur; ss.insert(x1); ss.insert(x2); } } ll mn = ss.begin()->x; for (auto x: ss) mn = min(mn, x.x); cout << ans + mn << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Train Service Planning |
User | LHiC |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 2296 Byte |
Status | AC |
Exec Time | 76 ms |
Memory | 9216 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:40:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%lld", &n, &k); ^ ./Main.cpp:43:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld%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 | 256 KB |
in10.txt | AC | 38 ms | 1408 KB |
in101.txt | AC | 41 ms | 2176 KB |
in102.txt | AC | 45 ms | 2688 KB |
in103.txt | AC | 39 ms | 1792 KB |
in104.txt | AC | 55 ms | 4608 KB |
in105.txt | AC | 54 ms | 4992 KB |
in106.txt | AC | 41 ms | 2304 KB |
in107.txt | AC | 46 ms | 2688 KB |
in108.txt | AC | 38 ms | 1792 KB |
in109.txt | AC | 56 ms | 4736 KB |
in11.txt | AC | 40 ms | 1408 KB |
in110.txt | AC | 58 ms | 4992 KB |
in12.txt | AC | 43 ms | 1408 KB |
in13.txt | AC | 42 ms | 1408 KB |
in14.txt | AC | 44 ms | 1408 KB |
in15.txt | AC | 50 ms | 1408 KB |
in16.txt | AC | 49 ms | 1408 KB |
in17.txt | AC | 47 ms | 1408 KB |
in18.txt | AC | 45 ms | 1408 KB |
in19.txt | AC | 46 ms | 1408 KB |
in2.txt | AC | 40 ms | 1408 KB |
in20.txt | AC | 44 ms | 1408 KB |
in21.txt | AC | 75 ms | 7552 KB |
in22.txt | AC | 73 ms | 9088 KB |
in23.txt | AC | 74 ms | 6400 KB |
in24.txt | AC | 73 ms | 5376 KB |
in25.txt | AC | 32 ms | 1408 KB |
in26.txt | AC | 31 ms | 1408 KB |
in27.txt | AC | 30 ms | 1408 KB |
in28.txt | AC | 33 ms | 1408 KB |
in3.txt | AC | 39 ms | 1408 KB |
in4.txt | AC | 39 ms | 1408 KB |
in5.txt | AC | 34 ms | 1280 KB |
in6.txt | AC | 48 ms | 1408 KB |
in7.txt | AC | 39 ms | 1408 KB |
in8.txt | AC | 12 ms | 896 KB |
in9.txt | AC | 39 ms | 1408 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |
sample4.txt | AC | 1 ms | 256 KB |
sub2in1.txt | AC | 1 ms | 256 KB |
sub2in10.txt | AC | 1 ms | 256 KB |
sub2in11.txt | AC | 1 ms | 256 KB |
sub2in12.txt | AC | 1 ms | 256 KB |
sub2in13.txt | AC | 1 ms | 256 KB |
sub2in14.txt | AC | 1 ms | 256 KB |
sub2in15.txt | AC | 1 ms | 256 KB |
sub2in16.txt | AC | 1 ms | 256 KB |
sub2in17.txt | AC | 1 ms | 256 KB |
sub2in18.txt | AC | 1 ms | 256 KB |
sub2in19.txt | AC | 1 ms | 256 KB |
sub2in2.txt | AC | 1 ms | 256 KB |
sub2in20.txt | AC | 1 ms | 256 KB |
sub2in21.txt | AC | 1 ms | 256 KB |
sub2in22.txt | AC | 1 ms | 256 KB |
sub2in23.txt | AC | 1 ms | 256 KB |
sub2in24.txt | AC | 1 ms | 256 KB |
sub2in3.txt | AC | 1 ms | 256 KB |
sub2in4.txt | AC | 1 ms | 256 KB |
sub2in5.txt | AC | 1 ms | 256 KB |
sub2in6.txt | AC | 1 ms | 256 KB |
sub2in7.txt | AC | 1 ms | 256 KB |
sub2in8.txt | AC | 1 ms | 256 KB |
sub2in9.txt | AC | 1 ms | 256 KB |
subin1.txt | AC | 47 ms | 1408 KB |
subin10.txt | AC | 36 ms | 1408 KB |
subin101.txt | AC | 39 ms | 1408 KB |
subin102.txt | AC | 49 ms | 3968 KB |
subin103.txt | AC | 61 ms | 6400 KB |
subin104.txt | AC | 53 ms | 6400 KB |
subin105.txt | AC | 76 ms | 9088 KB |
subin106.txt | AC | 64 ms | 9216 KB |
subin107.txt | AC | 48 ms | 5376 KB |
subin108.txt | AC | 49 ms | 5376 KB |
subin109.txt | AC | 50 ms | 4352 KB |
subin11.txt | AC | 40 ms | 1408 KB |
subin12.txt | AC | 39 ms | 1408 KB |
subin13.txt | AC | 37 ms | 1408 KB |
subin14.txt | AC | 36 ms | 1408 KB |
subin15.txt | AC | 36 ms | 1408 KB |
subin16.txt | AC | 34 ms | 1408 KB |
subin17.txt | AC | 38 ms | 1408 KB |
subin18.txt | AC | 38 ms | 1408 KB |
subin19.txt | AC | 35 ms | 1408 KB |
subin2.txt | AC | 34 ms | 1408 KB |
subin20.txt | AC | 34 ms | 1408 KB |
subin201.txt | AC | 1 ms | 256 KB |
subin21.txt | AC | 29 ms | 1408 KB |
subin22.txt | AC | 29 ms | 1408 KB |
subin23.txt | AC | 30 ms | 1408 KB |
subin24.txt | AC | 30 ms | 1408 KB |
subin3.txt | AC | 37 ms | 1408 KB |
subin4.txt | AC | 31 ms | 1280 KB |
subin5.txt | AC | 39 ms | 1408 KB |
subin6.txt | AC | 43 ms | 2176 KB |
subin7.txt | AC | 19 ms | 1408 KB |
subin8.txt | AC | 13 ms | 1152 KB |
subin9.txt | AC | 37 ms | 1408 KB |