Submission #415866

#TimeUsernameProblemLanguageResultExecution timeMemory
415866abdzagCarnival Tickets (IOI20_tickets)C++17
11 / 100
3 ms844 KiB
#include<bits/stdc++.h> #include "tickets.h" #define rep(i,a,b) for(int i=int(a);i<int(b);i++) #define rrep(i,a,b) for(int i=int(a);i>int(b);i--) #define trav(a,v) for(auto& a: v) #define sz(v) v.size() #define all(v) v.begin(),v.end() #define vi vector<int> typedef long long ll; typedef long double ld; typedef unsigned long long ull; const long long inf = 1e15; using namespace std; vector<bool> visited(1e6); vector<vector<ll>> g; vector<ll> v; ll curr = 0; bool done = 1; long long find_maximum(int k, std::vector<std::vector<int>> x) { vector<ll> v; rep(i,0, x.size())v.push_back(x[i][0]); sort(all(v)); ll b = v[v.size() / 2]; ll ans = 0; std::vector<std::vector<int>> answer(x.size()); rep(i, 0, x.size())answer[i].push_back(0); trav(a, v)ans += abs(a - b); allocate_tickets(answer); 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...