제출 #1084454

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1084454	2024-09-06 09:17:42	vjudge1	카니발 티켓 (IOI20_tickets)	C++17	100 / 100	561 ms	100756 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 int long long
using namespace std;
/*void allocate_tickets(vector<vector<int32_t>> s)
{
    int n = s.size(), m = s[0].size();
    for(int i = 0; i < n; i++){
        //for(int j = 0; j < m; j++) cout<<s[i][j]<<" ";
        //cout<<'\n';
    }
}*/
int find_maximum(int32_t k, vector<vector<int32_t>> a)
{
    //Should be ok for k = m
    vector<pair<int, int>> reduce_option;
    int n = a.size(), m = a[0].size(), ans = 0;
    for(int i = 0; i < n; i++){
        for(int j = m-1; j >= m-k; j--) ans += a[i][j];
        for(int j = 0; j < k; j++) reduce_option.push_back(make_pair(a[i][j] + a[i][j+(m-k)], i));
    }
    vector<int> reduce(n), add(n);
    sort(reduce_option.begin(), reduce_option.end());
    for(int i = 0; i < n*k/2; i++){
        ans -= reduce_option[i].first;
        //cout<<"A"<<reduce_option[i].first<<endl;
        reduce[reduce_option[i].second]++;
    }
    for(int i = 0; i < n; i++) add[i] = k-reduce[i];
    vector<vector<int32_t>> s(n);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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