Sample Input Output for the Sample Input Sample Input Output for the Sample Input Sample Input 4-1 Output fo

Size: px

Start display at page:

Download "Sample Input Output for the Sample Input Sample Input Output for the Sample Input Sample Input 4-1 Output fo"

もえりいそみ
5 years ago
Views:

1 Problem A Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep 2014 A A a b c A 60 A 60t + c ( t ) A -1 1 a b c Input 3 a, b, c a b c a, b, c 0 < a, b, c < 60 Constraints Output A A Sample Input 1 5 Output for the Sample Input 1 Problem A: Page 1 of 32

2 Sample Input Output for the Sample Input Sample Input Output for the Sample Input Sample Input 4-1 Output for the Sample Input 4 Problem A: Page 2 of 32

3 Problem B Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep 2014 A B N M B A B A B A B B B 4 B B N M S 1 S 2. S N Input S i (1 i N) M ˆ v < > B. B # G A B A Problem B: Page 3 of 32

4 Constraints 1 N 50 1 M 50 ˆ v < > G B B Output A A A G##.#..<. Sample Input 1 4 Output for the Sample Input G##.#..>. Sample Input 2 6 Output for the Sample Input G..>. Sample Input 3 Problem B: Page 4 of 32

5 Output for the Sample Input 3-1 Sample Input #.G...# ^#.. Output for the Sample Input 4 8 Problem B: Page 5 of 32

6 Problem C Magic Bullet Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep XX Magic Bullet 0 Input 1 N Q x 1 y 1 z 1 r 1 l 1. x N y N z N r N l N sx 1 sy 1 sz 1 dx 1 dy 1 dz 1. sx Q sy Q sz Q dx Q dy Q dz Q N Q x i, y i, z i i x y z Problem C: Magic Bullet Page 6 of 32

7 r i i l i i sx j, sy j, sz j j x y z dx j, dy j, dz j j x y z Constraints 0 N 50 1 Q x i, y i, z i r i 1,000 1 l i sx j, sy j, sz j dx j, dy j, dz j 500 Output Sample Input Output for the Sample Input 1 Problem C: Magic Bullet Page 7 of 32

8 Sample Input Output for the Sample Input 2 9 Sample Input Output for the Sample Input 3 Problem C: Magic Bullet Page 8 of 32

9 Problem D Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep N N 2 N i (1 i N) C i P Q Input N + 1 N P Q C 1 C 2. C N 1 3 N, P, Q 2 N i + 1 i 1 N 500,000 0 P 500,000 Q 500,000 C i 500,000 Constraints Output Problem D: Page 9 of 32

10 Sample Input Output for the Sample Input Sample Input 2 12 Output for the Sample Input = 12 Sample Input 3 2 Output for the Sample Input Sample Input 4 Problem D: Page 10 of 32

11 Output for the Sample Input 4-27 Problem D: Page 11 of 32

12 Problem E AI Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep 2014 EBNF := { }; := if while ; if := "[",,, "]"; while := "{",,, "}"; := "^" "v" "<" ">"; := ["~"], "N" "E" "S" "W" "C" "T"; 1 1 if while ˆ, v, <, > ˆ : v : < : 90 > : 90 if [ ] if 3. if while { } while N, E, S, W, C, T Problem E: AI Page 12 of 32

13 N : E : S : W : C : T : H W a 1,1 a 1,2... a 1,W a 2,1 a 2,2... a 2,W. a H,1 a 2,2... a H,W s Input H W a i, j s : g : # :. : s Problem E: AI Page 13 of 32

14 Constraints 1 H, W 50 1 s 1,000 a i, j., #, s, g s, g 1 i = 1 i = H j = 1 j = W a i, j = # s Output ### #g# #.# #s# ### ^<^<vv Sample Input 1 5 Output for the Sample Input ####### #.#g..# #.###.# #s...# ####### {T{~C^}<} Sample Input 2 17 Output for the Sample Input 2 Problem E: AI Page 14 of 32

15 Sample Input ####### #.#g..# #.###.# #s...# ####### {T{~C^}>} Output for the Sample Input 3-1 Problem E: AI Page 15 of 32

16 Problem F Longest Match Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep 2014 S m i x i, y i S x i y i S S S T S i 1 j T T j = S i+ j T j T j Input S m x 1 y 1 x 2 y 2. x m y m 1 S 2 m 3 m i i x i, y i Constraints 1 S m x i, y i m i=1 ( x i + y i ) S x i, y i Output Problem F: Longest Match Page 16 of 32

