Submission #1201864

#TimeUsernameProblemLanguageResultExecution timeMemory
1201864Triseedot식물 비교 (IOI20_plants)C++20
Compilation error
0 ms0 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; #define len(v) (int) (v.size()) #define all(v) v.begin(), v.end() using ll = long long; long long find_maximum(int k, vector<vector<int>> x) { int n = len(x); int m = len(x[0]); vector answer(n, vector(m, -1)); vector<pair<int, int>> cell(n * m); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cell[i * m + j] = {x[i][j], i}; } } sort(all(cell)); vector<int> cnt(n, 0); int r = n * k / 2; ll estimate = 0; for (int i = len(cell) - 1; i >= 0 && r > 0; i--) { if (cnt[cell[i].second] < k) { cnt[cell[i].second]++; r--; estimate += cell[i].first; } } vector<int> cnt1 = cnt; for (int i = 0; i < len(cell); i++) { if (cnt1[cell[i].second] < k) { cnt1[cell[i].second]++; estimate -= cell[i].first; } } vector<int> idx(n); iota(all(idx), 0ll); vector<int> ptr_l(n, 0), ptr_r(n, m - 1); ll score = 0; for (int ki = 0; ki < k; ki++) { sort(all(idx), [&] (int i, int j) { return cnt[i] < cnt[j]; }); for (int i = 0; i < n / 2; i++) { int j = idx[i]; score -= x[j][ptr_l[j]]; answer[j][ptr_l[j]++] = ki; } for (int i = n / 2; i < n; i++) { int j = idx[i]; score += x[j][ptr_r[j]]; answer[j][ptr_r[j]--] = ki; } } assert(estimate == score); allocate_tickets(answer); return score; }

Compilation message (stderr)

plants.cpp:1:10: fatal error: tickets.h: No such file or directory
    1 | #include "tickets.h"
      |          ^~~~~~~~~~~
compilation terminated.