結果

問題 No.849 yuki国の分割統治
ユーザー uwiuwi
提出日時 2019-07-05 21:57:43
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,320 bytes
コンパイル時間 4,308 ms
コンパイル使用メモリ 81,308 KB
実行使用メモリ 50,344 KB
最終ジャッジ日時 2024-04-16 07:17:37
合計ジャッジ時間 9,639 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,984 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 54 ms
36,964 KB
testcase_04 AC 54 ms
36,624 KB
testcase_05 WA -
testcase_06 AC 55 ms
36,960 KB
testcase_07 AC 148 ms
44,628 KB
testcase_08 AC 175 ms
45,900 KB
testcase_09 AC 177 ms
45,828 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 154 ms
45,148 KB
testcase_13 AC 180 ms
46,192 KB
testcase_14 WA -
testcase_15 AC 171 ms
45,808 KB
testcase_16 AC 199 ms
46,416 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 166 ms
45,400 KB
testcase_20 AC 184 ms
46,008 KB
testcase_21 AC 126 ms
40,416 KB
testcase_22 AC 173 ms
46,264 KB
testcase_23 AC 181 ms
46,068 KB
testcase_24 AC 155 ms
44,984 KB
testcase_25 AC 219 ms
50,200 KB
testcase_26 AC 55 ms
36,900 KB
testcase_27 AC 54 ms
36,864 KB
testcase_28 AC 54 ms
37,084 KB
testcase_29 AC 53 ms
37,016 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190705;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;

// (a c)(u)
// (b d)(v)
public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long a = nl(), b = nl(), c = nl(), d = nl();
		int n = ni();
		long[] x = new long[n];
		long[] y = new long[n];
		for(int i = 0;i < n;i++) {
			x[i] = ni();
			y[i] = ni();
		}
		
		long D = a*d-b*c;
		if(D != 0) {
			Set<Long> set = new HashSet<>();
			for(int i = 0;i < n;i++) {
				long xx = (d*x[i]-c*y[i]) % D;
				if(xx < 0)xx += D;
				long yy = (-b*x[i]+a*y[i]) % D;
				if(yy < 0)yy += D;
				set.add(xx*114514810 + yy);
			}
			out.println(set.size());
		}else if(a != 0) {
			long h = gcd(Math.abs(a), Math.abs(c));
			
			Set<Long> set = new HashSet<>();
			long aa = a/(Math.abs(a)/h);
			long bb = b/(Math.abs(a)/h);
			for(int i = 0;i < n;i++) {
				long g = x[i] / aa;
				x[i] -= g*aa;
				y[i] -= g*bb;
				set.add(x[i]*114514810 + y[i]);
			}
			out.println(set.size());
		}else {
			long h = gcd(Math.abs(b), Math.abs(d));
			
			Set<Long> set = new HashSet<>();
			long aa = a/(Math.abs(b)/h);
			long bb = b/(Math.abs(b)/h);
			for(int i = 0;i < n;i++) {
				long g = y[i] / bb;
				x[i] -= g*aa;
				y[i] -= g*bb;
				set.add(x[i]*114514810 + y[i]);
			}
			out.println(set.size());
		}
	}
	
	public static long gcd(long a, long b) {
		while (b > 0) {
			long c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new D().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0