結果
問題 | No.1001 注文の多い順列 |
ユーザー | 37zigen |
提出日時 | 2020-04-14 19:22:58 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 270 ms / 2,000 ms |
コード長 | 3,671 bytes |
コンパイル時間 | 2,728 ms |
コンパイル使用メモリ | 91,248 KB |
実行使用メモリ | 134,172 KB |
最終ジャッジ日時 | 2024-04-09 18:05:53 |
合計ジャッジ時間 | 8,498 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
50,552 KB |
testcase_01 | AC | 67 ms
50,936 KB |
testcase_02 | AC | 66 ms
50,700 KB |
testcase_03 | AC | 65 ms
50,484 KB |
testcase_04 | AC | 65 ms
50,768 KB |
testcase_05 | AC | 69 ms
50,940 KB |
testcase_06 | AC | 66 ms
50,936 KB |
testcase_07 | AC | 65 ms
50,672 KB |
testcase_08 | AC | 65 ms
50,960 KB |
testcase_09 | AC | 65 ms
50,512 KB |
testcase_10 | AC | 66 ms
50,804 KB |
testcase_11 | AC | 67 ms
50,680 KB |
testcase_12 | AC | 67 ms
50,948 KB |
testcase_13 | AC | 68 ms
51,104 KB |
testcase_14 | AC | 72 ms
51,068 KB |
testcase_15 | AC | 78 ms
51,236 KB |
testcase_16 | AC | 71 ms
50,844 KB |
testcase_17 | AC | 71 ms
50,916 KB |
testcase_18 | AC | 187 ms
114,776 KB |
testcase_19 | AC | 190 ms
113,076 KB |
testcase_20 | AC | 163 ms
85,376 KB |
testcase_21 | AC | 160 ms
86,156 KB |
testcase_22 | AC | 221 ms
131,512 KB |
testcase_23 | AC | 216 ms
131,708 KB |
testcase_24 | AC | 178 ms
133,028 KB |
testcase_25 | AC | 218 ms
133,740 KB |
testcase_26 | AC | 239 ms
131,920 KB |
testcase_27 | AC | 269 ms
132,264 KB |
testcase_28 | AC | 270 ms
134,172 KB |
testcase_29 | AC | 201 ms
133,492 KB |
testcase_30 | AC | 198 ms
132,700 KB |
testcase_31 | AC | 202 ms
132,352 KB |
testcase_32 | AC | 179 ms
131,512 KB |
testcase_33 | AC | 227 ms
131,436 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.NoSuchElementException; public class Main { final long MOD=(long)1e9+7; long ADD(long a,long b) { return a+b>=MOD?a+b-MOD:a+b; } //t[i]==1 => p[i]>=X[i] :up //t[i]==0 => p[i]<=X[i] :dn void run() { FastScanner sc=new FastScanner(); PrintWriter pw=new PrintWriter(System.out); int N=sc.nextInt();//1<=N<=3000 int[] t=new int[N]; int[] X=new int[N]; ArrayList<Integer> dn=new ArrayList<>(); ArrayList<Integer> up=new ArrayList<>(); for (int i=0;i<N;++i) { t[i]=sc.nextInt(); X[i]=sc.nextInt();//1<=X[i]<=N --X[i]; if (t[i]==1) { up.add(X[i]); } else { dn.add(X[i]); } } long[][] dp=new long[N+1][N+1];//i,j=i個確定、j個upの方に詰めた dp[0][0]=1; Collections.sort(up); Collections.sort(dn,Comparator.comparing(v->-v)); int p=0,q=dn.size(); for (int num=0;num<N;++num) { // i を up,dnのどちらかに割り振る while(p<up.size()&&up.get(p)<=num) ++p; while(q>0&&!(dn.get(q-1)>=num)) --q; for (int ups=0;ups<=num;++ups) { if (dp[num][ups]==0) continue; int dns=num-ups; if (p-ups>0) { dp[num+1][ups+1]=ADD(dp[num+1][ups+1],dp[num][ups]*(p-ups)%MOD); } if (q-(dn.size()-dns-1)>0) { dp[num+1][ups+0]=ADD(dp[num+1][ups+0],dp[num][ups]*(q-(dn.size()-dns-1))%MOD); } } } pw.println(dp[N][up.size()]); pw.close(); } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} public static void main(String[] args) { new Main().run(); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int)nextLong(); } }