Submission #538454
Source Code Expand
using System; using System.Collections; using System.Collections.Generic; using System.Linq; using System.IO; class Myon { public Myon() { } public static int Main() { new Myon().calc(); return 0; } Scanner cin; void calc() { cin = new Scanner(); int N = cin.nextInt(); int M = cin.nextInt(); int X = cin.nextInt(); int Y = cin.nextInt(); int[] a = new int[N]; int[] b = new int[M]; for (int i = 0; i < N; i++) { a[i] = cin.nextInt(); } for (int i = 0; i < M; i++) { b[i] = cin.nextInt(); } Array.Sort(a); Array.Sort(b); int nowtime = 0; int apos = 0; int bpos = 0; int ans = 0; while (true) { bool flag; flag = false; while (apos < N) { if (nowtime <= a[apos]) { flag = true; nowtime = a[apos] + X; break; } apos++; } if (!flag) break; flag = false; while (bpos < M) { if (nowtime <= b[bpos]) { flag = true; nowtime = b[bpos] + Y; break; } bpos++; } if (!flag) break; ans++; } Console.WriteLine(ans); } } class Scanner { string[] s; int i; char[] cs = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string next() { if (i < s.Length) return s[i++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); i = 0; return next(); } public int nextInt() { return int.Parse(next()); } public long nextLong() { return long.Parse(next()); } public double nextDouble() { return double.Parse(next()); } }
Submission Info
Submission Time | |
---|---|
Task | C - 飛行機乗り |
User | chokudai |
Language | C# (Mono 3.2.1.0) |
Score | 100 |
Code Size | 2347 Byte |
Status | AC |
Exec Time | 284 ms |
Memory | 35992 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 236 ms | 25612 KB |
subtask0_1.txt | AC | 200 ms | 23456 KB |
subtask0_10.txt | AC | 211 ms | 24168 KB |
subtask0_11.txt | AC | 218 ms | 25248 KB |
subtask0_12.txt | AC | 231 ms | 28048 KB |
subtask0_13.txt | AC | 206 ms | 23852 KB |
subtask0_14.txt | AC | 225 ms | 26248 KB |
subtask0_2.txt | AC | 218 ms | 25760 KB |
subtask0_3.txt | AC | 220 ms | 24616 KB |
subtask0_4.txt | AC | 215 ms | 25376 KB |
subtask0_5.txt | AC | 197 ms | 22816 KB |
subtask0_6.txt | AC | 236 ms | 26400 KB |
subtask0_7.txt | AC | 225 ms | 26780 KB |
subtask0_8.txt | AC | 198 ms | 23840 KB |
subtask0_9.txt | AC | 245 ms | 28192 KB |
subtask0_sample_01.txt | AC | 120 ms | 8996 KB |
subtask0_sample_02.txt | AC | 116 ms | 8872 KB |
subtask0_sample_03.txt | AC | 116 ms | 9004 KB |
subtask1_0.txt | AC | 272 ms | 30300 KB |
subtask1_1.txt | AC | 251 ms | 29728 KB |
subtask1_10.txt | AC | 220 ms | 27040 KB |
subtask1_11.txt | AC | 252 ms | 29884 KB |
subtask1_12.txt | AC | 268 ms | 32804 KB |
subtask1_13.txt | AC | 284 ms | 35992 KB |
subtask1_14.txt | AC | 244 ms | 29468 KB |
subtask1_2.txt | AC | 262 ms | 31892 KB |
subtask1_3.txt | AC | 246 ms | 30440 KB |
subtask1_4.txt | AC | 251 ms | 29252 KB |
subtask1_5.txt | AC | 252 ms | 29468 KB |
subtask1_6.txt | AC | 247 ms | 28628 KB |
subtask1_7.txt | AC | 246 ms | 28968 KB |
subtask1_8.txt | AC | 249 ms | 28864 KB |
subtask1_9.txt | AC | 278 ms | 34316 KB |