Submission #721301

#TimeUsernameProblemLanguageResultExecution timeMemory
721301nihaddhuseynliCarnival Tickets (IOI20_tickets)C++14
0 / 100
1 ms596 KiB
#include "tickets.h" #include <vector> #include <bits/stdc++.h> using namespace std; typedef long long int ll; ll n1,m1,a[1505][1505]; 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; for (int i = 0; i < n; i++) { std::vector<int> row(m); for (int j = 0; j < m; j++) { if (j < k) { row[j] = j; } else { row[j] = -1; } } answer.push_back(row); } allocate_tickets(answer); ll ans=0,maxx=0; for(int i =0;i<n;i++) { for(int j =0;j<m;j++) { a[i][j]=x[i][j]; maxx=max(maxx,(ll)x[i][j]); } } ans=INT_MAX; for(int i =0;i<n;i++) { maxx=0; for(int j =0;j<n;j++) { maxx+=abs(x[i][0]-x[j][0]); } ans=min(ans,maxx); } 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...