제출 #1030372

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1030372		happy_node	카니발 티켓 (IOI20_tickets)	C++17	25 / 100	614 ms	71036 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MX=1505, of=1505;

ll dp[MX][2*MX], par[MX][2*MX];

int cur[MX], used[MX];

long long find_maximum(int K, std::vector<std::vector<int>> d) {
        int N=d.size();
        int M=d[0].size();      

        vector<array<int,3>> vals;

        for(int i=0;i<N;i++) {
                for(int j=0;j<M;j++) {
                        vals.push_back({d[i][j],i,j});
                }
        }

        sort(vals.begin(),vals.end());

        ll ans=0;
        int bal=N*K/2;
        for(int i=0;i<N*M && bal>0;i++) {
                if(used[vals[i][1]]>=K) continue;
                ans-=vals[i][0];
                cur[vals[i][1]]++;
                used[vals[i][1]]++;
                bal--;
        }
        bal=N*K/2;
        for(int i=N*M-1;i>=0 && bal>0;i--) {
                if(used[vals[i][1]]>=K) continue;
                ans+=vals[i][0];
                used[vals[i][1]]++;
                bal--;
        }

        vector<pair<int,int>> v;

        for(int i=0;i<N;i++) 
                v.push_back({cur[i]-1,i});

        // for each k, we try to find N/2 nodes with largest cur_i and set it to fill in the negatives, and other N/2 o fill in the positives
        
        vector<int> fr(N), bk(N,M-1);
        vector<vector<int>> s(N,vector<int>(M,-1));

        for(int x=0;x<K;x++) {
                sort(v.rbegin(),v.rend());
                for(int j=0;j<N/2;j++) {
                        auto &[y,i]=v[j];
                        s[i][fr[i]]=x;
                        fr[i]++;
                        y--;
                }
                for(int j=N/2;j<N;j++) {
                        auto &[y,i]=v[j];
                        s[i][bk[i]]=x;
                        bk[i]--;
                }
        }

        allocate_tickets(s);

        return ans;
}

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