제출 #1179153

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

tickets

#include "tickets.h"
#include <vector>
#include<iostream>
#include<algorithm>
#include<utility>
using namespace std;
typedef long long ll;

long long find_maximum(int k, std::vector<std::vector<int>> xx) {
	int n = (int)xx.size();
	int m = (int)xx[0].size();
	vector<vector<ll>> vec(n, vector<ll>(m));
	vector<vector<int>> ans(n, vector<int>(m, -1));
	for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) vec[i][j] = xx[i][j];
	if(m == 1){
		vector<ll> srtd;
		for(int i = 0; i < n; i++) ans[i][0] = 0, srtd.push_back(vec[i][0]);
		sort(srtd.begin(), srtd.end());
		ll sum = 0;
		for(int i = 0; i < n / 2; i++) sum += srtd[n - 1 - i] - srtd[i];
		allocate_tickets(ans);
		return sum;
	}
	return 1;
}
// g++ -std=c++17 -Wall -Wextra -Wshadow -fsanitize=undefined -fsanitize=address -o run -g grader.cpp tickets.cpp

• 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