제출 #1330533

#제출 시각아이디문제언어결과실행 시간메모리
1330533SpyrosAlivCarnival Tickets (IOI20_tickets)C++20
0 / 100
1 ms344 KiB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> cons(n, vector<int>(m, 0));
	ll ans = 0;
	for (int i = 0; i < n; i++) {
		ll curr = 0;
		for (int j = 0; j < n; j++) {
			curr += abs(x[i][0] - x[j][0]);
		}
		ans = max(ans, curr);
	}
	allocate_tickets(cons);
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...