oj.uz

Submission #302611

# Submission time Handle Problem Language Result Execution time Memory
302611 2020-09-18T21:53:53 Z ASD3D Carnival Tickets (IOI20_tickets) Java 11
0 / 100
 79 ms 10360 KB 
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++) {
      ans += x[i][0];
  }
  ans -= n * x[n/2][0];
  grader.allocate_tickets(answer);
  return ans;
 }

}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 76 ms 10232 KB Contestant returned 298620960 but the tickets gives a total value of -298620960
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 10232 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 78 ms 10320 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 76 ms 10360 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 79 ms 10116 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 79 ms 10116 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 76 ms 10232 KB Contestant returned 298620960 but the tickets gives a total value of -298620960
2 Halted 0 ms 0 KB -