Submission #471253

#TimeUsernameProblemLanguageResultExecution timeMemory
471253Cross_RatioCarnival Tickets (IOI20_tickets)C++14
0 / 100
1 ms244 KiB
#include <bits/stdc++.h> #include "tickets.h" using namespace std; //void allocate_tickets(vector<vector<int>>); long long find_maximum(int k, vector<vector<int> > x) { int N = x.size(); int M = x[0].size(); vector<vector<int> > ans; ans.resize(N); int i; for(i=0;i<N;i++) ans[i].resize(M); for(i=0;i<N;i++) ans[i][0] = 1; long long int cnt = 0; vector<int> V; for(i=0;i<N;i++) V.push_back(x[i][0]); sort(V.begin(),V.end()); for(i=0;i<N;i++) { if(i<N/2) cnt -= V[i]; else cnt += V[i]; } allocate_tickets(ans); return cnt; }
#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...