제출 #576143

#제출 시각아이디문제언어결과실행 시간메모리
576143SlavicG카니발 티켓 (IOI20_tickets)C++17
11 / 100
1 ms724 KiB
#include "bits/stdc++.h" #include "tickets.h" using namespace std; #define ll long long #define sz(a) (int)a.size() #define pb push_back #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define forn(i, n) for(int i=0;i < n; ++i) long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(); int m = x[0].size(); std::vector<std::vector<int>> answer(n, vector<int>(m, -1)); if(m == 1) { answer.assign(n, vector<int>(m, 0)); vector<ll> a; forn(i, n) a.pb(x[i][0]); sort(all(a)); ll ans = 0; forn(i, n) ans += abs(a[i] - a[n / 2]); allocate_tickets(answer); return ans; } return 1; }
#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...