oj.uz

Submission #336171

# Submission time Handle Problem Language Result Execution time Memory
336171 2020-12-14T23:53:10 Z KWang31 Fun Tour (APIO20_fun) Java 11
100 / 100
 1463 ms 45820 KB 
import java.util.*;
public class fun {
    public static class Pair implements Comparable<Pair>{
        int vtx; int val;
        public Pair(int a, int b){
            this.vtx=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.vtx<other.vtx)return -1;
            return 1;
        }
    }
    public static int[] createFunTour(int N, int Q){
        if(N==2){
            int[] a=new int[2]; a[1]=1; return a;
        }
        int min=N; int ind=0; int sz=0;
        for (int i = 1; i < N; i++) {
            sz=grader.attractionsBehind(0,i);
            if(2*sz>=N && sz<min){
                min=sz; ind=i;
            }
            
        }
        int c=0;
        if(min!=N){
            c=ind;//Centroid
        }
        int[] ch=new int[3]; Arrays.fill(ch,-1);
        sz=0;
        for (int i = 0; i < N; i++) {
            if(i==c)continue;
            if(grader.hoursRequired(c,i)==1){
                ch[sz]=i; sz++;
            }
        }
        int x,y;
        
        ArrayList<Pair> arl[]=new ArrayList[3];
        for(int i=0;i<3;i++){arl[i]=new ArrayList<>(); if(i<sz){arl[i].add(new Pair(ch[i],1));}}
        
        if(sz==3){
            for (int i = 0; i < N; i++) {
                if(i==c || i==ch[0] || i==ch[1] || i==ch[2])continue;
                x=grader.hoursRequired(ch[0],i);
                y=grader.hoursRequired(ch[1],i);
                if(x<y){
                    arl[0].add(new Pair(i,x+1));
                }else if(y<x){
                    arl[1].add(new Pair(i,y+1));
                }else{
                    arl[2].add(new Pair(i,x-1));
                }
            }
        }else{
            for (int i = 0; i < N; i++) {
                if(i==c || i==ch[0] || i==ch[1])continue;
                x=grader.hoursRequired(ch[0],i);
                y=grader.hoursRequired(ch[1],i);
                if(x<y){
                    arl[0].add(new Pair(i,x+1));
                }else{
                    arl[1].add(new Pair(i,y+1));
                }
            }
        }
        
        int[] a=new int[N]; int[] b=new int[N];
        if(arl[0].size()==N/2){
            arl[1].add(new Pair(c,-1));
        }else{
            arl[0].add(new Pair(c,-1));
        }
        for(int i=0;i<3;i++){Collections.sort(arl[i]);}//Sort in descending order
        if(sz==2){
          int[] p=new int[2]; int cur=0;
          if(arl[1].size()>arl[0].size()){
             cur=1;
          }
          for(int done=0; done<N; done++){
             a[done]=arl[cur].get(p[cur]).vtx; p[cur]++; cur=1-cur;
          }
          return a;
        }
        int[] p=new int[3];//Keeps current pointer
        int z=0;
        
        int cur=0;//We cannot use vertices from the same subtree twice in a row
        x=arl[0].get(p[0]).val;  y=0;
        for(int i=1; i<3; i++){
          if(!arl[i].isEmpty() && arl[i].get(0).val >= x){
             x=arl[i].get(0).val; cur=i;
          }
        }
        //System.out.println(arl[0].size()+" "+cur);
        a[0]=arl[cur].get(p[cur]).vtx; p[cur]++;
        //System.out.println(a[0]+".."+cur);
        //System.out.println(Arrays.toString(p));
        for(int done=1; done<N; done++){
            if(p[(cur+1)%3]<arl[(cur+1)%3].size()){x=arl[(cur+1)%3].get(p[(cur+1)%3]).val;} else{x=-5;}
            if(p[(cur+2)%3]<arl[(cur+2)%3].size()){y=arl[(cur+2)%3].get(p[(cur+2)%3]).val;} else{y=-5;}
            if(x==-5 && y==-5){
               a[done]=arl[cur].get(p[cur]).vtx; return a;
            }else if(2*(arl[(cur+1)%3].size()-p[(cur+1)%3])>=N-done+1 && y<=b[done-1]){
              cur=(cur+1)%3;
            }else if(2*(arl[(cur+2)%3].size()-p[(cur+2)%3])>=N-done+1 && x<=b[done-1]){
              cur=(cur+2)%3;
            }else if(x>y){
              cur=(cur+1)%3;
              
            }else{
              cur=(cur+2)%3;
            }
            //System.out.println(done+" "+cur+" "+p[cur]);
            a[done]=arl[cur].get(p[cur]).vtx; 
            b[done]=arl[cur].get(p[cur]).val;
            p[cur]++;
        }
        
        return a;
    }
}

Compilation message

