Submission #302697

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
302697	2020-09-19 04:21:53	leejseo	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	1434 ms	95408 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;
typedef long long ll;
int N, M, K;
vector<vector<int>> ans;
vector<pair<int, int>> A[1505], B[1505];
bool vis[1505];
int cmp(const vector<pair<int, int>> &x, const vector<pair<int, int>> &y){
  return x.size() > y.size();
}
priority_queue<pair<int, int>> pq;
ll find_maximum(int k, vector<vector<int>> x) {
  N = x.size(); M= x[0].size(); K = k;
  for (int i = 0; i < N; i++) {
    vector<int> row(M);
    ans.push_back(row);
  }
  priority_queue<pair<int, pair<int, int>>> pq;
  ll res = 0;
  for (int i=0; i<N; i++) for (int j=0; j<M; j++) ans[i][j] = -1;
  for (int k=0; k<K; k++){
    for (int i=0; i<N; i++){
      res -= x[i][k];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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