제출 #1218427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1218427		cpismayilmmdv985	Topical (NOI23_topical)	C++20	100 / 100	413 ms	125728 KiB

Main

#include <bits/stdc++.h>

int main() {
    using namespace std;
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
 
    int N, K, res = 0;   cin >> N >> K;
    vector<vector<int>> U(N, vector<int> (K)), R(N, vector<int> (K));
    vector<priority_queue<array<int, 2>, vector<array<int, 2>>, greater<array<int, 2>>>> pq(K);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < K; j++) {
            cin >> R[i][j];
            pq[j].push({R[i][j], i});
        }
    }
    for (int i = 0; i < N; i++) for (int j = 0; j < K; j++) cin >> U[i][j];
    vector<int64_t> P(K), cnt(N);
    while (true) {
        bool flag = false;
        for (int j = 0; j < K; j++) {
            while (!pq[j].empty()) {
                array<int, 2> curr = pq[j].top();
                if (P[j] >= curr[0]) {
                    cnt[curr[1]]++;
                    pq[j].pop();
                    flag = true;
                    if (cnt[curr[1]] == K) {
                        res++;
                        for (int k = 0; k < K; k++) P[k] += U[curr[1]][k];
                    }
                } 
                else break;
            }
        }
        if (!flag)  break;
    }
    cout << res;

    return 0;
}

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