| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 301707 | ijxjdjd | Carnival Tickets (IOI20_tickets) | Java | 0 ms | 0 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.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
public class tickets {
long find_maximum(int K, int[][] x) {
int N = x.length;
int M = x[0].length;
int[][] S = new int[N*K][2];
for (int i = 0; i < N; i++) {
for (int j = 0; j < K; j++) {
S[i*K + j][0] = i;
S[i*K + j][1] = j;
}
}
Arrays.sort(S, new Comparator<int[]>() {
@Override
public int compare(int[] ints, int[] t1) {
return -Integer.compare(-x[ints[0]][ints[1]] - x[ints[0]][M - K + ints[1]], -x[t1[0]][t1[1]] - x[t1[0]][M-K+t1[1]]);
}
});
long res = 0;
int[] count = new int[N];
for (int i = 0; i < S.length/2; i++) {
count[S[i][0]]++;
}
int[][] ans = new int[N][M];
int k = 0;
for (int id = 0; id < N; id++) {
int bef = k;
if (count[id] == 0) {
for (int c = 1; c <= K; c++) {
ans[id][M-c] = k;
res += x[id][M - c];
k++;
if (k == K) {
k = 0;
}
}
}
else {
for (int a = 0 ; a < count[id]; a++) {
ans[id][a] = k;
res -= x[id][a];
k++;
if (k == K) {
k = 0;
}
}
int c = 1;
for (int i = k; i != bef; ) {
res += x[id][M - c];
ans[id][M-c] = i;
c++;
i++;
if (i == K) {
i = 0;
}
}
}
}
for (int j = 0; j < N; j++) {
Arrays.fill(ans[j], -1);
}
for (int j = 0; j < K; j++) {
for (int[] s : rounds[j]) {
ans[s[0]][s[1]] = j;
}
}
grader.allocate_tickets(ans);
return res;
}
}