結果
問題 | No.321 (P,Q)-サンタと街の子供たち |
ユーザー | threepipes_s |
提出日時 | 2015-12-14 00:51:14 |
言語 | Java21 (openjdk 21) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,973 bytes |
コンパイル時間 | 2,463 ms |
コンパイル使用メモリ | 77,840 KB |
実行使用メモリ | 57,924 KB |
最終ジャッジ日時 | 2023-10-13 15:11:47 |
合計ジャッジ時間 | 11,817 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | AC | 44 ms
50,052 KB |
testcase_02 | AC | 45 ms
49,388 KB |
testcase_03 | AC | 45 ms
49,708 KB |
testcase_04 | AC | 44 ms
49,692 KB |
testcase_05 | RE | - |
testcase_06 | AC | 45 ms
47,468 KB |
testcase_07 | AC | 46 ms
49,472 KB |
testcase_08 | AC | 47 ms
49,688 KB |
testcase_09 | AC | 46 ms
50,012 KB |
testcase_10 | AC | 46 ms
49,888 KB |
testcase_11 | AC | 46 ms
49,892 KB |
testcase_12 | AC | 45 ms
49,408 KB |
testcase_13 | AC | 45 ms
47,328 KB |
testcase_14 | AC | 228 ms
56,964 KB |
testcase_15 | AC | 326 ms
57,568 KB |
testcase_16 | AC | 199 ms
55,912 KB |
testcase_17 | AC | 53 ms
49,512 KB |
testcase_18 | AC | 211 ms
56,308 KB |
testcase_19 | AC | 242 ms
57,332 KB |
testcase_20 | AC | 320 ms
57,812 KB |
testcase_21 | AC | 234 ms
57,164 KB |
testcase_22 | AC | 152 ms
55,400 KB |
testcase_23 | AC | 286 ms
56,012 KB |
testcase_24 | AC | 166 ms
55,924 KB |
testcase_25 | AC | 221 ms
56,856 KB |
testcase_26 | AC | 320 ms
57,500 KB |
testcase_27 | AC | 275 ms
57,540 KB |
testcase_28 | AC | 252 ms
57,396 KB |
testcase_29 | AC | 312 ms
57,476 KB |
testcase_30 | AC | 107 ms
53,436 KB |
testcase_31 | AC | 71 ms
50,008 KB |
testcase_32 | AC | 218 ms
56,944 KB |
testcase_33 | AC | 211 ms
56,464 KB |
testcase_34 | AC | 190 ms
55,996 KB |
testcase_35 | AC | 265 ms
57,708 KB |
testcase_36 | AC | 118 ms
53,840 KB |
testcase_37 | AC | 231 ms
56,864 KB |
testcase_38 | AC | 206 ms
56,444 KB |
testcase_39 | AC | 144 ms
56,148 KB |
testcase_40 | AC | 313 ms
57,924 KB |
testcase_41 | AC | 166 ms
56,348 KB |
testcase_42 | AC | 280 ms
57,652 KB |
testcase_43 | AC | 198 ms
56,116 KB |
testcase_44 | AC | 265 ms
57,300 KB |
ソースコード
import java.io.BufferedReader; import java.io.BufferedWriter; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.FileWriter; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.HashMap; import java.util.Queue; public class Main { public static void main(String[] args) throws NumberFormatException, IOException {Solve solve = new Solve();solve.solve();} } class Solve{ class Pos{ int x, y; Pos(int x, int y){ this.x = x; this.y = y; } } void solve() throws NumberFormatException, IOException{ ContestScanner in = new ContestScanner(); Writer out = new Writer(); // int a = in.nextInt(); // int b = in.nextInt(); // int[] dx = {a, a, b, b, -a, -a, -b, -b}; // int[] dy = {b, -b, a, -a, a, -a, b, -b}; // int h = 41; // int w = 41; // boolean[][] map = new boolean[41][41]; // Queue<Pos> qu = new ArrayDeque<>(); // qu.add(new Pos(20, 20)); // while(!qu.isEmpty()){ // Pos p = qu.poll(); // if(map[p.y][p.x]) continue; // map[p.y][p.x] = true; // for(int i=0; i<dx.length; i++){ // final int nx = dx[i]+p.x; // final int ny = dy[i]+p.y; // if(nx<0||nx>=41||ny<0||ny>=41) continue; // qu.add(new Pos(nx, ny)); // } // } // for(int i=0; i<h; i++){ // for(int j=0; j<w; j++){ // System.out.print(map[i][j]?'o':'x'); // } // System.out.println(); // } int p = in.nextInt(); int q = in.nextInt(); int g; if(p==0||q==0){ g = p+q; }else g = gcd(p, q); int diff = Math.max(p, q)/g-Math.min(p, q)/g; int n = in.nextInt(); int count = 0; for(int i=0; i<n; i++){ int x = in.nextInt(); int y = in.nextInt(); if(x%g==0&&y%g==0){ x /= g; y /= g; if(diff%2!=0||(x+y)%2==0){ count++; continue; } } } // int g; // if(a==0||b==0){ // g = a+b; // }else g = gcd(a, b); // int diff = Math.max(a, b)/g-Math.min(a, b)/g; // for(int i=0; i<h; i++){ // for(int j=0; j<w; j++){ // int y = i-20; // int x = j-20; // if(x%g==0&&y%g==0){ // if(diff%2!=0||(x+y)%2==0) // System.out.print('o'); // else System.out.print('x'); // }else System.out.print('x'); // } // System.out.println(); // } System.out.println(count); } static int gcd(int a, int b){ return b == 0 ? a : gcd(b, a % b); } } class MultiSet<T> extends HashMap<T, Integer>{ @Override public Integer get(Object key){return containsKey(key)?super.get(key):0;} public void add(T key,int v){put(key,get(key)+v);} public void add(T key){put(key,get(key)+1);} public void sub(T key){ final int num = get(key); if(num==1) remove(key); else put(key, num-1); } } class Timer{ long time; public void set(){time = System.currentTimeMillis();} public long stop(){return System.currentTimeMillis()-time;} } class Writer extends PrintWriter{ public Writer(String filename) throws IOException {super(new BufferedWriter(new FileWriter(filename)));} public Writer() throws IOException{super(System.out);} } class ContestScanner { private BufferedReader reader; private String[] line; private int idx; public ContestScanner() throws FileNotFoundException {reader = new BufferedReader(new InputStreamReader(System.in));} public ContestScanner(String filename) throws FileNotFoundException {reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));} public String nextToken() throws IOException { if (line == null || line.length <= idx) { line = reader.readLine().trim().split(" "); idx = 0; } return line[idx++]; } public String readLine() throws IOException{return reader.readLine();} public long nextLong() throws IOException, NumberFormatException {return Long.parseLong(nextToken());} public int nextInt() throws NumberFormatException, IOException {return (int) nextLong();} public double nextDouble() throws NumberFormatException, IOException {return Double.parseDouble(nextToken());} }