Submission #432705
Source Code Expand
import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Scanner; public class Main { MyScanner sc = new MyScanner(); Scanner sc2 = new Scanner(System.in); final int MOD = 1000000007; int[] dx = { 1, 0, 0, -1 }; int[] dy = { 0, 1, -1, 0 }; void run() { int N = sc.nextInt(); int A = sc.nextInt(); int B = sc.nextInt(); int res = 0; while (N-- > 0) { String dir = sc.next(); int d = sc.nextInt(); int move = 0; if (d < A) { move = A; } else if (d > B) { move = B; } else { move = d; } res += dir.equals("East") ? move : -move; } if (res == 0) { System.out.println(0); } else { System.out.println((res > 0 ? "East " : "West ") + Math.abs(res)); } } public static void main(String[] args) { new Main().run(); } void debug(Object... o) { System.out.println(Arrays.deepToString(o)); } void debug2(char[][] array) { for (int i = 0; i < array.length; i++) { for (int j = 0; j < array[i].length; j++) { System.out.print(array[i][j]); } System.out.println(); } } boolean inner(int h, int w, int limH, int limW) { return 0 <= h && h < limH && 0 <= w && w < limW; } void swap(int[] x, int a, int b) { int tmp = x[a]; x[a] = x[b]; x[b] = tmp; } // find minimum i (a[i] >= border) int lower_bound(int a[], int border) { int l = -1; int r = a.length; while (r - l > 1) { int mid = (l + r) / 2; if (border <= a[mid]) { r = mid; } else { l = mid; } } // r = l + 1 return r; } boolean palindrome(String s) { for (int i = 0; i < s.length() / 2; i++) { if (s.charAt(i) != s.charAt(s.length() - 1 - i)) { return false; } } return true; } class MyScanner { int nextInt() { try { int c = System.in.read(); while (c != '-' && (c < '0' || '9' < c)) c = System.in.read(); if (c == '-') return -nextInt(); int res = 0; do { res *= 10; res += c - '0'; c = System.in.read(); } while ('0' <= c && c <= '9'); return res; } catch (Exception e) { return -1; } } double nextDouble() { return Double.parseDouble(next()); } long nextLong() { return Long.parseLong(next()); } String next() { try { StringBuilder res = new StringBuilder(""); int c = System.in.read(); while (Character.isWhitespace(c)) c = System.in.read(); do { res.append((char) c); } while (!Character.isWhitespace(c = System.in.read())); return res.toString(); } catch (Exception e) { return null; } } int[] nextIntArray(int n) { int[] in = new int[n]; for (int i = 0; i < n; i++) { in[i] = nextInt(); } return in; } int[][] nextInt2dArray(int n, int m) { int[][] in = new int[n][m]; for (int i = 0; i < n; i++) { in[i] = nextIntArray(m); } return in; } double[] nextDoubleArray(int n) { double[] in = new double[n]; for (int i = 0; i < n; i++) { in[i] = nextDouble(); } return in; } long[] nextLongArray(int n) { long[] in = new long[n]; for (int i = 0; i < n; i++) { in[i] = nextLong(); } return in; } char[][] nextCharField(int n, int m) { char[][] in = new char[n][m]; for (int i = 0; i < n; i++) { String s = sc.next(); for (int j = 0; j < m; j++) { in[i][j] = s.charAt(j); } } return in; } } }
Submission Info
Submission Time | |
---|---|
Task | B - 双子とスイカ割り |
User | suigingin |
Language | Java (OpenJDK 1.7.0) |
Score | 100 |
Code Size | 3577 Byte |
Status | AC |
Exec Time | 543 ms |
Memory | 24004 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, test-21.txt, test-22.txt, test-23.txt, test-24.txt, test-25.txt, test-26.txt, test-27.txt, test-28.txt, test-29.txt, test-30.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample-01.txt | AC | 469 ms | 23976 KB |
sample-02.txt | AC | 472 ms | 23864 KB |
sample-03.txt | AC | 474 ms | 23844 KB |
test-01.txt | AC | 468 ms | 23876 KB |
test-02.txt | AC | 469 ms | 23880 KB |
test-03.txt | AC | 472 ms | 24000 KB |
test-04.txt | AC | 464 ms | 23856 KB |
test-05.txt | AC | 471 ms | 23864 KB |
test-06.txt | AC | 461 ms | 23896 KB |
test-07.txt | AC | 472 ms | 23924 KB |
test-08.txt | AC | 470 ms | 23876 KB |
test-09.txt | AC | 470 ms | 23948 KB |
test-10.txt | AC | 469 ms | 23896 KB |
test-11.txt | AC | 462 ms | 23872 KB |
test-12.txt | AC | 468 ms | 23940 KB |
test-13.txt | AC | 467 ms | 23896 KB |
test-14.txt | AC | 495 ms | 23928 KB |
test-15.txt | AC | 484 ms | 23904 KB |
test-16.txt | AC | 543 ms | 23988 KB |
test-17.txt | AC | 476 ms | 23900 KB |
test-18.txt | AC | 471 ms | 23804 KB |
test-19.txt | AC | 471 ms | 23864 KB |
test-20.txt | AC | 475 ms | 24004 KB |
test-21.txt | AC | 480 ms | 23864 KB |
test-22.txt | AC | 465 ms | 23844 KB |
test-23.txt | AC | 464 ms | 23908 KB |
test-24.txt | AC | 458 ms | 23956 KB |
test-25.txt | AC | 475 ms | 23872 KB |
test-26.txt | AC | 490 ms | 23908 KB |
test-27.txt | AC | 490 ms | 23868 KB |
test-28.txt | AC | 467 ms | 23832 KB |
test-29.txt | AC | 480 ms | 23876 KB |
test-30.txt | AC | 457 ms | 23924 KB |