Submission #302609

#TimeUsernameProblemLanguageResultExecution timeMemory
302609ASD3D카니발 티켓 (IOI20_tickets)Java
0 / 100
81 ms10344 KiB
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];
  /***
  for (int i = 0; i < n; i++) {
   for (int j = 0; j < m; j++) {
    if (j < k) {
     answer[i][j] = j;
    } else {
     answer[i][j] = -1;
    }
   }
  }
  ***/
  long ans = 0;
  for (int i = 0; i < n; i++) {
      ans += x[i][0];
  }
  ans -= n * x[n/2][0];
  grader.allocate_tickets(answer);
  return ans;
 }

}

#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...