제출 #578753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
578753		2fat2code	Carnival Tickets (IOI20_tickets)	C++17	11 / 100	2 ms	724 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(s) s.begin(), s.end()
 
using namespace std;
 
const int nmax = 1505;
 
int n, m, r[nmax];
long long ans;
 
long long find_maximum(int k, vector<vector<int>> x) {
	n = x.size();
	m = x[0].size();
	vector<pair<int,pair<int,int>>>arr;
	vector<vector<int>>lol(n, vector<int>(m));
	for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            arr.push_back({x[i][j], {i, j}});
        }
	}
	sort(all(arr));
	for(int i=0;i<(n*m/2);i++){
        ans -= (long long)arr[i].fr;
        lol[arr[i].sc.fr][arr[i].sc.sc] = r[arr[i].sc.fr]++;
	}
	for(int i=(n*m/2);i<n*m;i++){
        ans += (long long)arr[i].fr;
        lol[arr[i].sc.fr][arr[i].sc.sc] = r[arr[i].sc.fr]++;
	}
	allocate_tickets(lol);
	return ans;
}

• Subtask 1: 11 / 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