oj.uz

Submission #1102825

# Submission time Handle Problem Language Result Execution time Memory
1102825 2024-10-19T04:16:22 Z blackslex Topical (NOI23_topical) C++17
40 / 100
 1000 ms 161412 KB 
#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<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]) ms[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;
    vector<bool> f(n + 5);
    for (int i = 1; i <= n; i++) if (done[i] == k) q.emplace(i);
    while (!q.empty()) {
        int cur = q.front(); q.pop();
        if (f[cur]) continue; f[cur] = 1;
        for (int j = 1; j <= k; j++) {
            p[j] += u[cur][j];
            vector<pii> c;
            for (auto [x, y]: ms[j]) {
                if (x <= p[j]) {
                    done[y]++;
                    if (done[y] == k) q.emplace(y);
                    c.emplace_back(x, y);
                } else break;
            }
            for (auto &e: c) ms[j].erase(e);
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) if (f[i]) ans++;
    cout << ans;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:29:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   29 |         if (f[cur]) continue; f[cur] = 1;
      |         ^~
Main.cpp:29:31: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   29 |         if (f[cur]) continue; f[cur] = 1;
      |                               ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 1360 KB Output is correct
4 Correct 131 ms 98316 KB Output is correct
5 Correct 132 ms 98316 KB Output is correct
6 Correct 135 ms 98316 KB Output is correct
7 Correct 175 ms 145152 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 568 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 3 ms 816 KB Output is correct
8 Correct 4 ms 848 KB Output is correct
9 Correct 3 ms 848 KB Output is correct
10 Correct 4 ms 848 KB Output is correct
11 Correct 4 ms 848 KB Output is correct
12 Correct 3 ms 848 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 6 ms 1872 KB Output is correct
4 Correct 72 ms 16456 KB Output is correct
5 Correct 58 ms 16468 KB Output is correct
6 Execution timed out 1082 ms 161412 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 2 ms 1360 KB Output is correct
4 Correct 131 ms 98316 KB Output is correct
5 Correct 132 ms 98316 KB Output is correct
6 Correct 135 ms 98316 KB Output is correct
7 Correct 175 ms 145152 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 568 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 3 ms 816 KB Output is correct
15 Correct 4 ms 848 KB Output is correct
16 Correct 3 ms 848 KB Output is correct
17 Correct 4 ms 848 KB Output is correct
18 Correct 4 ms 848 KB Output is correct
19 Correct 3 ms 848 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 6 ms 1872 KB Output is correct
23 Correct 72 ms 16456 KB Output is correct
24 Correct 58 ms 16468 KB Output is correct
25 Execution timed out 1082 ms 161412 KB Time limit exceeded
26 Halted 0 ms 0 KB -