# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336163 | KWang31 | Fun Tour (APIO20_fun) | Java | 908 ms | 40556 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
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
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |