제출 #1153416

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1153416	2025-02-19 11:00:10	Sharky	카니발 티켓 (IOI20_tickets)	C++20	100 / 100	783 ms	104196 KiB

tickets

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll find_maximum(int k, std::vector<std::vector<int>> x) {
  int n = x.size();
  int m = x[0].size();
  vector<vector<bool>> use(n, vector<bool> (m, 0));
  vector<vector<int>> answer(n, vector<int> (m, -1));
  ll ans = 0;
  vector<stack<int>> st(n);
  vector<vector<pair<int, int>>> a(n);
  priority_queue<pair<int, pair<int, int>>> q;
  for (int i = 0; i < n; i++) {
    vector<pair<int, int>> srt;
    for (int j = 0; j < m; j++) srt.push_back({x[i][j], j});
    sort(srt.begin(), srt.end());
    for (int j = 0; j < k; j++) {
      st[i].push(srt[j].second);
      ans -= srt[j].first;
      use[i][srt[j].second] = 1;
    }
    a[i] = srt;
  }
  for (int i = 0; i < n; i++) {
    q.push({a[i].back().first + x[i][st[i].top()], {i, st[i].top()}});
  }
  int cnt = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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