Submission #328887

#TimeUsernameProblemLanguageResultExecution timeMemory
328887blueCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms368 KiB
#include "tickets.h" #include <vector> #include <algorithm> using namespace std; vector< vector<int> > Z; struct ind { int i; }; bool operator < (ind A, ind B) { return Z[A.i].back() + Z[A.i].front() < Z[B.i].back() + Z[B.i].front(); } long long find_maximum(int k, vector< vector<int> > x) { int n = x.size(); int m = x[0].size(); Z = x; ind I[n]; for(int i = 0; i < n; i++) I[i] = ind{i}; sort(I, I+n); vector< vector<int> > s(n); long long res; for(int i = 0; i < n/2; i++) { s[I[i].i] = vector<int>(m, -1); s[I[i].i][0] = 0; res -= x[I[i].i][0]; } for(int i = n/2; i < n; i++) { s[I[i].i] = vector<int>(m, -1); s[I[i].i][m-1] = 0; res += x[I[i].i][m-1]; } allocate_tickets(s); return res; }

Compilation message (stderr)

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:48:12: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   48 |     return res;
      |            ^~~
#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...