제출 #578219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
578219		Vanilla	카니발 티켓 (IOI20_tickets)	C++17	11 / 100	1 ms	596 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
 
struct el {
	long long x, y, idx;
 
	bool operator < (const el &oth) const {
		return make_pair(x, y) < make_pair(oth.x, oth.y);
	}
};
 
// bool comp (pair <long, long> a, pair <long, long> b) {
// 	if (a.first != b.first) return a.first < 
// }
 
long long find_maximum(int k, vector<vector<int>> x) {
	long long n = x.size();
	long long m = x[0].size();
	if (m == 1){ // subtask 1
		vector<vector<int>> answer (n, vector <int> (m));
		long long rs = 0;
		vector <int> v;
		for (int i = 0; i < n; i++){
			v.push_back(x[i][0]);
		}
		sort(v.begin(), v.end());
		for (int i = 0; i < n; i++){
			rs+=abs(x[i][0] - v[n / 2]);
		}
		allocate_tickets(answer);
		return rs;
	}
	else if (k == 1) { // subtask 2
		vector<vector<int>> answer (n, vector <int> (m, -1));
		long long rs = 0;
		vector <el > v;
		for (int i = 0; i < n; i++){
			v.push_back({x[i][0], x[i][m-1], i});
		}
		sort(v.begin(), v.end());
		for (int i = 0; i < n; i++){
			if (i < n / 2) {
				rs-=v[i].x;
				answer[v[i].idx][0] = 0;
			}
			else {
				rs+=v[i].y;
				answer[v[i].idx][m-1] = 0;
			}
		}
		allocate_tickets(answer);
		return rs;
	}
	else { // subtask 3
		
	}
	return -1;
}

• 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