oj.uz

Submission #886377

# Submission time Handle Problem Language Result Execution time Memory
886377 2023-12-12T01:51:45 Z NeroZein Carnival Tickets (IOI20_tickets) C++17
27 / 100
 395 ms 73208 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std; 

long long find_maximum(int k, vector<vector<int>> x) {
  int n = x.size();
  int m = x[0].size();
  long long ret = 0; 
  vector<int> p(n), s(n, m - 1); 
  for (int round = 0; round < k; ++round) {
    vector<pair<int, int>> vec; 
    for (int i = 0; i < n; ++i) {
      vec.emplace_back(x[i][p[i]] + x[i][s[i]], i);
    } 
    sort(vec.begin(), vec.end()); 
    for (int i = 0; i < n; ++i) {
      int id = vec[i].second;
      if (i < n / 2) {
        ret -= x[id][p[id]];
        p[id]++; 
      } else {
        ret += x[id][s[id]];
        s[id]--; 
      }
    }
  }
  vector<vector<int>> answer;
  for (int i = 0; i < n; i++) {
    vector<int> row(m, -1);
    for (int j = 0; j < m; j++) {
      if (j < p[i] || j > s[i]) {
        row[j] = 0;
      }
    }
    answer.push_back(row);
  }
  allocate_tickets(answer);
  return ret;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 856 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 16 ms 3164 KB Output is correct
6 Correct 395 ms 73208 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 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 0 ms 348 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 0 ms 604 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 0 ms 604 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 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 856 KB Output is correct
11 Correct 16 ms 3164 KB Output is correct
12 Correct 395 ms 73208 KB Output is correct
13 Incorrect 0 ms 344 KB There is multiple tickets of color 0 on day 0
14 Halted 0 ms 0 KB -