oj.uz

Submission #966870

# Submission time Handle Problem Language Result Execution time Memory
966870 2024-04-20T14:01:05 Z TB_ Topical (NOI23_topical) C++17
100 / 100
 432 ms 152052 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long 
#define pb push_back
#define fo(i, n) for(ll i = 0; i<(n); i++)
#define deb(x) cout << #x << " = " << (x) << endl
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << y << endl
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<vpl> vvpl;

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

    int n, k;
    cin >> n >> k;
    vvl r(n, vl(k)), u(n, vl(k));
    vvpl cost(k);
    queue<ll> onQueue;
    vl am(n, 0);
    ll ans = 0;
    fo(i, n){
        bool allZero = 1;
        fo(j, k){
            cin >> r[i][j];
            if(r[i][j]) allZero = 0;
            cost[j].pb({r[i][j], i});
        }
        if(allZero){
            onQueue.push(i);
            am[i] = k+1;
        }
    }
    fo(i, n){
        fo(j, k){
            cin >> u[i][j];
        }
    }
    fo(i, k) sort(rall(cost[i]));
    vl p(k, 0);
    while(!onQueue.empty()){
        ll current = onQueue.front();
        onQueue.pop();
        ans++;
        fo(i, k){
            p[i]+=u[current][i];
            while(cost[i].size() && cost[i][cost[i].size()-1].F<=p[i]){
                ll pos = cost[i][cost[i].size()-1].S; 
                cost[i].pop_back();
                am[pos]++;
                if(am[pos] == k) onQueue.push(pos);
            }
        }
        
    }
    cout << ans;


    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 4 ms 1368 KB Output is correct
4 Correct 203 ms 90312 KB Output is correct
5 Correct 206 ms 90212 KB Output is correct
6 Correct 201 ms 90212 KB Output is correct
7 Correct 169 ms 84540 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 3 ms 860 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 3 ms 984 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 3 ms 860 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 2136 KB Output is correct
4 Correct 40 ms 15360 KB Output is correct
5 Correct 39 ms 15180 KB Output is correct
6 Correct 431 ms 151300 KB Output is correct
7 Correct 384 ms 146860 KB Output is correct
8 Correct 432 ms 152052 KB Output is correct
9 Correct 381 ms 146860 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 4 ms 1368 KB Output is correct
4 Correct 203 ms 90312 KB Output is correct
5 Correct 206 ms 90212 KB Output is correct
6 Correct 201 ms 90212 KB Output is correct
7 Correct 169 ms 84540 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 452 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 3 ms 860 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 3 ms 984 KB Output is correct
18 Correct 2 ms 860 KB Output is correct
19 Correct 3 ms 860 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 4 ms 2136 KB Output is correct
23 Correct 40 ms 15360 KB Output is correct
24 Correct 39 ms 15180 KB Output is correct
25 Correct 431 ms 151300 KB Output is correct
26 Correct 384 ms 146860 KB Output is correct
27 Correct 432 ms 152052 KB Output is correct
28 Correct 381 ms 146860 KB Output is correct
29 Correct 222 ms 54664 KB Output is correct
30 Correct 225 ms 49488 KB Output is correct
31 Correct 263 ms 55864 KB Output is correct
32 Correct 176 ms 45448 KB Output is correct
33 Correct 181 ms 42176 KB Output is correct
34 Correct 209 ms 45588 KB Output is correct
35 Correct 255 ms 52320 KB Output is correct
36 Correct 234 ms 48664 KB Output is correct
37 Correct 245 ms 51652 KB Output is correct
38 Correct 165 ms 44492 KB Output is correct