Submission #886387

#	Time	Username	Problem	Language	Result	Execution time	Memory
886387		NeroZein	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	400 ms	51476 KiB

tickets

#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; 
  priority_queue<pair<long long, int>> pq;  
  vector<vector<int>> answer(n, vector<int> (m, -1));
  for (int i = 0; i < n; ++i) {
    for (int j = m - 1; j >= m - k; --j) {
      ret += x[i][j]; 
      answer[i][j] = m - j - 1;
    }
    pq.emplace(-x[i][0] - x[i][m - k], i);
  }
  int cnt = 0; 
  vector<int> t(n); 
  while (cnt < n * k / 2) {
    auto [val, ind] = pq.top();
    pq.pop();
    cnt++;
    ret += val;
    swap(answer[ind][t[ind]], answer[ind][m - k + t[ind]]);
    t[ind]++; 
    if (m - k + t[ind] < m) {
      pq.emplace(-x[ind][t[ind]] - x[ind][m - k + t[ind]], ind);       
    }
  }
  allocate_tickets(answer);
  return ret;
}

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