結果
問題 | No.645 Count Permutation |
ユーザー | uwi |
提出日時 | 2018-02-02 21:46:12 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 283 ms / 2,000 ms |
コード長 | 3,733 bytes |
コンパイル時間 | 3,802 ms |
コンパイル使用メモリ | 79,740 KB |
実行使用メモリ | 55,032 KB |
最終ジャッジ日時 | 2023-08-30 02:06:45 |
合計ジャッジ時間 | 9,904 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
48,960 KB |
testcase_01 | AC | 43 ms
49,504 KB |
testcase_02 | AC | 52 ms
49,392 KB |
testcase_03 | AC | 45 ms
49,292 KB |
testcase_04 | AC | 44 ms
49,412 KB |
testcase_05 | AC | 44 ms
49,188 KB |
testcase_06 | AC | 43 ms
49,184 KB |
testcase_07 | AC | 44 ms
49,400 KB |
testcase_08 | AC | 43 ms
49,192 KB |
testcase_09 | AC | 52 ms
49,300 KB |
testcase_10 | AC | 48 ms
49,196 KB |
testcase_11 | AC | 119 ms
53,184 KB |
testcase_12 | AC | 95 ms
51,624 KB |
testcase_13 | AC | 113 ms
54,172 KB |
testcase_14 | AC | 74 ms
50,664 KB |
testcase_15 | AC | 127 ms
53,880 KB |
testcase_16 | AC | 131 ms
53,904 KB |
testcase_17 | AC | 206 ms
54,416 KB |
testcase_18 | AC | 168 ms
54,220 KB |
testcase_19 | AC | 222 ms
54,032 KB |
testcase_20 | AC | 228 ms
53,960 KB |
testcase_21 | AC | 161 ms
53,972 KB |
testcase_22 | AC | 43 ms
49,368 KB |
testcase_23 | AC | 43 ms
49,200 KB |
testcase_24 | AC | 180 ms
53,512 KB |
testcase_25 | AC | 169 ms
54,000 KB |
testcase_26 | AC | 204 ms
54,176 KB |
testcase_27 | AC | 149 ms
53,528 KB |
testcase_28 | AC | 139 ms
53,484 KB |
testcase_29 | AC | 274 ms
54,420 KB |
testcase_30 | AC | 266 ms
55,032 KB |
testcase_31 | AC | 283 ms
54,304 KB |
testcase_32 | AC | 152 ms
54,184 KB |
testcase_33 | AC | 112 ms
53,888 KB |
ソースコード
package contest180202; 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 D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); long L = nl(), R = nl(); long ret = count(R, n) - count(L-1, n); if(ret < 0)ret += 1000000007; out.println(ret); } long count(long R, int n) { if(R < 0)return 0; long[] c = new long[65]; c[0] = 1; int mod = 1000000007; long F = 1; for(int i = 1;i <= n-2;i++){ long[] d = new long[65]; for(int j = 64;j >= 1;j--){ d[j] = c[j-1]; } for(int j = 64;j >= 0;j--){ d[j] += c[j] * i; } for(int j = 0;j < 65;j++){ d[j] %= mod; } c = d; F = F * i % mod; } F = F * (n-1) % mod; long G = F * n % mod; long ret = 0; for(int i = 60;i >= 1;i--){ if(R >= 1L<<i){ ret += c[i-1]; } } ret += G + (mod-F); ret %= mod; return ret; } 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)); } }