結果
| 問題 | No.3016 unordered_mapなるたけ落とすマン |
| ユーザー |
 threepipes_s
|
| 提出日時 | 2016-05-22 01:09:33 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
MLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 5,332 bytes |
| コンパイル時間 | 2,937 ms |
| コンパイル使用メモリ | 94,876 KB |
| 実行使用メモリ | 60,588 KB |
| 最終ジャッジ日時 | 2024-10-07 06:01:24 |
| 合計ジャッジ時間 | 28,919 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | MLE | - |
| testcase_01 | MLE | - |
| testcase_02 | MLE | - |
| testcase_03 | MLE | - |
| testcase_04 | MLE | - |
| testcase_05 | MLE | - |
| testcase_06 | MLE | - |
| testcase_07 | MLE | - |
| testcase_08 | MLE | - |
| testcase_09 | MLE | - |
| testcase_10 | MLE | - |
| testcase_11 | MLE | - |
| testcase_12 | MLE | - |
| testcase_13 | MLE | - |
| testcase_14 | MLE | - |
| testcase_15 | MLE | - |
| testcase_16 | MLE | - |
| testcase_17 | MLE | - |
| testcase_18 | MLE | - |
| testcase_19 | MLE | - |
| testcase_20 | MLE | - |
| testcase_21 | MLE | - |
| testcase_22 | MLE | - |
| testcase_23 | MLE | - |
| testcase_24 | MLE | - |
| testcase_25 | MLE | - |
| testcase_26 | MLE | - |
| testcase_27 | MLE | - |
| testcase_28 | MLE | - |
| testcase_29 | MLE | - |
| testcase_30 | MLE | - |
| testcase_31 | MLE | - |
| testcase_32 | MLE | - |
| testcase_33 | MLE | - |
| testcase_34 | MLE | - |
| testcase_35 | MLE | - |
| testcase_36 | MLE | - |
| testcase_37 | MLE | - |
| testcase_38 | MLE | - |
| testcase_39 | MLE | - |
| testcase_40 | MLE | - |
| testcase_41 | MLE | - |
| testcase_42 | MLE | - |
| testcase_43 | MLE | - |
| testcase_44 | MLE | - |
| testcase_45 | MLE | - |
| testcase_46 | MLE | - |
| testcase_47 | MLE | - |
| testcase_48 | MLE | - |
| testcase_49 | MLE | - |
| testcase_50 | MLE | - |
ソースコード
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.Arrays;
import java.util.HashMap;
import java.util.HashSet;
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,out);
in.close();out.close();}catch(IOException e){e.printStackTrace();}}
void dump(int[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d",a[i]);out.println();}
void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();}
long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
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) */
void swap(int[]a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
{int l=0,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 a[s]>v?-1:s;}
void solve(ContestScanner in,Writer out)throws NumberFormatException,IOException{
int n = in.nextInt();
int m = in.nextInt();
long[] a = new long[n];
long min = Long.MAX_VALUE;
for(int i=0; i<n; i++){
a[i] = in.nextLong();
min = Math.min(a[i], min);
}
Arrays.sort(a);
long b;
int idx;
for(int i=0; i<m; i++){
b = in.nextLong();
idx = binarySearchSmallerMax(a, b);
if(idx==-1 || a[idx] != b){
out.print("0 ");
}else{
if(b==min){
out.print((idx+1)+" ");
}else{
out.print((idx-binarySearchSmallerMax(a, a[idx]-1))+" ");
}
}
}
out.println();
}
int binarySearchSmallerMax(long[]a,long v)// get maximum index which a[idx]<=v
{int l=0,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 a[s]>v?-1:s;}
}
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);}
}
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);}
}
class Pair implements Comparable<Pair>{
int a,b;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();}
}