Submission #1661972
Source Code Expand
#include <cstdio> #include <algorithm> int N; long long a[100001], b[100001], K, C, O; long long L[10000001]; int T[10000001], ls[10000001], rs[10000001], n, root; long long G(int x) { int p = 1, l = 1, r = K; while (p && !T[p]) { int m = l + r >> 1; if (x <= m) p = ls[p], r = m; else p = rs[p], l = m + 1; } return p ? L[p] + r - x : 0; } long long ANS(int p, int l, int r) { if (!p) return 0; if (T[p]) return L[p]; int m = l + r >> 1; return std::min(ANS(ls[p], l, m), ANS(rs[p], m + 1, r)); } void P(int &p, int l, int r, int L, int R, long long w) { if (!p) p = ++n; if (L <= l && r <= R) { T[p] = 1; ::L[p] = w + R - r; return; } int m = l + r >> 1; if (T[p]) { if (!ls[p]) ls[p] = ++n; if (!rs[p]) rs[p] = ++n; T[ls[p]] = T[rs[p]] = 1; ::L[ls[p]] = ::L[p] + r - m; ::L[rs[p]] = ::L[p]; T[p] = 0; } if (L <= m) P(ls[p], l, m, L, R, w); if (R > m) P(rs[p], m + 1, r, L, R, w); } int main() { scanf("%d%lld", &N, &K); C = K; for (int i = 1; i <= N; i++) { scanf("%lld%lld", a + i, b + i); if (b[i] == 2) C = (C + a[i] + a[i] - 1) % K + 1; else { if (a[i] << 1 > K) { puts("-1"); return 0; } int E = C; C = (C + a[i] + a[i] - 1) % K + 1; long long w = G(C); if (E < C) P(root, 1, K, E + 1, C, w); else { P(root, 1, K, 1, C, w); if (E < K) P(root, 1, K, E + 1, K, w + C); } } } O = ANS(1, 1, K); for (int i = 1; i <= N; i++) O += a[i] << 1; printf("%lld\n", O); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Train Service Planning |
User | NiroBC |
Language | C++14 (GCC 5.4.1) |
Score | 1700 |
Code Size | 1611 Byte |
Status | AC |
Exec Time | 114 ms |
Memory | 53632 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:58: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:62:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld%lld", 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 | 4 ms | 8448 KB |
in10.txt | AC | 49 ms | 16640 KB |
in101.txt | AC | 47 ms | 16640 KB |
in102.txt | AC | 48 ms | 22912 KB |
in103.txt | AC | 46 ms | 11520 KB |
in104.txt | AC | 43 ms | 22912 KB |
in105.txt | AC | 55 ms | 31104 KB |
in106.txt | AC | 47 ms | 16640 KB |
in107.txt | AC | 47 ms | 22912 KB |
in108.txt | AC | 46 ms | 11520 KB |
in109.txt | AC | 43 ms | 22912 KB |
in11.txt | AC | 78 ms | 43392 KB |
in110.txt | AC | 55 ms | 31104 KB |
in12.txt | AC | 67 ms | 33152 KB |
in13.txt | AC | 47 ms | 16640 KB |
in14.txt | AC | 75 ms | 43392 KB |
in15.txt | AC | 75 ms | 43392 KB |
in16.txt | AC | 78 ms | 43392 KB |
in17.txt | AC | 74 ms | 43392 KB |
in18.txt | AC | 74 ms | 43392 KB |
in19.txt | AC | 55 ms | 22912 KB |
in2.txt | AC | 68 ms | 33152 KB |
in20.txt | AC | 55 ms | 22912 KB |
in21.txt | AC | 79 ms | 41344 KB |
in22.txt | AC | 67 ms | 33152 KB |
in23.txt | AC | 78 ms | 41344 KB |
in24.txt | AC | 78 ms | 41344 KB |
in25.txt | AC | 22 ms | 8576 KB |
in26.txt | AC | 22 ms | 8576 KB |
in27.txt | AC | 21 ms | 8576 KB |
in28.txt | AC | 22 ms | 8576 KB |
in3.txt | AC | 49 ms | 16640 KB |
in4.txt | AC | 76 ms | 43392 KB |
in5.txt | AC | 66 ms | 41216 KB |
in6.txt | AC | 72 ms | 43392 KB |
in7.txt | AC | 40 ms | 9216 KB |
in8.txt | AC | 39 ms | 22656 KB |
in9.txt | AC | 67 ms | 33152 KB |
sample1.txt | AC | 3 ms | 8320 KB |
sample2.txt | AC | 1 ms | 2176 KB |
sample3.txt | AC | 3 ms | 8320 KB |
sample4.txt | AC | 3 ms | 8320 KB |
sub2in1.txt | AC | 3 ms | 8320 KB |
sub2in10.txt | AC | 3 ms | 8320 KB |
sub2in11.txt | AC | 3 ms | 8320 KB |
sub2in12.txt | AC | 3 ms | 8320 KB |
sub2in13.txt | AC | 3 ms | 8320 KB |
sub2in14.txt | AC | 3 ms | 8320 KB |
sub2in15.txt | AC | 3 ms | 8320 KB |
sub2in16.txt | AC | 2 ms | 8320 KB |
sub2in17.txt | AC | 3 ms | 8320 KB |
sub2in18.txt | AC | 3 ms | 8320 KB |
sub2in19.txt | AC | 3 ms | 8320 KB |
sub2in2.txt | AC | 3 ms | 8320 KB |
sub2in20.txt | AC | 3 ms | 8320 KB |
sub2in21.txt | AC | 3 ms | 8320 KB |
sub2in22.txt | AC | 3 ms | 8320 KB |
sub2in23.txt | AC | 3 ms | 8320 KB |
sub2in24.txt | AC | 3 ms | 8320 KB |
sub2in3.txt | AC | 3 ms | 8320 KB |
sub2in4.txt | AC | 2 ms | 8320 KB |
sub2in5.txt | AC | 3 ms | 8320 KB |
sub2in6.txt | AC | 3 ms | 8320 KB |
sub2in7.txt | AC | 3 ms | 8320 KB |
sub2in8.txt | AC | 3 ms | 8448 KB |
sub2in9.txt | AC | 3 ms | 8448 KB |
subin1.txt | AC | 101 ms | 43392 KB |
subin10.txt | AC | 112 ms | 53632 KB |
subin101.txt | AC | 84 ms | 45440 KB |
subin102.txt | AC | 67 ms | 33152 KB |
subin103.txt | AC | 60 ms | 31104 KB |
subin104.txt | AC | 65 ms | 31104 KB |
subin105.txt | AC | 55 ms | 31104 KB |
subin106.txt | AC | 69 ms | 33152 KB |
subin107.txt | AC | 75 ms | 41344 KB |
subin108.txt | AC | 71 ms | 41344 KB |
subin109.txt | AC | 67 ms | 33152 KB |
subin11.txt | AC | 107 ms | 53632 KB |
subin12.txt | AC | 109 ms | 53632 KB |
subin13.txt | AC | 111 ms | 53632 KB |
subin14.txt | AC | 111 ms | 53632 KB |
subin15.txt | AC | 81 ms | 31104 KB |
subin16.txt | AC | 82 ms | 31104 KB |
subin17.txt | AC | 64 ms | 20864 KB |
subin18.txt | AC | 66 ms | 20864 KB |
subin19.txt | AC | 67 ms | 20864 KB |
subin2.txt | AC | 70 ms | 20864 KB |
subin20.txt | AC | 69 ms | 20864 KB |
subin201.txt | AC | 3 ms | 8320 KB |
subin21.txt | AC | 23 ms | 8576 KB |
subin22.txt | AC | 23 ms | 8576 KB |
subin23.txt | AC | 24 ms | 8576 KB |
subin24.txt | AC | 24 ms | 8576 KB |
subin3.txt | AC | 113 ms | 53632 KB |
subin4.txt | AC | 97 ms | 51456 KB |
subin5.txt | AC | 106 ms | 51584 KB |
subin6.txt | AC | 98 ms | 53632 KB |
subin7.txt | AC | 101 ms | 43392 KB |
subin8.txt | AC | 50 ms | 14336 KB |
subin9.txt | AC | 114 ms | 53632 KB |