Submission #300782

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
300782	2020-09-17 13:28:27	haojiandan	Carnival Tickets (IOI20_tickets)	C++14	100 / 100	1238 ms	63280 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;
priority_queue<pair<ll,int> > q;
ll sum;
int pos[1510],tot,st[1510][1510],R[1510],L[1510];
pair<int,int> d[1510];
int vis[1510];
ll find_maximum(int k, vector<vector<int> > x) {
  int n = x.size();
  int m = x[0].size();
  vector<vector<int> > ans;
  for (int i = 0; i < n; i++) {
    vector<int> row(m);
    for (int j = 0; j < m; j++) row[j]=-1;
    ans.push_back(row);
  }
  for (int i=0;i<n;i++) {
    for (int j=0;j<k;j++) st[i][j]=-1;
    q.push(make_pair(x[i][k-1]+x[i][m-1],i));
    pos[i]=1;
  }
  for (int I=1;I<=n*k/2;I++) {
    int i=q.top().second; q.pop();
    st[i][k-pos[i]]++,st[i][m-pos[i]]++;
    pos[i]++;
    if (k-pos[i]>=0) {
      q.push(make_pair(x[i][k-pos[i]]+x[i][m-pos[i]],i));
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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