제출 #300815

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300815		79brue	카니발 티켓 (IOI20_tickets)	C++14	100 / 100	1328 ms	135564 KiB

tickets

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

using namespace std;

typedef long long ll;

struct dat{
    int i, l, r; ll val;
    dat(){}
    dat(int i, int l, int r, ll val): i(i), l(l), r(r), val(val){}

    bool operator<(const dat &tr)const{
        if(val == tr.val) return l < tr.l;
        return val < tr.val;
    }
};

vector<vector<int> > ans;
ll ansV;
vector<dat> vec;

queue<int> small[1502], big[1502];
int only[1502]; /// 0: all, 1: only small, 2: only big

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size(), nh = n/2;
	int m = x[0].size();

	ans.resize(n);
	for(int i=0; i<n; i++) ans[i] = vector<int>(m, -1);

	for(int i=0; i<n; i++){
        for(int j=0; j<k; j++){
            ansV += x[i][m-k+j];
            vec.push_back(dat(i, j, m-k+j, x[i][j] + x[i][m-k+j]));
            big[i].push(m-k+j);
        }
	}
	sort(vec.begin(), vec.end());

	for(int i=0; i<nh*k; i++){
        dat tmp = vec[i];
        ansV -= tmp.val;

        assert(big[tmp.i].front() == tmp.r);
        big[tmp.i].pop();
        small[tmp.i].push(tmp.l);
	}

    for(int c=0; c<k; c++){
        for(int i=0; i<n; i++){
            if(big[i].empty()) only[i] = 1;
            else if(small[i].empty()) only[i] = 2;
            else only[i] = 0;
        }
        int smallCnt = 0, bigCnt = 0;
        for(int i=0; i<n; i++){
            if(!only[i]) continue;
            if(only[i] == 1){
                ans[i][small[i].front()] = c;
                small[i].pop(), smallCnt++;
            }
            else{
                ans[i][big[i].front()] = c;
                big[i].pop(), bigCnt++;
            }
        }
        for(int i=0; i<n; i++){
            if(only[i]) continue;
            if(smallCnt < nh){
                ans[i][small[i].front()] = c;
                small[i].pop(), smallCnt++;
            }
            else{
                ans[i][big[i].front()] = c;
                big[i].pop(), bigCnt++;
            }
        }
    }

    allocate_tickets(ans);
    return ansV;
}

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