oj.uz

Submission #1075602

# Submission time Handle Problem Language Result Execution time Memory
1075602 2024-08-26T07:57:16 Z Whisper Topical (NOI23_topical) C++17
100 / 100
 438 ms 136488 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int N, K;
#define Vec(int)            vector<vector<int>>
#define MAX                 1000005
queue<int> q;
int done[MAX];

int value[MAX], order[MAX];
void process(void){
    cin >> N >> K;
    Vec(int) U(N + 1, vector<int>(K + 1));
    Vec(int) R(N + 1, vector<int>(K + 1));

    vector<vector<pair<int, int>>> P(K + 1);
    FOR(i, 1, N) FOR(j, 1, K) cin >> R[i][j];
    FOR(i, 1, N) FOR(j, 1, K) cin >> U[i][j];

    FOR(i, 1, N) FOR(j, 1, K){
        P[j].emplace_back(make_pair(R[i][j], i));
    }

    for (int i = 1; i <= K; ++i) sort(P[i].begin(), P[i].end());

    FOR(i, 1, N){
        int ok = 1;
        FOR(j, 1, K) if(R[i][j] == 0) ++done[i];
    }
    for (int i = 1; i <= N; ++i){
        if(done[i] == K) q.emplace(i);
    }
    int ans = 0;
    while(q.size()){
        int u = q.front(); q.pop(); ++ans;
        for (int i = 1; i <= K; ++i){
            value[i] += U[u][i];
        }

        for (int i = 1; i <= K; ++i){
            for (int &j = order[i]; j < N;){
                while(j < N && value[i] >= P[i][j].first){
                    done[P[i][j].second]++;
                    if(done[P[i][j].second] == K){
                        q.emplace(P[i][j].second);
                    }
                    ++order[i];
                }
                break;
            }
        }
    }
    cout << ans;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Compilation message

Main.cpp: In function 'void process()':
Main.cpp:61:13: warning: unused variable 'ok' [-Wunused-variable]
   61 |         int ok = 1;
      |             ^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 1372 KB Output is correct
4 Correct 187 ms 113764 KB Output is correct
5 Correct 183 ms 113660 KB Output is correct
6 Correct 191 ms 113772 KB Output is correct
7 Correct 151 ms 92344 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 1004 KB Output is correct
8 Correct 3 ms 860 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 996 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 1884 KB Output is correct
4 Correct 34 ms 13772 KB Output is correct
5 Correct 36 ms 14020 KB Output is correct
6 Correct 410 ms 136432 KB Output is correct
7 Correct 396 ms 133676 KB Output is correct
8 Correct 438 ms 136488 KB Output is correct
9 Correct 400 ms 133788 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 0 ms 348 KB Output is correct
3 Correct 2 ms 1372 KB Output is correct
4 Correct 187 ms 113764 KB Output is correct
5 Correct 183 ms 113660 KB Output is correct
6 Correct 191 ms 113772 KB Output is correct
7 Correct 151 ms 92344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 1004 KB Output is correct
15 Correct 3 ms 860 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 996 KB Output is correct
19 Correct 3 ms 860 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 4 ms 1884 KB Output is correct
23 Correct 34 ms 13772 KB Output is correct
24 Correct 36 ms 14020 KB Output is correct
25 Correct 410 ms 136432 KB Output is correct
26 Correct 396 ms 133676 KB Output is correct
27 Correct 438 ms 136488 KB Output is correct
28 Correct 400 ms 133788 KB Output is correct
29 Correct 219 ms 54868 KB Output is correct
30 Correct 196 ms 49492 KB Output is correct
31 Correct 251 ms 55812 KB Output is correct
32 Correct 156 ms 45780 KB Output is correct
33 Correct 165 ms 42340 KB Output is correct
34 Correct 189 ms 45568 KB Output is correct
35 Correct 221 ms 52232 KB Output is correct
36 Correct 184 ms 48700 KB Output is correct
37 Correct 227 ms 51384 KB Output is correct
38 Correct 166 ms 44768 KB Output is correct