제출 #955060

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
955060		Trisanu_Das	카니발 티켓 (IOI20_tickets)	C++17	100 / 100	699 ms	84420 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
const int N=1505;
 
int n, m, d[N], s[N];
long long sum;
vector<pair<int, int> > v, l;
long long find_maximum(int k, vector<vector<int> > x){
	n = x.size(); m = x[0].size();
	vector<vector<int> > ans(n, vector<int>(m, -1));
	for(int i = 0; i < n; i++){
		for(int j = 0; j < k; j++) {
          sum += x[i][m - 1 - j]; 
          v.push_back(make_pair(x[i][j] + x[i][m - k + j], i));
        }
    }
	sort(v.begin(), v.end());
	for(int i = 0; i < n * k / 2; i++) {
      sum -= v[i].first;
      d[v[i].second]++;
    }
	for(int i = 0; i < n; i++){
		l.clear();
		for(int j = 0; j < k; j++) l.push_back(make_pair(s[j], j));
		sort(l.begin(), l.end());
		for(int j = 0; j < k; j++){
			if(j < d[i]) {
              ans[i][j] = l[j].second; 
              s[l[j].second]++;
            } else ans[i][m - k + j] = l[j].second;
        }
	}
	allocate_tickets(ans); 
    return sum;
}

• 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