제출 #1335673

#제출 시각아이디문제언어결과실행 시간메모리
1335673zhehanCouncil (JOI23_council)C++20
41 / 100
4094 ms32624 KiB
#include <bits/stdc++.h>
using namespace std;

signed main() {
  int n, m;
  cin >> n >> m;
  vector<vector<int>> votes(n, vector<int>(m, 0));
  map<vector<int>, vector<int>> combi;
  for (int i = 0; i < n; ++i) {
    int bm = 0;
    for (int j = 0; j < m; ++j) {
      cin >> votes[i][j];
    }
    combi[votes[i]].push_back(i);
  }
  vector<int> sum(m, 0);
  for (auto e : combi) {
    auto vote = e.first;
    for (int i = 0; i < m; ++i) {
      sum[i] += vote[i] * e.second.size();
    }
  }
  vector<int> ans(n, 0);
  for (auto e : combi) {
    auto t = sum;
    for (int i = 0; i < m; ++i) {
      t[i] -= e.first[i];
    }
    int maxval = 0;
    for (auto x : combi) {
      auto temp = t;
      int val = 0;
      if (x == e && e.second.size() <= 1) {
        continue;
      }
      for (int i = 0; i < m; ++i) {
        temp[i] -= x.first[i];
        if (temp[i] >= n / 2) {
          val++;
        }
      }
      maxval = max(maxval, val);
    }
    for (auto x : e.second) {
      ans[x] = maxval;
    }
  }
  for (int i = 0; i < n; ++i) {
    cout << ans[i] << '\n';
  }
}
#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...