제출 #791981

#제출 시각아이디문제언어결과실행 시간메모리
791981mousebeaver카니발 티켓 (IOI20_tickets)C++14
0 / 100
1 ms212 KiB
#define ll long long #include "tickets.h" #include <bits/stdc++.h> using namespace std; long long find_maximum(int k, vector<vector<int>> x) { ll n = x.size(); ll m = x[0].size(); if(m == 1) { vector<vector<int>> output(n, vector<int> (1, 0)); allocate_tickets(output); sort(x[0].begin(), x[0].end()); ll ans = 0; ll add = 0; for(ll i = n/2; i >= 0; i--) { add += x[0][n/2] - x[0][i]; ans += add; } add = 0; for(ll i = n/2+1; i < n; i++) { add += x[0][i] - x[0][n/2]; ans += add; } return ans; } return 0; }
#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...