Submission #994508
Source Code Expand
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.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;
import java.util.TreeMap;
public class Main {
static ContestScanner in;static Writer out;static StringBuilder sb=new StringBuilder();
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){sb.setLength(0);for(int i=0;i<a.length;i++)
sb.append(a[i]).append("\t");out.println(sb.toString().trim());}
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 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 x=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[x++]=a[r++];else b[x++]=a[l++];}
while(r<re)b[x++]=a[r++];while(l<le)b[x++]=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 x=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[x++]=a[r++];else b[x++]=a[l++];}
while(r<re)b[x++]=a[r++];while(l<le)b[x++]=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;}
List<Integer>[]randomTree(int n,Random r){List<Integer>[]g=graph(n);
for(int i=1;i<n;i++){int p=r.nextInt(i);g[p].add(i);g[i].add(p);}return g;}
@SuppressWarnings("unchecked")
static List<Integer>[]graph(int n){List<Integer>[]g=new List[n];
for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}
void solve() throws NumberFormatException, IOException{
long tn = in.nextLong();
long ta = in.nextLong();
if(tn>2000000) return;
int n = (int)tn;
int a = (int)ta;
BIT bit = new BIT(n+1);
bit.add(0, 1);
int[] s = new int[n+1];
Arrays.fill(s, n);
s[1] = 0;
for(int i=2; i<n; i++){
final long x = bit.sum(i);
final long sp = s[(int)x];
if(sp>i) continue;
final long c = (i-sp)*x;
if(c>=n){
System.out.println(i);
return;
}
int left = i+a;
int right = n;
int ans = n;
while(left<=right){
final int mid = (left+right)/2;
final long ck = (mid-(i+a))*c;
final int bt = bit.sum(mid);
final long pck = bt*(mid-s[bt]);
if(ck>=pck){
ans = mid;
right = mid-1;
}else{
left = mid+1;
}
}
if(ans<n){
bit.add(ans, (int)c-bit.sum(ans));
s[(int)c] = i+a;
}
}
System.out.println(n);
}
}
class BIT{
int n;
int[] bit;
public BIT(int n){
this.n = n;
bit = new int[n+1];
}
void add(int idx, int val){
for(int i=idx+1; i<=n; i+=i&(-i)) bit[i-1] += val;
}
int sum(int idx){
int res = 0;
for(int i=idx+1; i>0; i-=i&(-i)) res += bit[i-1];
return res;
}
int sum(int begin, int end){
if(begin == 0) return sum(end);
return sum(end)-sum(begin-1);
}
}
@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;}
@Override
public String toString() {
return String.format("(%d, %d)", a, b);
}
}
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();}
}
Submission Info
Submission Time |
|
Task |
E - Cookies |
User |
threepipes_s |
Language |
Java8 (OpenJDK 1.8.0) |
Score |
0 |
Code Size |
8143 Byte |
Status |
WA |
Exec Time |
145 ms |
Memory |
16976 KB |
Judge Result
Set Name |
sample |
dataset1 |
dataset2 |
Score / Max Score |
0 / 0 |
0 / 500 |
0 / 500 |
Status |
|
|
|
Set Name |
Test Cases |
sample |
sample-01.txt, sample-02.txt, sample-03.txt |
dataset1 |
sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt |
dataset2 |
sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt, 02-17.txt, 02-18.txt, 02-19.txt, 02-20.txt, 02-21.txt, 02-22.txt, 02-23.txt, 02-24.txt, 02-25.txt, 02-26.txt, 02-27.txt, 02-28.txt, 02-29.txt, 02-30.txt, 02-31.txt, 02-32.txt, 02-33.txt, 02-34.txt, 02-35.txt, 02-36.txt, 02-37.txt, 02-38.txt, 02-39.txt, 02-40.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
115 ms |
16336 KB |
01-02.txt |
AC |
115 ms |
16340 KB |
01-03.txt |
AC |
115 ms |
16336 KB |
01-04.txt |
AC |
115 ms |
16332 KB |
01-05.txt |
AC |
116 ms |
16332 KB |
01-06.txt |
AC |
115 ms |
16336 KB |
01-07.txt |
WA |
121 ms |
16592 KB |
01-08.txt |
WA |
117 ms |
16336 KB |
01-09.txt |
WA |
119 ms |
16336 KB |
01-10.txt |
WA |
116 ms |
16340 KB |
01-11.txt |
WA |
127 ms |
16976 KB |
01-12.txt |
AC |
144 ms |
16588 KB |
01-13.txt |
AC |
145 ms |
16596 KB |
01-14.txt |
AC |
104 ms |
8788 KB |
01-15.txt |
AC |
111 ms |
12624 KB |
01-16.txt |
AC |
119 ms |
12624 KB |
01-17.txt |
WA |
114 ms |
16212 KB |
01-18.txt |
AC |
102 ms |
8400 KB |
01-19.txt |
AC |
102 ms |
8404 KB |
01-20.txt |
AC |
99 ms |
8528 KB |
01-21.txt |
AC |
100 ms |
8404 KB |
01-22.txt |
AC |
101 ms |
8404 KB |
01-23.txt |
AC |
101 ms |
8404 KB |
01-24.txt |
AC |
101 ms |
8528 KB |
01-25.txt |
AC |
101 ms |
8528 KB |
01-26.txt |
AC |
101 ms |
8528 KB |
02-01.txt |
AC |
102 ms |
8404 KB |
02-02.txt |
WA |
100 ms |
8400 KB |
02-03.txt |
WA |
98 ms |
8404 KB |
02-04.txt |
WA |
100 ms |
8400 KB |
02-05.txt |
WA |
101 ms |
8404 KB |
02-06.txt |
WA |
101 ms |
8400 KB |
02-07.txt |
WA |
99 ms |
8404 KB |
02-08.txt |
WA |
100 ms |
8400 KB |
02-09.txt |
WA |
100 ms |
8404 KB |
02-10.txt |
WA |
100 ms |
8276 KB |
02-11.txt |
WA |
101 ms |
8404 KB |
02-12.txt |
WA |
101 ms |
8400 KB |
02-13.txt |
WA |
100 ms |
8404 KB |
02-14.txt |
WA |
100 ms |
8400 KB |
02-15.txt |
WA |
100 ms |
8396 KB |
02-16.txt |
WA |
99 ms |
8404 KB |
02-17.txt |
WA |
98 ms |
8404 KB |
02-18.txt |
WA |
103 ms |
8400 KB |
02-19.txt |
WA |
101 ms |
8400 KB |
02-20.txt |
WA |
102 ms |
8404 KB |
02-21.txt |
WA |
101 ms |
8404 KB |
02-22.txt |
WA |
101 ms |
8528 KB |
02-23.txt |
WA |
100 ms |
8396 KB |
02-24.txt |
WA |
101 ms |
8404 KB |
02-25.txt |
WA |
101 ms |
8404 KB |
02-26.txt |
WA |
101 ms |
8404 KB |
02-27.txt |
WA |
100 ms |
8404 KB |
02-28.txt |
WA |
102 ms |
8400 KB |
02-29.txt |
WA |
100 ms |
8400 KB |
02-30.txt |
WA |
102 ms |
8404 KB |
02-31.txt |
WA |
101 ms |
8404 KB |
02-32.txt |
WA |
100 ms |
8400 KB |
02-33.txt |
WA |
100 ms |
8396 KB |
02-34.txt |
WA |
100 ms |
8396 KB |
02-35.txt |
WA |
100 ms |
8404 KB |
02-36.txt |
WA |
100 ms |
8400 KB |
02-37.txt |
WA |
100 ms |
8400 KB |
02-38.txt |
WA |
100 ms |
8400 KB |
02-39.txt |
WA |
101 ms |
8400 KB |
02-40.txt |
WA |
100 ms |
8400 KB |
sample-01.txt |
AC |
102 ms |
8400 KB |
sample-02.txt |
WA |
102 ms |
8400 KB |
sample-03.txt |
AC |
118 ms |
9420 KB |