17 len 1 len 2. len m 1 m i i len i 0 abracadabra 5 ab a a a b c ac ca z z Sample Input Output for the Sample Input 1 S abracadabra ab a abra abraca, abracada, abracadabra 4 abracadabra 11 a a abracadabra 11 b c brac 4 ac ca aca 3 z z 0 howistheprogress 4 ist prog s ss how is the progress Sample Input 2 Problem F: Longest Match Page 17 of 32

18 Output for the Sample Input Sample Input 3 icpcsummertraining 9 mm m icpc summer train ing summer mm i c i i g g train i summer er Output for the Sample Input Problem F: Longest Match Page 18 of 32

19 Problem G Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep 2014 M N M N K a 1 b 1 c 1 d 1 s 1,1 v 1,1,1 v 1,1,2 v 1,1,s1,1 s 1,2 v 1,2,1 v 1,2,2 v 1,2,s1,2. s 1,d1 v 1,d1,1 v 1,d1,2 v 1,d1,s 1,d1 a 2 b 2 c 2 d 2. a M b M c M d M s M,1 v M,1,1 v M,1,sM,1. s M,dM v M,dM,1 v M,dM,2 v M,dM,s M,dM Input 1 3 M, N, K M N K 1 M a i, b i, c i, d i 4 a i b i c i = 0 i 1 c i = 1 Problem G: Page 19 of 32

20 d i 1 1 s i, j s i, j v i, j,1, v i, j,2,, v i, j,si, j v i, j,k i i d i 1 i d i = 0 i 1 M 18 0 N K M 1 b i < a i d i 3 1 v i, j,k M v i, j,k v i, j,k if k k Constraints Output K yes no Sample Input 1 yes Output for the Sample Input Sample Input 2 Problem G: Page 20 of 32

21 Output for the Sample Input 2 no Sample Input Output for the Sample Input 3 yes Sample Input Output for the Sample Input 4 yes Sample Input Problem G: Page 21 of 32

22 Output for the Sample Input 5 no Problem G: Page 22 of 32

23 Problem H Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep n 1 1 0,..., 2 n 1 1 n 1. 1 l l + 1 (l 0 (mod 2)) 2. i + 1 (1 i < n) l l + 2 i i 1 l + 2 i l + 2 i+1 i (l 0 (mod 2 i+1 )) n 2 n ( ) 2 n i ( 0 i 2 n 1 ) i Input n m a 0 a 1 a m b 0 b 1 b m 1 1 n, m 2 2 n m 2 a i (0 i m) m + 1 a i Problem H: Page 23 of 32

24 3 b i (0 i < m) m 2 b i a i a i+1 Constraints 1 n 30 1 m 10,000 0 = a 0 < a 1 < < a m 1 < a m = 2 n 0 b i n Output Sample Input 1 1 Output for the Sample Input 1 2 { 0, 1 } {1, 2} {2, 1} 2 {2, 2} Sample Input 2 2 Output for the Sample Input Sample Input 3 Problem H: Page 24 of 32

25 Output for the Sample Input 3 0 Sample Input Output for the Sample Input 4 10 Problem H: Page 25 of 32

26 Problem I Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep 2014 ( ) s T(v) = v v, u (v, u) (u, v) s v T(s) T(v) Input M + 1 N M a 1 b 1. a M b M 1 N, M N M 2 M + 1 a i, b i a i b i Constraints 1 N 10,000 0 M 100,000 0 a i N 1 0 b i N 1 a i b i i j (a i, b i ) (a j, b j ) 0 50 Problem I: Page 26 of 32

27 Output 2 cnum cost c 1 c 2... c cnum 1 cnum, cost 2 cnum c i cnum : cost : v T(v) c i : i Sample Input Output for the Sample Input 1 0 (2,1) (0,1), (1,2) 1 T(0) = 1 T(1) = 2 T(2) = Sample Input Output for the Sample Input 2 Problem I: Page 27 of 32

28 Sample Input Output for the Sample Input Problem I: Page 28 of 32

29 Problem J Vongress Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep 2014 Vongress Vongress n m 1 x y n m x 1 y 1 x 2 y 2. x n y n r 1 r 2. r m Input n m (x i, y i ) r 1,..., r m 3 n m x i, y i r j 100 Constraints (x i, y i ) Problem J: Vongress Page 29 of 32

30 m Output x 1 y 1 x 2 y 2. x m y m (x k, y k ) k S k r k r 1 + +r m S 10 3 Sample Input Output for the Sample Input 1 Problem J: Vongress Page 30 of 32

31 Sample Input Output for the Sample Input Problem J: Vongress Page 31 of 32

32 Sample Input Output for the Sample Input 3 Problem J: Vongress Page 32 of 32