Submission #1102827

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102827		blackslex	Topical (NOI23_topical)	C++17	21 / 100	544 ms	161704 KiB

Main

#include<bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;

int n, k;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> k;
    vector<vector<int>> r(n + 5, vector<int>(k + 5)), u(n + 5, vector<int>(k + 5));
    vector<int> p(k + 5), done(n + 5);
    vector<priority_queue<pii, vector<pii>, greater<pii>>> pq(n + 5);
    vector<multiset<pii>> ms(k + 5);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            cin >> r[i][j];
            if (r[i][j]) pq[j].emplace(r[i][j], i);
            else done[i]++;
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) cin >> u[i][j];
    }
    queue<int> q;
    for (int i = 1; i <= n; i++) if (done[i] == k) q.emplace(i);
    int ans = 0;
    while (!q.empty()) {
        int cur = q.front(); q.pop();
        ans++;
        for (int j = 1; j <= k; j++) {
            p[j] += u[cur][j];
            vector<pii> c;
            while (!pq[j].empty() && pq[j].top().first <= p[j]) {
                auto [x, y] = pq[j].top(); pq[j].pop();
                done[y]++;
                if (done[y] == k) q.emplace(y);
            }
        }
    }
    cout << ans;
}

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