結果

問題 No.752 mod数列
コンテスト
ユーザー uwi
提出日時 2018-11-09 21:44:50
言語 Java
(openjdk 23)
結果
AC  
実行時間 733 ms / 2,000 ms
コード長 4,120 bytes
コンパイル時間 4,295 ms
コンパイル使用メモリ 81,392 KB
実行使用メモリ 61,404 KB
最終ジャッジ日時 2024-11-21 05:48:24
合計ジャッジ時間 17,070 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int P = ni(), Q = ni();
		
		int s = (int)Math.sqrt(P);
		
		int[][] qs = new int[Q][];
		for(int i = 0;i < Q;i++) {
			qs[i] = new int[] {ni(), ni()};
		}
		
		int[][] es = new int[2*Q][];
		int p = 0;
		for(int i = 0;i < Q;i++) {
			es[p++] = new int[] {qs[i][0]-1, i, -1};
			es[p++] = new int[] {qs[i][1], i, 1};
		}
		Arrays.sort(es, new Comparator<int[]>() {
			public int compare(int[] a, int[] b) {
				return a[0] - b[0];
			}
		});
		
		long[] anss = new long[Q];
		p = 0;
		while(p < 2*Q && es[p][0] == 0) {
			p++;
		}
		long val = 0;
		for(int i = 1;i <= P/s;i++){
			val += P%i;
			while(p < 2*Q && es[p][0] == i) {
				anss[es[p][1]] += es[p][2] * val;
				p++;
			}
		}
		
		int pk = s-1;
		int px = P/s;
		for(;p < 2*Q;p++) {
			int x = es[p][0];
			for(int i = pk;i >= P/x;i--) {
				pk = i;
				int lx = px + 1;
				int rx = Math.min(x, i <= 0 ? Integer.MAX_VALUE : P/i);
//				tr(lx, P%lx, rx, P%rx, i);
				val += (long)(rx-lx+1)*(P%lx+P%rx)/2;
				px = rx;
			}
			anss[es[p][1]] += es[p][2] * val;
		}
		
		for(long v : anss) {
			out.println(v);
		}
	}
	
	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 C().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