Submission #554898

#	Time	Username	Problem	Language	Result	Execution time	Memory
554898		Ronin13	Carnival Tickets (IOI20_tickets)	C++14	27 / 100	510 ms	51500 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;



long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
    ll cursum = 0;
    set <pll> st;
    ll curl[n], curr[n];
    for(int i = 0; i < n; i++){
        curr[i] = m - k;
        curl[i] = 0;
        st.insert({(ll)x[i][m - k] + (ll)x[i][0], i});
    }
    // ll cursum = 0;
    for(int i = 0; i < n; i++){
        for(int j = m - k; j < m; j++)cursum += (ll)x[i][j];
    }
    int raod = n * k / 2;
    while(raod--){
        pll now = *st.begin();
        st.erase(st.begin());
        cursum -= now.f;
        int ind = now.s;
        curl[ind]++;
        curr[ind]++;
        int ind1 = curl[ind], ind2 = curr[ind];
        if(ind2 < m)
        st.insert({x[ind][ind1] + x[ind][ind2], ind});
    }
    //cout << 1;
    vector <vector<int> > al;
    al.resize(n);
    for(int i = 0; i < n; i++){
        al[i].resize(m);
        for(int j = 0; j < m; j++) al[i][j] = -1;
    }
    int curl1[n], curr1[n];
    for(int i = 0; i < n; i++){
        curl1[i] = 0;
        curr1[i] = m - 1;
    }
    for(int i = 0; i < k; i++){
        int used[n];
        for(int j = 0; j < n; j++)used[j] = 0;
        int cnt = 0;
        for(int j = 0; j < n; j++){
            if(cnt == n / 2) break;
            if(curl1[j] < curl[j]){
                al[j][curl1[j]] = i;
                used[j] = 1;
                cnt++;
                curl1[j]++;
            }
        }
        for(int j = 0; j < n; j++){
            if(!used[j]){
                al[j][curr1[j]] = i;
                curr1[j]--;
            }
        }
    }
    allocate_tickets(al);
	return cursum;
}

• 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