제출 #921259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
921259		ksujay2	카니발 티켓 (IOI20_tickets)	C++17	100 / 100	531 ms	93848 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
using ll = long long;
 
ll find_maximum(int k, vector<vector<int>> x) {
    int n = x.size(), m = x[0].size();
    vector<vector<ll>> delta(n, vector<ll>(k));
    ll sm = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < k; j++) {
            sm -= x[i][j];
        }
        for(int j = 0; j < k; j++) {
            delta[i][j] = x[i][m - j - 1] + x[i][k - j - 1];
        }
    }
    vector<int> pos(n), neg(n, k);
    priority_queue<pair<ll, int>> pq;
    for(int i = 0; i < n; i++) {
        pq.push({delta[i][pos[i]], i});
    }
    for(int i = 0; i < n / 2 * k; i++) {
        sm += pq.top().first;
        int j = pq.top().second;
        pq.pop();
        pos[j]++;
        neg[j]--;
        if(pos[j] < k) pq.push({delta[j][pos[j]], j});
    }
    vector<vector<int>> s(n, vector<int>(m, -1));
    for(int i = 0; i < k; i++) {
        int negcnt = 0;
        vector<bool> used(n);
        for(int j = 0; j < n; j++) {
            if(pos[j] == 0) {
                used[j] = true;
                neg[j]--;
                s[j][neg[j]] = i;
                negcnt++;
            }
        }
        for(int j = 0; j < n; j++) {
            if(used[j]) continue;
            if(negcnt < n / 2 && neg[j] > 0) {
                neg[j]--;
                s[j][neg[j]] = i;
                negcnt++;
            } else {
                s[j][m - pos[j]] = i;
                pos[j]--;
            }
        }
    }
  	allocate_tickets(s);
    return sm;
}

• 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