Submission #318133

#	Time	Username	Problem	Language	Result	Execution time	Memory
318133		nickmet2004	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	492 KiB

tickets

#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;
int cnt[1505];
int n , m ,k;
vector<vector<int>>a;

long long find_maximum(int k , vector<vector<int>> a){
    int n = a.size() , m = a[0].size();
    /// nk/2 maximums - nk/2 minimums
    priority_queue<pair<int , int>> pq;
    long long ans = 0;
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < k; ++j) ans += a[i][m - k + j];
        pq.emplace(-a[i][0] - a[i][m - k] , i);
    }
    for(int i = 0; i < n * k / 2; ++i){
        auto x = pq.top(); pq.pop();
        if(cnt[i] >= k)continue;
        cnt[x.second]++; ans += x.first;
        if(cnt[i] < k) pq.emplace(-a[i][cnt[i]] - a[i][m - k + cnt[i]] , i);
    }
    vector<vector<int>> r(n , vector<int>(m , -1));
    for(int i = 0; i < n; ++i){
        int x = 0;
        for(int j = 0; j < cnt[i]; ++j) r[i][j] = x , x = (x + 1) %k;
        for(int j = m - k + cnt[i]; j < m; ++j)r[i][j] = x , x =(x +1)%k;
    }
    allocate_tickets(r);
    return ans;
}

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