結果

問題 No.984 Inversion
ユーザー uwiuwi
提出日時 2020-02-11 14:13:55
言語 Java21
(openjdk 21)
結果
AC  
実行時間 146 ms / 2,000 ms
コード長 4,429 bytes
コンパイル時間 4,102 ms
コンパイル使用メモリ 80,808 KB
実行使用メモリ 57,432 KB
最終ジャッジ日時 2024-04-08 14:54:06
合計ジャッジ時間 7,815 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
53,972 KB
testcase_01 AC 53 ms
53,988 KB
testcase_02 AC 89 ms
55,536 KB
testcase_03 AC 123 ms
56,764 KB
testcase_04 AC 93 ms
56,036 KB
testcase_05 AC 86 ms
55,280 KB
testcase_06 AC 90 ms
55,516 KB
testcase_07 AC 55 ms
53,988 KB
testcase_08 AC 101 ms
56,280 KB
testcase_09 AC 126 ms
57,060 KB
testcase_10 AC 115 ms
54,696 KB
testcase_11 AC 90 ms
55,532 KB
testcase_12 AC 67 ms
54,888 KB
testcase_13 AC 110 ms
54,672 KB
testcase_14 AC 71 ms
55,288 KB
testcase_15 AC 117 ms
56,496 KB
testcase_16 AC 119 ms
56,536 KB
testcase_17 AC 116 ms
56,608 KB
testcase_18 AC 123 ms
56,800 KB
testcase_19 AC 109 ms
56,452 KB
testcase_20 AC 136 ms
56,948 KB
testcase_21 AC 120 ms
56,944 KB
testcase_22 AC 73 ms
54,872 KB
testcase_23 AC 146 ms
57,084 KB
testcase_24 AC 79 ms
55,004 KB
testcase_25 AC 140 ms
57,432 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200211;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class C2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int P = ni();
		int N = ni();
		int S = (int)Math.sqrt(P);
		
		long[] c = new long[S];
		for(int i = 0;i < S;i++) {
			c[i] = (long)i*N%P;
		}
		long add = (P-(long)S*N%P) % P;
		Arrays.sort(c);
		int i = 0;
		long low = P/2+1, high = P;
		long ans = 0;
		for(;i+S-1 <= P/2;i+=S) {
//			tr(c, low, high, ans);
			if(low <= high) {
				ans += lowerBound(c, high) - lowerBound(c, low);
			}else {
				ans += lowerBound(c, high) - lowerBound(c, low) + S;
			}
			low += add; low %= P;
			high += add; high %= P;
		}
//		tr(c, low, high, ans, i);
		while(i <= P/2) {
			if((long)i*N%P >= P/2+1) {
				ans++;
			}
			i++;
		}
//		tr(ans, check(N, P));
//		assert ans%2 == check(N, P);
		out.println(ans%2);
	}
	
	public static int lowerBound(long[] a, long v)
	{
		int low = -1, high = a.length;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}
	

	
	public static long pow(long a, long n, long mod) {
		//		a %= mod;
		long ret = 1;
		int x = 63 - Long.numberOfLeadingZeros(n);
		for (; x >= 0; x--) {
			ret = ret * ret % mod;
			if (n << 63 - x < 0)
				ret = ret * a % mod;
		}
		return ret;
	}
	
	int check(int N, int P)
	{
		long[] a = new long[P];
		for(int i = 0;i < P;i++) {
			a[i] = (long)i*N%P;
		}
		int x = 0;
		for(int i = 0;i < P;i++) {
			for(int j = i+1;j < P;j++) {
				if(a[i] > a[j])x++;
			}
		}
		return x%2;
	}

	
	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 C2().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