Submission #581392

#TimeUsernameProblemLanguageResultExecution timeMemory
581392MohamedFaresNebiliCarnival Tickets (IOI20_tickets)C++14
11 / 100
1 ms724 KiB
#include <bits/stdc++.h> #include "tickets.h" #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; using ll = long long; using pi = pair<ll, pair<ll, ll>>; using ii = pair<int, int>; #define pb push_back #define pp pop_back #define ff first #define ss second typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; ll find_maximum(int K, vector<vector<int>> A) { int N = A.size(), M = A[0].size(); ll res = 0; vector<vector<int>> S(N, vector<int> (M, -1)); vector<pi> curr; vector<ll> arr; for(int l = 0; l < N; l++) for(int i = 0; i < M; i++) curr.pb({A[l][i], {l, i}}); sort(curr.begin(), curr.end()); bool vis[N]; memset(vis, 0, sizeof vis); ll lo = 0, hi = 0, i = 0, l = (int)curr.size() - 1; for(; i < N / 2 && l >= 0; l--) { if(vis[curr[l].ss.ff]) continue; i++; arr.pb(curr[l].ff); S[curr[l].ss.ff][curr[l].ss.ss] = 0; vis[curr[l].ss.ff] = 1; } for(int l = 0; l < (int)curr.size(); l++) { if(vis[curr[l].ss.ff]) continue; arr.pb(curr[l].ff); S[curr[l].ss.ff][curr[l].ss.ss] = 0; vis[curr[l].ss.ff] = 1; } sort(arr.begin(), arr.end()); for(auto U : arr) res += abs(U - arr[N / 2]); allocate_tickets(S); return res; }

Compilation message (stderr)

tickets.cpp: In function 'll find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:31:16: warning: unused variable 'lo' [-Wunused-variable]
   31 |             ll lo = 0, hi = 0, i = 0, l = (int)curr.size() - 1;
      |                ^~
tickets.cpp:31:24: warning: unused variable 'hi' [-Wunused-variable]
   31 |             ll lo = 0, hi = 0, i = 0, l = (int)curr.size() - 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...