제출 #1280874

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280874		aeg	Topical (NOI23_topical)	C++20	100 / 100	459 ms	68256 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, k;
  cin >> n >> k;

  vector<vector<pair<int, int>>> req(k, vector<pair<int, int>>(n, {0, 0}));
  vector<int> c(n, 0);
  vector<vector<int>> don(n, vector<int>(k, 0));
  vector<int> know(k, 0);
  vector<int> ind(k, 0);

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < k; j++) {
      int tmp;
      cin >> tmp;
      req[j][i] = {tmp, i};
    }
  }

  for (int i = 0; i < n; i++)
    for (int j = 0; j < k; j++)
      cin >> don[i][j];

  for (int i = 0; i < k; i++)
    sort(req[i].begin(), req[i].end());

  int ans = 0;

  while (true) {
    queue<int> q;
    for (int i = 0; i < k; i++) {
      while (ind[i] < n && req[i][ind[i]].first <= know[i]) {
        c[req[i][ind[i]].second]++;
        if (c[req[i][ind[i]].second] == k) {
          q.push(req[i][ind[i]].second);
          ans++;
        }
        ind[i]++;
      }
    }

    if (q.empty())
      break;
    while (!q.empty()) {
      int cur = q.front();
      for (int i = 0; i < k; i++)
        know[i] += don[cur][i];
      q.pop();
    }
  }

  cout << ans << '\n';
}

• Subtask 1: 12 / 12
• Subtask 2: 28 / 28
• Subtask 3: 21 / 21
• Subtask 4: 39 / 39