제출 #983971

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
983971	2024-05-16 08:41:13	phoenix0423	카니발 티켓 (IOI20_tickets)	C++17	100 / 100	1062 ms	76432 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>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define pb push_back
#define eb emplace_back
#include "tickets.h"
const int maxn = 1505;
const ll INF = 1e18;
// ll dp[maxn][maxn];
long long find_maximum(int k, std::vector<std::vector<int>> x) {
  int n = x.size();
  int m = x[0].size();
  vector<vector<int>> ans(n, vector<int>(m, -1));
  ll cost = 0;
  multiset<pll> stl, str; // l : l -> r, r : r -> l
  vector<int> l(n), r(n);
  auto rid = [&](int i) -> void {
    if(l[i]) stl.erase({x[i][r[i]] + x[i][l[i] - 1], i});
    if(r[i] < m - 1) str.erase({x[i][r[i] + 1] + x[i][l[i]], i});
  };
  auto put = [&](int i) -> void {
    if(l[i]) stl.insert({x[i][r[i]] + x[i][l[i] - 1], i});
    if(r[i] < m - 1) str.insert({x[i][r[i] + 1] + x[i][l[i]], i});
  };
  for(int i = 0; i < n; i++){
    if(i < n / 2) l[i] = k, r[i] = m - 1;
    else l[i] = 0, r[i] = m - 1 - k;
    for(int j = 0; j < l[i]; j++) cost -= x[i][j];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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