Submission #305817

#TimeUsernameProblemLanguageResultExecution timeMemory
3058174fectaCarnival Tickets (IOI20_tickets)C++14
Compilation error
0 ms0 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; #define ll long long #define int ll #define ld long double #define pii pair<int, int> #define f first #define s second #define readl(_s) getline(cin, (_s)); #define boost() cin.tie(0); cin.sync_with_stdio(0) const int MN = 1505; int n, m, tot; vector<vector<int>> ans(1505, vector<int> (1505, -1)); vector<int> rnd(1505); void allocate_tickets(vector<vector<int32_t>> s); ll find_maximum(int32_t k, vector<vector<int32_t>> a) { for (int i = 0; i < n; i++) { for (int j = m - k; j < m; j++) { //half max, half min, choose all max first then trade for loss. tot += a[i][j]; } } vector<pii> v; for (int i = 0; i < n; i++) { for (int j = 0; j < k; j++) { v.push_back({-a[i][j] - a[i][m - k + j], i}); //we will take the min from this row since it loses the least pts. } } sort(v.begin(), v.end(), greater<>()); for (int i = 0; i < n * k / 2; i++) tot += v[i].f, rnd[v[i].s]++; for (int i = 0; i < n; i++) { int id = 0; for (int j = 0; j < rnd[i]; j++) { ans[i][j] = id; id++; } for (int j = m - 1; j > m - 1 - (k - rnd[i]); j--) { ans[i][j] = id; id++; } } allocate_tickets(ans); return tot; }

Compilation message (stderr)

tickets.cpp: In function 'long long int find_maximum(int32_t, std::vector<std::vector<int> >)':
tickets.cpp:52:22: error: could not convert 'ans' from 'vector<vector<long long int>>' to 'vector<vector<int>>'
   52 |     allocate_tickets(ans);
      |                      ^~~
      |                      |
      |                      vector<vector<long long int>>