Submission #635138

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
635138	2022-08-25 13:58:31	stevancv	Carnival Tickets (IOI20_tickets)	C++14	100 / 100	637 ms	54340 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 <bits/stdc++.h>
#include "tickets.h"
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 5e5 + 2;
const int mod = 1e9 + 7;
ll find_maximum(int k, vector<vector<int>> a) {
    int n = a.size(); int m = a[0].size();
    vector<int> l(n, k - 1), r(n, m - 1);
    priority_queue<array<int, 2>> pq;
    for (int i = 0; i < n; i++) pq.push({a[i][l[i]] + a[i][r[i]], i});
    int uk = n * k / 2;
    while (uk--) {
        int i = pq.top()[1]; pq.pop();
        l[i]--; r[i]--;
        if (l[i] >= 0) pq.push({a[i][l[i]] + a[i][r[i]], i});
    }
    vector<int> kol(n);
    ll sol = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= l[i]; j++) sol -= a[i][j];
        for (int j = r[i] + 1; j < m; j++) sol += a[i][j];
        kol[i] = k - l[i] - 1;
        l[i] = 0; r[i] = m - 1;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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