제출 #314929

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
314929		giorgikob	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	1 ms	308 KiB

tickets

#include "tickets.h"
#include <vector>

#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_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();

    vector<vector<int>> answer(n, vector<int>(m,-1));
    vector<int>cur(n,0);
    ll res = 0;
    set<pair<ll,int>>s;

    for(int i = 0; i < n; i++){
        // m = 7 k = 2 5 6
        for(int j = m-k; j < m; j++){
            res += x[i][j];
        }
        s.insert({x[i][0]+x[i][m-k],i});
    }

    for(int c = 0; c < k*n/2; c++){
        auto p = *s.begin();
        int val = p.ff;
        int i = p.ss;
        res -= val;
        //cout << val << " " << i << endl;
        s.erase(*s.begin());
        cur[i]++;
        int a = cur[i];
        if(a < k)s.insert(make_pair(x[i][a]+x[i][m-k+a],i));
        //a = 1 m = 4 k = 2 1 -1 -1 1
        //x[i][1] + x[i][4-2+1]
    }

    for(int i = 0; i < n; i++){
        int cnt = 0;
        //cur = 5 m = 12 k = 8 0 1 2 3 4 ... 9 10 11 12
        for(int j = 0; j < cur[i]-1; j++){
            answer[i][j] = cnt;
            cnt++;
        }
        for(int j = m - (k - cur[i]); j < m; j++){
            answer[i][j] = cnt;
            cnt++;
        }
    }

    allocate_tickets(answer);
    return res;
}

• 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