Submission #1065818

#TimeUsernameProblemLanguageResultExecution timeMemory
1065818allin27xCarnival Tickets (IOI20_tickets)C++17
0 / 100
0 ms604 KiB
#include <bits/stdc++.h> using namespace std; #define int long long void allocate_tickets(vector<vector<signed>> s); int find_maximum(signed k, vector<vector<signed>> x) { int n = x.size(); int m = x[0].size(); vector<vector<signed>> s(n, vector<signed>(m)); if (m==1) { for (int i=0; i<n; i++) s[i][0]=0; allocate_tickets((s)); int md = x[n/2][0]; int s = 0; for (int i=0; i<n; i++) s += abs(x[i][0]-md); return s; } return 0; }

Compilation message (stderr)

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:11:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   11 |         for (int i=0; i<n; i++) s[i][0]=0; allocate_tickets((s));
      |         ^~~
tickets.cpp:11:44: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   11 |         for (int i=0; i<n; i++) s[i][0]=0; allocate_tickets((s));
      |                                            ^~~~~~~~~~~~~~~~
#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...