Submission #301680

#	Time	Username	Problem	Language	Result	Execution time	Memory
301680		llaki	Carnival Tickets (IOI20_tickets)	Java	27 / 100	868 ms	79628 KiB

tickets

import java.util.Arrays;

public class tickets {
    private class TicketsWithColors {
        int color;
        int[] val;

        TicketsWithColors(int color, int[] val) {
            this.color = color;
            this.val = val;
        }
    }

    long find_maximum(int k, int[][] x) {
        int n = x.length;
        int m = x[0].length;
        int[][] answer = new int[n][m];
        TicketsWithColors[] t = new TicketsWithColors[n];
        for (int i = 0; i < n; i++) {
            t[i] = new TicketsWithColors(i, x[i]);
        }
        Arrays.sort(t, (t1, t2) -> t1.val[0] + t1.val[m - 1] - t2.val[0] - t2.val[m - 1]);
        long ans = 0;
        for (int i = 0; i < n; i++) Arrays.fill(answer[i], -1);
        for (int i = 0; i < n; i++) {
            int col = t[i].color;
            if (i < n / 2) {
                answer[col][0] = 0;
                ans -= t[i].val[0];
            } else {
                answer[col][m - 1] = 0;
                ans += t[i].val[m - 1];
            }
        }
        grader.allocate_tickets(answer);
        return ans;
    }


}

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10