Submission #1175536
Source Code Expand
using System; using System.Text; using System.Collections.Generic; class Solve{ public Solve(){} StringBuilder sb; public static int Main(){ new Solve().Run(); return 0; } void Run(){ sb = new StringBuilder(); Calc(); Console.Write(sb.ToString()); } void Calc(){ string[] str = Console.ReadLine().Split(' '); int N = int.Parse(str[0]); long K = int.Parse(str[1]); long[] L = new long[N]; long[] R = new long[N]; int eN = 0; long sum = 0; { for(int i=0;i<N;i++){ str = Console.ReadLine().Split(' '); long D = int.Parse(str[0]); bool b = int.Parse(str[1]) == 1; if(b && 2*D > K){ sb.Append("-1\n"); return; } if(b){ L[eN] = K - (((sum + 2*D) % K) == 0 ? K : ((sum + 2*D) % K)); R[eN] = K - ((sum % K) == 0 ? K : sum % K); eN++; } sum += 2*D; } } long[] DPL = new long[eN]; long[] DPR = new long[eN]; long[] Points = new long[2*eN]; int[] A = new int[2*eN]; for(int i=0;i<eN;i++){ Points[2*i] = L[i]; Points[2*i+1] = R[i]; A[2*i] = 2*i; A[2*i+1] = 2*i+1; } Array.Sort(Points,A); int[] B = new int[2*eN]; for(int i=0;i<2*eN;i++){ B[A[i]] = i; } SegTree Seg = new SegTree(2*eN,this); for(int i=4*eN-2;i>=0;i--){ Seg.X[i] = eN; } for(int i=eN-1;i>=0;i--){ int lp = B[2*i]; int rp = B[2*i+1]; int gL = Seg.Get(lp); DPL[i] = gL == eN ? 0 : DPR[gL] + (K + Points[B[2*gL+1]] - Points[lp]) % K; int gR = Seg.Get(rp); DPR[i] = gR == eN ? 0 : DPR[gR] + (K + Points[B[2*gR+1]] - Points[rp]) % K; int bf = 0; int bl = 2*eN; long C = Points[B[2*i]]; while(bf != bl){ int bc = (bf+bl)/2; if(bc == 2*eN || C < Points[bc]){ bl = bc; } else{ bf = bc+1; } } int l = bf; bf = -1; bl = 2*eN-1; C = Points[B[2*i+1]]; while(bf != bl){ int bc = (bf+bl+1)/2; if(bc == -1 || C > Points[bc]){ bf = bc; } else{ bl = bc-1; } } int r = bf; if(Points[lp] < Points[rp]){ if(l <= r){ Seg.Add(i,l,r); } } else{ if(l != 2*eN){ Seg.Add(i,l,2*eN-1); } if(r != -1){ Seg.Add(i,0,r); } } } for(int i=4*eN-2;i>=0;i--){ Seg.X[i] = eN; } long min = DPR[0]; for(int i=0;i<eN;i++){ int lp = B[2*i]; int rp = B[2*i+1]; int gL = Seg.Get(lp); if(gL == eN){ min = Math.Min(min,DPL[i]); } int gR = Seg.Get(rp); if(gR == eN){ min = Math.Min(min,DPR[i]); } int bf = 0; int bl = 2*eN; long C = Points[B[2*i]]; while(bf != bl){ int bc = (bf+bl)/2; if(bc == 2*eN || C < Points[bc]){ bl = bc; } else{ bf = bc+1; } } int l = bf; bf = -1; bl = 2*eN-1; C = Points[B[2*i+1]]; while(bf != bl){ int bc = (bf+bl+1)/2; if(bc == -1 || C > Points[bc]){ bf = bc; } else{ bl = bc-1; } } int r = bf; if(Points[lp] < Points[rp]){ if(l <= r){ Seg.Add(0,l,r); } } else{ if(l != 2*eN){ Seg.Add(0,l,2*eN-1); } if(r != -1){ Seg.Add(0,0,r); } } } sb.Append((min+sum)+"\n"); } } struct SegTree{ Solve Sol; public int[] X; //葉の最初の場所 public int segf; //segfのbit public int segfb; //葉の深さの内浅い方 public int depth; //浅い葉の内座標が最大のもの public int borderP; //はみ出すものの数 public int border; public SegTree(int N,Solve So){ Sol = So; X = new int[2*N-1]; for(depth = 1;(1 << depth) <= N;depth++){ ; } segf = N-1; borderP = (1 << depth) - 2; border = 2*N - borderP - 2; segfb = border/2; } public int ToBit(int p){ if(p >= border){ return segfb + p - border; } else{ return p; } } //葉のある場所 public int ToLeaf(int p){ if(p >= border){ return segf + p - border; } else{ return borderP + p + 1; } } //葉の示す頂点 public int ToPoint(int leaf){ if(leaf > borderP){ return leaf - borderP - 1; } else{ return leaf - segf + border; } } public int Get(int p){ //葉の作業 int min = X[ToLeaf(p)]; //親の作業 for(int v=ToLeaf(p);v!=0;v=(v-1)/2){ int spa = (v-1)/2; int sl = (v-1)/2*2+1; int sr = (v-1)/2*2+2; min = Math.Min(min,X[spa]); } return min; } //vの子の内bより大きいものに(bは子孫,bはToBitしたもの) void More(int C,int b,int v,int depth){ if((b & (1 << depth)) == 0){ //右の子は全てbより大きい if(((b+1) % (1 << depth)) != 0){ More(C,b,v*2+1,depth-1); Act(C,v*2+2); } else{ Act(C,v*2+2); } } else{ //左の子は全てb未満 More(C,b,v*2+2,depth-1); } } //vの子の内bより小さなものに(bは子孫,bはToBitしたもの) void Less(int C,int b,int v,int depth){ if((b & (1 << depth)) == 0){ //右の子は全てbより大きい Less(C,b,v*2+1,depth-1); } else{ //左の子は全てb未満 if(b % (1 << depth) != 0){ Act(C,v*2+1); Less(C,b,v*2+2,depth-1); } else{ //右の子は全てb以上 Act(C,v*2+1); } } } void Section(int C,int bl,int br,int v,int dl,int dr){ if(v >= segf){ //葉 Act(C,v); } else{ if((bl & (1 << dl)) == 0 && (br & (1 << dr)) == 0){ //両方左 Section(C,bl,br,v*2+1,dl-1,dr-1); } else if((bl & (1 << dl)) != 0 && (br & (1 << dr)) != 0){ //両方右 Section(C,bl,br,v*2+2,dl-1,dr-1); } else{ //左と右に分かれた if(bl % (1 << dl) != 0){ More(C,bl-1,v*2+1,dl-1); } else{ //左は全て含まれる Act(C,v*2+1); } if((br + 1) % (1 << dl) != 0){ Less(C,br+1,v*2+2,dr-1); } else{ //右は全て含まれる Act(C,v*2+2); } } } } public void Add(int C,int l0,int r0){ int bl = ToBit(l0); int br = ToBit(r0); int dl = l0 >= border ? depth - 2 : depth - 1; int dr = r0 >= border ? depth - 2 : depth - 1; Section(C,bl,br,0,dl,dr); } void Act(int C,int v){ X[v] = C; } }
Submission Info
Submission Time | |
---|---|
Task | F - Train Service Planning |
User | leign |
Language | C# (Mono 4.6.2.0) |
Score | 1700 |
Code Size | 8793 Byte |
Status | AC |
Exec Time | 386 ms |
Memory | 25164 KB |
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 | 26 ms | 11300 KB |
in10.txt | AC | 237 ms | 17864 KB |
in101.txt | AC | 210 ms | 19912 KB |
in102.txt | AC | 197 ms | 19912 KB |
in103.txt | AC | 222 ms | 19912 KB |
in104.txt | AC | 186 ms | 21960 KB |
in105.txt | AC | 183 ms | 19912 KB |
in106.txt | AC | 209 ms | 19912 KB |
in107.txt | AC | 196 ms | 19912 KB |
in108.txt | AC | 221 ms | 19912 KB |
in109.txt | AC | 187 ms | 19912 KB |
in11.txt | AC | 238 ms | 19912 KB |
in110.txt | AC | 182 ms | 19912 KB |
in12.txt | AC | 233 ms | 19912 KB |
in13.txt | AC | 225 ms | 19916 KB |
in14.txt | AC | 232 ms | 19912 KB |
in15.txt | AC | 223 ms | 19912 KB |
in16.txt | AC | 228 ms | 17992 KB |
in17.txt | AC | 230 ms | 17864 KB |
in18.txt | AC | 232 ms | 21960 KB |
in19.txt | AC | 244 ms | 17864 KB |
in2.txt | AC | 240 ms | 19912 KB |
in20.txt | AC | 233 ms | 19912 KB |
in21.txt | AC | 197 ms | 21960 KB |
in22.txt | AC | 187 ms | 19912 KB |
in23.txt | AC | 204 ms | 19912 KB |
in24.txt | AC | 204 ms | 19912 KB |
in25.txt | AC | 179 ms | 17868 KB |
in26.txt | AC | 180 ms | 19916 KB |
in27.txt | AC | 174 ms | 19916 KB |
in28.txt | AC | 181 ms | 19916 KB |
in3.txt | AC | 238 ms | 17864 KB |
in4.txt | AC | 241 ms | 17864 KB |
in5.txt | AC | 208 ms | 19276 KB |
in6.txt | AC | 227 ms | 20040 KB |
in7.txt | AC | 237 ms | 19912 KB |
in8.txt | AC | 72 ms | 16608 KB |
in9.txt | AC | 239 ms | 19912 KB |
sample1.txt | AC | 24 ms | 11348 KB |
sample2.txt | AC | 21 ms | 11220 KB |
sample3.txt | AC | 23 ms | 13396 KB |
sample4.txt | AC | 24 ms | 11348 KB |
sub2in1.txt | AC | 25 ms | 11348 KB |
sub2in10.txt | AC | 24 ms | 9300 KB |
sub2in11.txt | AC | 24 ms | 9300 KB |
sub2in12.txt | AC | 24 ms | 11348 KB |
sub2in13.txt | AC | 24 ms | 11348 KB |
sub2in14.txt | AC | 25 ms | 13396 KB |
sub2in15.txt | AC | 24 ms | 13396 KB |
sub2in16.txt | AC | 24 ms | 13396 KB |
sub2in17.txt | AC | 24 ms | 11348 KB |
sub2in18.txt | AC | 23 ms | 9300 KB |
sub2in19.txt | AC | 24 ms | 11348 KB |
sub2in2.txt | AC | 24 ms | 11348 KB |
sub2in20.txt | AC | 24 ms | 11348 KB |
sub2in21.txt | AC | 24 ms | 13396 KB |
sub2in22.txt | AC | 24 ms | 11348 KB |
sub2in23.txt | AC | 24 ms | 11348 KB |
sub2in24.txt | AC | 23 ms | 9300 KB |
sub2in3.txt | AC | 24 ms | 11348 KB |
sub2in4.txt | AC | 24 ms | 11348 KB |
sub2in5.txt | AC | 23 ms | 9300 KB |
sub2in6.txt | AC | 23 ms | 9300 KB |
sub2in7.txt | AC | 20 ms | 11220 KB |
sub2in8.txt | AC | 24 ms | 11348 KB |
sub2in9.txt | AC | 25 ms | 13396 KB |
subin1.txt | AC | 376 ms | 21064 KB |
subin10.txt | AC | 369 ms | 25160 KB |
subin101.txt | AC | 309 ms | 23112 KB |
subin102.txt | AC | 260 ms | 25164 KB |
subin103.txt | AC | 256 ms | 25164 KB |
subin104.txt | AC | 250 ms | 23116 KB |
subin105.txt | AC | 225 ms | 25164 KB |
subin106.txt | AC | 220 ms | 25164 KB |
subin107.txt | AC | 270 ms | 23112 KB |
subin108.txt | AC | 274 ms | 23112 KB |
subin109.txt | AC | 256 ms | 23116 KB |
subin11.txt | AC | 363 ms | 23112 KB |
subin12.txt | AC | 365 ms | 23112 KB |
subin13.txt | AC | 365 ms | 23112 KB |
subin14.txt | AC | 372 ms | 23112 KB |
subin15.txt | AC | 365 ms | 21064 KB |
subin16.txt | AC | 373 ms | 23112 KB |
subin17.txt | AC | 352 ms | 25164 KB |
subin18.txt | AC | 362 ms | 21068 KB |
subin19.txt | AC | 367 ms | 23116 KB |
subin2.txt | AC | 376 ms | 25160 KB |
subin20.txt | AC | 364 ms | 23116 KB |
subin201.txt | AC | 23 ms | 13396 KB |
subin21.txt | AC | 256 ms | 23116 KB |
subin22.txt | AC | 254 ms | 21068 KB |
subin23.txt | AC | 254 ms | 25164 KB |
subin24.txt | AC | 257 ms | 23116 KB |
subin3.txt | AC | 380 ms | 23112 KB |
subin4.txt | AC | 329 ms | 21964 KB |
subin5.txt | AC | 359 ms | 25160 KB |
subin6.txt | AC | 285 ms | 23116 KB |
subin7.txt | AC | 107 ms | 14560 KB |
subin8.txt | AC | 85 ms | 14560 KB |
subin9.txt | AC | 386 ms | 23112 KB |