Submission #300169

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
300169	2020-09-16 22:07:21	model_code	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	1557 ms	107564 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
// wy-full
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
int sum[1505], f[1505], b[1505];
vector< vector<int> > ret;
bool cmp(pair<long long, pair<int, int> > a, pair<long long, pair<int, int> > b) {
  if (a.first != b.first) return a.first > b.first;
  else return a.second < b.second;
}
long long find_maximum(int k, std::vector<std::vector<int>> d) {
  int c = d.size();
  int s = d[0].size();
  vector< pair<long long, pair<int, int> > > V;
  long long ans = 0;
  vector<vector<pair<int, int>>> d2;
  d2.resize(c);
  for (int i = 0; i < c; i++) {
    for (int j = 0; j < s; j++) {
      d2[i].push_back(make_pair(d[i][j], j));
    }
  }
  for (int i = 0; i < c; i++) {
    sort(d2[i].begin(), d2[i].end());
    for (int j = 0; j < k; j++) V.push_back(make_pair((long long)d2[i][s-j-1].first + d2[i][k-j-1].first, make_pair(i, j)));
    for (int j = 0; j < k; j++) ans -= d2[i][j].first;
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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