結果
| 問題 | No.420 mod2漸化式 |
| ユーザー |
 threepipes_s
|
| 提出日時 | 2016-09-09 22:58:41 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 105 ms / 1,000 ms |
| コード長 | 7,527 bytes |
| コンパイル時間 | 4,272 ms |
| コンパイル使用メモリ | 92,164 KB |
| 実行使用メモリ | 39,596 KB |
| 最終ジャッジ日時 | 2024-12-24 11:12:08 |
| 合計ジャッジ時間 | 8,631 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 35 |
ソースコード
import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.Closeable;import java.io.FileInputStream;import java.io.FileWriter;import java.io.IOException;import java.io.InputStreamReader;import java.io.PrintWriter;import java.util.ArrayList;import java.util.Arrays;import java.util.HashMap;import java.util.HashSet;import java.util.List;import java.util.TreeMap;public class Main {static ContestScanner in;static Writer out;public static void main(String[] args){try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve();in.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}}static void dump(int[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();}static void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}static void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();}static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}static void m_sort(int[]a,int s,int sz,int[]b){if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}static void m_sort(long[]a,int s,int sz,long[]b){if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}static void swap(long[] a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}static void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}static int binarySearchSmallerMax(int[]a,int v,int l,int r){int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}@SuppressWarnings("unchecked")static List<Integer>[]createGraph(int n){List<Integer>[]g=new List[n];for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}void solve() throws IOException{int x = in.nextInt();if(x>31){System.out.println(0+" "+0);return;}if(x==0){System.out.println(1+" "+0);return;}long sum = 0;long[][] p = pascalT(32);long cnt = p[31][x];for(int i=0; i<31; i++){sum += p[30][x-1]<<i;}System.out.println(cnt+" "+sum);}public static long[][] pascalT(int n){long[][] tri = new long[n][];for(int i=0; i<n; i++){tri[i] = new long[i+1];for(int j=0; j<i+1; j++){if(j == 0 || j == i){tri[i][j] = 1;}else{tri[i][j] = tri[i-1][j-1] + tri[i-1][j];}}}return tri;}}class Combination{int n, r, sp;int[] p;/*** 30C15: 1000s+* 40C10: 5000s-*/Combination(int n, int r){this.n = n;this.r = r;if(n<r){System.err.println("Error: n must be larger than r."+ " (n, r) = ("+n+", "+r+")");this.r = n;}sp = -1;p = new int[r];}boolean next(){if(sp==-1){for(sp=0; sp<r; sp++) p[sp] = sp;return true;}while(sp>0 && p[--sp]+r-sp>=n);if(p[0]==n-r) return false;p[sp++]++;while(sp<r) p[sp] = p[sp++-1]+1;return true;}}@SuppressWarnings("serial")class MultiSet<T> extends HashMap<T, Integer>{@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}public void add(T key,int v){put(key,get(key)+v);}public void add(T key){put(key,get(key)+1);}public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}public MultiSet<T> merge(MultiSet<T> set){MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}}@SuppressWarnings("serial")class OrderedMultiSet<T> extends TreeMap<T, Integer>{@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}public void add(T key,int v){put(key,get(key)+v);}public void add(T key){put(key,get(key)+1);}public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}public OrderedMultiSet<T> merge(OrderedMultiSet<T> set){OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}}class Pair implements Comparable<Pair>{int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}public int hashCode(){return hash;}public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}}class Timer{long time;public void set(){time=System.currentTimeMillis();}public long stop(){return time=System.currentTimeMillis()-time;}public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}@Override public String toString(){return"Time: "+time+"ms";}}class Writer extends PrintWriter{public Writer(String filename)throws IOException{super(new BufferedWriter(new FileWriter(filename)));}public Writer()throws IOException{super(System.out);}}class ContestScanner implements Closeable{private BufferedReader in;private int c=-2;public ContestScanner()throws IOException{in=new BufferedReader(new InputStreamReader(System.in));}public ContestScanner(String filename)throws IOException{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}public String nextToken()throws IOException {StringBuilder sb=new StringBuilder();while((c=in.read())!=-1&&Character.isWhitespace(c));while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}return sb.toString();}public String readLine()throws IOException{StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}return sb.toString();}public long nextLong()throws IOException,NumberFormatException{return Long.parseLong(nextToken());}public int nextInt()throws NumberFormatException,IOException{return(int)nextLong();}public double nextDouble()throws NumberFormatException,IOException{return Double.parseDouble(nextToken());}public void close() throws IOException {in.close();}}