제출 #300286

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300286		easrui	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	1 ms	384 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define va first
#define vb second
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> ppi;
typedef pair<int,pii> pip;

const int MN = 1505;
const int MOD = 1e9+7;
const int INF = 1e9;

vector<int> T[MN];

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> ans;
	for(int i=0; i<n; i++){
		vector<int> row(m);
		for(int j=0; j<m; j++){
			row[j] = j;
			T[j].push_back(x[i][j]);
		}
		ans.push_back(row);
	}

	ll sum = 0;
	for(int i=0; i<m; i++){
		for(int j:T[i]) sum += abs(T[i][n/2]-j);
	}

	allocate_tickets(ans);
	return sum;
}

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