oj.uz

Submission #345700

# Submission time Handle Problem Language Result Execution time Memory
345700 2021-01-08T00:33:07 Z KWang31 Gift (IZhO18_nicegift) Java 11
49 / 100
 2000 ms 165272 KB 
import java.io.*; import java.util.*;
public class nicegift{
  static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
        long nextLong(){
            return Long.parseLong(next());
        }
        
    } 
    public static class Pair implements Comparable<Pair>{
        int ind; long val;
        public Pair(int a, long b){
            this.ind=a; this.val=b;
        }
        public int compareTo(Pair other){
            if(this.val<other.val)return -1;
            if(this.val>other.val)return 1;
            if(this.ind<other.ind)return -1;
            return 1;
        }
    }
    static int MOD=998244353;
    static int[] rk, p,siz;
    public static void main(String[] args){
        FastReader br=new FastReader();
        int N=br.nextInt(); int K=br.nextInt();
        Pair[] a=new Pair[N];
        long sum=0; long max=0;
        for (int i = 0; i < N; i++) {
            a[i]=new Pair(1+i,br.nextLong()); sum+=a[i].val; max=Math.max(max,a[i].val);
        }
        if(sum%K>0 || sum/K < max){
            System.out.println("-1");return;
        }
        //A number is bottle neck if a[i]
        Arrays.sort(a);
        long cur=sum/K;
 
        //Tracks K+1 elements
        long d;StringBuilder ans=new StringBuilder();
        int op=0; int lp=0; int rp=N-1; long v;
        for (int j = 0; j < N; j++) {
        	
            while(lp<N && a[lp].val==0) {
        	lp++;
            }
            while(rp>=0 && a[rp].val==cur) {
                   rp--;
             }
            if(rp<lp)break;
            //System.out.println(j+" "+lp+" "+rp);
            d=Math.min(a[lp].val, cur-a[rp].val);
            if(d==0)continue;
            op++;
            //System.out.println(j+" "+cur+" "+d);
            ans.append(d+" ");
            //System.out.println(lp+K-(N-rp-1));
            for(int k=lp; k<lp+K-(N-rp-1); k++) {//There are at least K elements
            	v=a[k].val-d; a[k]=new Pair(a[k].ind,v); ans.append(a[k].ind+" ");
            	
            }
            for(int k=rp+1; k<N; k++) {
            	v=a[k].val-d; a[k]=new Pair(a[k].ind,v); ans.append(a[k].ind+" ");
            }
            cur-=d;
            ans.append("\n");
        }
        //Now K of them are "bottlenecks"
        
        boolean val=false;
        for (int i = 0; i < N; i++) {
            if(a[i].val>0){
            	
                if(!val){
                    val=true;
                    op++;
                    ans.append(a[i].val+" ");
                }
                ans.append(a[i].ind+" ");
            }
        }
        System.out.println(op);
        System.out.println(ans.toString());
    }
    
    
}
//Debugging:
//Are you sure your algorithm is correct?
//Bounds: long
//Special cases: n=0,1?
//Make sure you remove your debugging code before you submit!

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 10652 KB n=4
2 Correct 139 ms 10748 KB n=3
3 Correct 70 ms 8428 KB n=3
4 Correct 134 ms 10600 KB n=4
5 Correct 72 ms 8556 KB n=4
6 Correct 74 ms 8428 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 10652 KB n=4
2 Correct 139 ms 10748 KB n=3
3 Correct 70 ms 8428 KB n=3
4 Correct 134 ms 10600 KB n=4
5 Correct 72 ms 8556 KB n=4
6 Correct 74 ms 8428 KB n=2
7 Correct 133 ms 10600 KB n=5
8 Correct 73 ms 8556 KB n=8
9 Correct 144 ms 10488 KB n=14
10 Correct 137 ms 10840 KB n=11
11 Correct 650 ms 20964 KB n=50000
12 Correct 605 ms 19536 KB n=50000
13 Correct 134 ms 10472 KB n=10
14 Correct 170 ms 10984 KB n=685
15 Correct 161 ms 10728 KB n=623
16 Correct 192 ms 11728 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 10652 KB n=4
2 Correct 139 ms 10748 KB n=3
3 Correct 70 ms 8428 KB n=3
4 Correct 134 ms 10600 KB n=4
5 Correct 72 ms 8556 KB n=4
6 Correct 74 ms 8428 KB n=2
7 Correct 133 ms 10600 KB n=5
8 Correct 73 ms 8556 KB n=8
9 Correct 144 ms 10488 KB n=14
10 Correct 137 ms 10840 KB n=11
11 Correct 650 ms 20964 KB n=50000
12 Correct 605 ms 19536 KB n=50000
13 Correct 134 ms 10472 KB n=10
14 Correct 170 ms 10984 KB n=685
15 Correct 161 ms 10728 KB n=623
16 Correct 192 ms 11728 KB n=973
17 Correct 234 ms 12008 KB n=989
18 Correct 235 ms 12028 KB n=563
19 Correct 292 ms 13024 KB n=592
20 Correct 305 ms 13252 KB n=938
21 Correct 258 ms 12044 KB n=747
22 Correct 328 ms 13288 KB n=991

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1277 ms 133852 KB n=1000000
2 Correct 1006 ms 90224 KB n=666666
3 Correct 803 ms 57076 KB n=400000
4 Correct 820 ms 50392 KB n=285714
5 Correct 549 ms 17068 KB n=20000
6 Correct 675 ms 34276 KB n=181818
7 Correct 482 ms 15540 KB n=10000
8 Correct 410 ms 15248 KB n=6666
9 Correct 341 ms 15184 KB n=4000
10 Correct 422 ms 15200 KB n=2857
11 Correct 272 ms 13612 KB n=2000

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 10652 KB n=4
2 Correct 139 ms 10748 KB n=3
3 Correct 70 ms 8428 KB n=3
4 Correct 134 ms 10600 KB n=4
5 Correct 72 ms 8556 KB n=4
6 Correct 74 ms 8428 KB n=2
7 Correct 133 ms 10600 KB n=5
8 Correct 73 ms 8556 KB n=8
9 Correct 144 ms 10488 KB n=14
10 Correct 137 ms 10840 KB n=11
11 Correct 650 ms 20964 KB n=50000
12 Correct 605 ms 19536 KB n=50000
13 Correct 134 ms 10472 KB n=10
14 Correct 170 ms 10984 KB n=685
15 Correct 161 ms 10728 KB n=623
16 Correct 192 ms 11728 KB n=973
17 Correct 234 ms 12008 KB n=989
18 Correct 235 ms 12028 KB n=563
19 Correct 292 ms 13024 KB n=592
20 Correct 305 ms 13252 KB n=938
21 Correct 258 ms 12044 KB n=747
22 Correct 328 ms 13288 KB n=991
23 Correct 1277 ms 133852 KB n=1000000
24 Correct 1006 ms 90224 KB n=666666
25 Correct 803 ms 57076 KB n=400000
26 Correct 820 ms 50392 KB n=285714
27 Correct 549 ms 17068 KB n=20000
28 Correct 675 ms 34276 KB n=181818
29 Correct 482 ms 15540 KB n=10000
30 Correct 410 ms 15248 KB n=6666
31 Correct 341 ms 15184 KB n=4000
32 Correct 422 ms 15200 KB n=2857
33 Correct 272 ms 13612 KB n=2000
34 Correct 1048 ms 18992 KB n=23514
35 Correct 1176 ms 18844 KB n=23514
36 Correct 157 ms 10856 KB n=940
37 Correct 135 ms 10472 KB n=2
38 Correct 1667 ms 33396 KB n=100000
39 Correct 1496 ms 33320 KB n=100000
40 Correct 133 ms 10472 KB n=10
41 Correct 230 ms 11900 KB n=100
42 Correct 442 ms 17404 KB n=1000
43 Correct 1443 ms 165272 KB n=1000000
44 Execution timed out 2089 ms 91412 KB Time limit exceeded
45 Halted 0 ms 0 KB -