Submission #301649

#TimeUsernameProblemLanguageResultExecution timeMemory
301649llakiCarnival Tickets (IOI20_tickets)Java
0 / 100
83 ms10232 KiB
import java.util.Arrays; public class tickets { long find_maximum(int k, int[][] x) { int n = x.length; int m = x[0].length; int[][] answer = new int[n][m]; //Arrays.sort(x, (i, j) -> i[0] + i[m - 1] - j[0] - j[m - 1]); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { answer[i][j] = 1; } } grader.allocate_tickets(answer); return 1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...