Submission #1082165

#TimeUsernameProblemLanguageResultExecution timeMemory
1082165woodCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms348 KiB
#include "tickets.h" #include <vector> #include <bits/stdc++.h> using namespace std; #define vi vector<int> #define ll long long #define pb push_back long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(), m = x[0].size(); vector<vi> ans; for(int i = 0; i<n; i++) ans.pb({0}); int l = 0, r = 2e9; while (r-l>1){ int mid = (r+l)/2; ll dif = 0; for(int i = 0; i<n; i++) dif+=mid-x[i][0]; if(dif<0) l = mid; else r=mid; } ll ldif = 0, rdif = 0; for(int i = 0; i<n; i++) ldif+=abs(l-x[i][0]); for(int i = 0; i<n; i++) rdif+=abs(r-x[i][0]); allocate_tickets(ans); return min(ldif,rdif); }

Compilation message (stderr)

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:10:23: warning: unused variable 'm' [-Wunused-variable]
   10 |     int n = x.size(), m = x[0].size();
      |                       ^
#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...