Note: fun.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 8668 KB Output is correct
2 Correct 77 ms 8400 KB Output is correct
3 Correct 74 ms 8556 KB Output is correct
4 Correct 73 ms 8500 KB Output is correct
5 Correct 75 ms 8552 KB Output is correct
6 Correct 79 ms 8556 KB Output is correct
7 Correct 73 ms 8556 KB Output is correct
8 Correct 72 ms 8552 KB Output is correct
9 Correct 74 ms 8428 KB Output is correct
10 Correct 72 ms 8576 KB Output is correct
11 Correct 74 ms 8536 KB Output is correct
12 Correct 74 ms 8540 KB Output is correct
13 Correct 73 ms 8448 KB Output is correct
14 Correct 75 ms 8556 KB Output is correct
15 Correct 74 ms 8556 KB Output is correct
16 Correct 87 ms 8556 KB Output is correct
17 Correct 74 ms 8556 KB Output is correct
18 Correct 74 ms 8684 KB Output is correct
19 Correct 74 ms 8556 KB Output is correct
20 Correct 76 ms 8540 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 8668 KB Output is correct
2 Correct 77 ms 8400 KB Output is correct
3 Correct 74 ms 8556 KB Output is correct
4 Correct 73 ms 8500 KB Output is correct
5 Correct 75 ms 8552 KB Output is correct
6 Correct 79 ms 8556 KB Output is correct
7 Correct 73 ms 8556 KB Output is correct
8 Correct 72 ms 8552 KB Output is correct
9 Correct 74 ms 8428 KB Output is correct
10 Correct 72 ms 8576 KB Output is correct
11 Correct 74 ms 8536 KB Output is correct
12 Correct 74 ms 8540 KB Output is correct
13 Correct 73 ms 8448 KB Output is correct
14 Correct 75 ms 8556 KB Output is correct
15 Correct 74 ms 8556 KB Output is correct
16 Correct 87 ms 8556 KB Output is correct
17 Correct 74 ms 8556 KB Output is correct
18 Correct 74 ms 8684 KB Output is correct
19 Correct 74 ms 8556 KB Output is correct
20 Correct 76 ms 8540 KB Output is correct
21 Correct 74 ms 8556 KB Output is correct
22 Correct 75 ms 8556 KB Output is correct
23 Correct 74 ms 8556 KB Output is correct
24 Correct 99 ms 9604 KB Output is correct
25 Correct 77 ms 8668 KB Output is correct
26 Correct 79 ms 8556 KB Output is correct
27 Correct 81 ms 8556 KB Output is correct
28 Correct 72 ms 8588 KB Output is correct
29 Correct 98 ms 9752 KB Output is correct
30 Correct 93 ms 8684 KB Output is correct
31 Correct 91 ms 9408 KB Output is correct
32 Correct 88 ms 9476 KB Output is correct
33 Correct 77 ms 8556 KB Output is correct
34 Correct 99 ms 9632 KB Output is correct
35 Correct 94 ms 9840 KB Output is correct
36 Correct 98 ms 9716 KB Output is correct
37 Correct 75 ms 8556 KB Output is correct
38 Correct 96 ms 9700 KB Output is correct
39 Correct 92 ms 9604 KB Output is correct
40 Correct 94 ms 9732 KB Output is correct
41 Correct 78 ms 8552 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 8400 KB Output is correct
2 Correct 74 ms 8556 KB Output is correct
3 Correct 73 ms 8500 KB Output is correct
4 Correct 75 ms 8552 KB Output is correct
5 Correct 79 ms 8556 KB Output is correct
6 Correct 73 ms 8556 KB Output is correct
7 Correct 72 ms 8552 KB Output is correct
8 Correct 74 ms 8428 KB Output is correct
9 Correct 74 ms 8556 KB Output is correct
10 Correct 75 ms 8556 KB Output is correct
11 Correct 74 ms 8556 KB Output is correct
12 Correct 99 ms 9604 KB Output is correct
13 Correct 77 ms 8668 KB Output is correct
14 Correct 79 ms 8556 KB Output is correct
15 Correct 81 ms 8556 KB Output is correct
16 Correct 96 ms 9716 KB Output is correct
17 Correct 92 ms 9680 KB Output is correct
18 Correct 555 ms 42264 KB Output is correct
19 Correct 122 ms 10024 KB Output is correct
20 Correct 158 ms 10420 KB Output is correct
21 Correct 172 ms 10644 KB Output is correct
22 Correct 215 ms 13468 KB Output is correct
23 Correct 369 ms 19152 KB Output is correct
24 Correct 406 ms 19244 KB Output is correct
25 Correct 490 ms 30892 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 8400 KB Output is correct
2 Correct 74 ms 8556 KB Output is correct
3 Correct 72 ms 8576 KB Output is correct
4 Correct 74 ms 8536 KB Output is correct
5 Correct 74 ms 8540 KB Output is correct
6 Correct 73 ms 8448 KB Output is correct
7 Correct 72 ms 8588 KB Output is correct
8 Correct 98 ms 9752 KB Output is correct
9 Correct 93 ms 8684 KB Output is correct
10 Correct 91 ms 9408 KB Output is correct
11 Correct 88 ms 9476 KB Output is correct
12 Correct 77 ms 8556 KB Output is correct
13 Correct 115 ms 9764 KB Output is correct
14 Correct 275 ms 13588 KB Output is correct
15 Correct 923 ms 42232 KB Output is correct
16 Correct 856 ms 41124 KB Output is correct
17 Correct 539 ms 21676 KB Output is correct
18 Correct 744 ms 27892 KB Output is correct
19 Correct 857 ms 38380 KB Output is correct
20 Correct 196 ms 11072 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 8668 KB Output is correct
2 Correct 77 ms 8400 KB Output is correct
3 Correct 74 ms 8556 KB Output is correct
4 Correct 73 ms 8500 KB Output is correct
5 Correct 75 ms 8552 KB Output is correct
6 Correct 79 ms 8556 KB Output is correct
7 Correct 73 ms 8556 KB Output is correct
8 Correct 72 ms 8552 KB Output is correct
9 Correct 74 ms 8428 KB Output is correct
10 Correct 72 ms 8576 KB Output is correct
11 Correct 74 ms 8536 KB Output is correct
12 Correct 74 ms 8540 KB Output is correct
13 Correct 73 ms 8448 KB Output is correct
14 Correct 75 ms 8556 KB Output is correct
15 Correct 74 ms 8556 KB Output is correct
16 Correct 87 ms 8556 KB Output is correct
17 Correct 74 ms 8556 KB Output is correct
18 Correct 74 ms 8684 KB Output is correct
19 Correct 74 ms 8556 KB Output is correct
20 Correct 76 ms 8540 KB Output is correct
21 Correct 74 ms 8556 KB Output is correct
22 Correct 75 ms 8556 KB Output is correct
23 Correct 74 ms 8556 KB Output is correct
24 Correct 99 ms 9604 KB Output is correct
25 Correct 77 ms 8668 KB Output is correct
26 Correct 79 ms 8556 KB Output is correct
27 Correct 81 ms 8556 KB Output is correct
28 Correct 72 ms 8588 KB Output is correct
29 Correct 98 ms 9752 KB Output is correct
30 Correct 93 ms 8684 KB Output is correct
31 Correct 91 ms 9408 KB Output is correct
32 Correct 88 ms 9476 KB Output is correct
33 Correct 77 ms 8556 KB Output is correct
34 Correct 99 ms 9632 KB Output is correct
35 Correct 94 ms 9840 KB Output is correct
36 Correct 98 ms 9716 KB Output is correct
37 Correct 75 ms 8556 KB Output is correct
38 Correct 96 ms 9700 KB Output is correct
39 Correct 92 ms 9604 KB Output is correct
40 Correct 94 ms 9732 KB Output is correct
41 Correct 78 ms 8552 KB Output is correct
42 Correct 96 ms 9716 KB Output is correct
43 Correct 92 ms 9680 KB Output is correct
44 Correct 555 ms 42264 KB Output is correct
45 Correct 122 ms 10024 KB Output is correct
46 Correct 158 ms 10420 KB Output is correct
47 Correct 172 ms 10644 KB Output is correct
48 Correct 215 ms 13468 KB Output is correct
49 Correct 369 ms 19152 KB Output is correct
50 Correct 406 ms 19244 KB Output is correct
51 Correct 490 ms 30892 KB Output is correct
52 Correct 115 ms 9764 KB Output is correct
53 Correct 275 ms 13588 KB Output is correct
54 Correct 923 ms 42232 KB Output is correct
55 Correct 856 ms 41124 KB Output is correct
56 Correct 539 ms 21676 KB Output is correct
57 Correct 744 ms 27892 KB Output is correct
58 Correct 857 ms 38380 KB Output is correct
59 Correct 196 ms 11072 KB Output is correct
60 Correct 705 ms 41348 KB Output is correct
61 Correct 1058 ms 42892 KB Output is correct
62 Correct 723 ms 41272 KB Output is correct
63 Correct 977 ms 43704 KB Output is correct
64 Correct 975 ms 43508 KB Output is correct
65 Correct 834 ms 42300 KB Output is correct
66 Correct 1078 ms 44164 KB Output is correct
67 Correct 974 ms 45188 KB Output is correct
68 Correct 1117 ms 44620 KB Output is correct
69 Correct 1435 ms 45820 KB Output is correct
70 Correct 803 ms 42488 KB Output is correct
71 Correct 918 ms 44672 KB Output is correct
72 Correct 1236 ms 44644 KB Output is correct
73 Correct 1147 ms 45156 KB Output is correct
74 Correct 1234 ms 44828 KB Output is correct
75 Correct 783 ms 42352 KB Output is correct
76 Correct 800 ms 43432 KB Output is correct
77 Correct 1033 ms 44784 KB Output is correct
78 Correct 946 ms 43988 KB Output is correct
79 Correct 1163 ms 44472 KB Output is correct
80 Correct 1463 ms 44980 KB Output is correct
81 Correct 814 ms 42596 KB Output is correct
82 Correct 794 ms 42364 KB Output is correct
83 Correct 997 ms 42640 KB Output is correct
84 Correct 698 ms 27388 KB Output is correct