제출 #1228333

#제출 시각아이디문제언어결과실행 시간메모리
1228333LudisseyCarnival Tickets (IOI20_tickets)C++20
0 / 100
0 ms328 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; #define int long long #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() int n; long long find_maximum(signed k, std::vector<std::vector<signed>> x) { n=sz(x); vector<signed> a; for (int i = 0; i < n; i++) a.push_back(x[i][0]); sort(all(a)); int med=a[(n-1)/2]; int ans=0; for (int i = 0; i < n; i++) ans+=abs(a[i]-med); vector<vector<signed>> ret(n,vector<signed>(1,1)); allocate_tickets(ret); 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...