제출 #300604

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300604		muhammad_hokimiyon	카니발 티켓 (IOI20_tickets)	C++14	27 / 100	755 ms	52728 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>

#define fi first
#define se second
#define ll long long

using namespace std;

long long find_maximum(int k, vector<vector<int>> X) {
	int n = X.size();
	int m = X[0].size();
	ll res1 = 0;
	vector < int > ls( n , m - 1 ) , st( n , 0 );
    vector < vector < int > > ans( n , vector < int > (m , -1) );
    for( int it = 0; it < k; it++ ){
        vector < pair < ll , int > > res;
        ll cnt = 0;
        for( int i = 0; i < n; i++ ){
            res.push_back({ -X[i][st[i]] - X[i][ls[i]] , i });
            cnt += X[i][ls[i]];
        }
        sort( res.rbegin() , res.rend() );
        for( int i = 0; i < n / 2; i++ ){
            ans[res[i].se][st[res[i].se]++] = it;
            cnt += res[i].fi;
        }
        for( int i = n / 2; i < n; i++ ){
            ans[res[i].se][ls[res[i].se]--] = it;
        }
        res1 += cnt;
    }
    allocate_tickets( ans );
    return res1;
}

• 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