Submission #302615

#	Time	Username	Problem	Language	Result	Execution time	Memory
302615		ASD3D	카니발 티켓 (IOI20_tickets)	Java	0 / 100	90 ms	10616 KiB

tickets

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++) {
      answer[i][0] = 0;
  }
  
  /***
  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++) {
      if (i >= n/2) {
          ans += x[i][0];
      }
      else {
          ans -= x[i][0];
      }
  }
  grader.allocate_tickets(answer);
  return ans;
 }
 /***
 public static void main(String[] args){
     int[][] s = new int[4][1];
     for (int i = 0; i < 4; i++) {
         s[i][0] = i;
     }
     System.out.println(find_maximum(1, s));
 }
 ***/
}

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