제출 #1078620

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1078620	2024-08-28 00:34:14	juicy	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	359 ms	73260 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;
long long find_maximum(int k, vector<vector<int>> x) {
  int n = x.size(), m = x[0].size();
  vector<int> ord(n), lt(n), rt(n, m - 1);
  iota(ord.begin(), ord.end(), 0);
  vector a(n, vector<int>(m, -1));
  long long res = 0;
  for (int t = 0; t < k; ++t) {
    sort(ord.begin(), ord.end(), [&](int u, int v) {
      return x[u][lt[u]] + x[u][rt[u]] < x[v][lt[v]] + x[v][rt[v]];
    });
    for (int i = 0; i < n / 2; ++i) {
      int u = ord[i];
      res -= x[u][lt[u]];
      a[u][lt[u]++] = t;
    }
    for (int i = n / 2; i < n; ++i) {
      int u = ord[i];
      res += x[u][rt[u]];
      a[u][rt[u]--] = t;
    }
  }
  allocate_tickets(a);
  return res;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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