oj.uz

Submission #1075605

# Submission time Handle Problem Language Result Execution time Memory
1075605 2024-08-26T07:57:38 Z vjudge1 Topical (NOI23_topical) C++17
100 / 100
 412 ms 136352 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 1 ms 344 KB Output is correct
3 Correct 2 ms 1116 KB Output is correct
4 Correct 181 ms 102000 KB Output is correct
5 Correct 174 ms 102072 KB Output is correct
6 Correct 172 ms 102076 KB Output is correct
7 Correct 144 ms 86388 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 2 ms 860 KB Output is correct
8 Correct 2 ms 664 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 2 ms 856 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 1884 KB Output is correct
4 Correct 31 ms 13760 KB Output is correct
5 Correct 28 ms 13856 KB Output is correct
6 Correct 397 ms 136336 KB Output is correct
7 Correct 372 ms 133784 KB Output is correct
8 Correct 412 ms 136352 KB Output is correct
9 Correct 370 ms 133532 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 344 KB Output is correct
3 Correct 2 ms 1116 KB Output is correct
4 Correct 181 ms 102000 KB Output is correct
5 Correct 174 ms 102072 KB Output is correct
6 Correct 172 ms 102076 KB Output is correct
7 Correct 144 ms 86388 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 2 ms 664 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 2 ms 856 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 4 ms 1884 KB Output is correct
23 Correct 31 ms 13760 KB Output is correct
24 Correct 28 ms 13856 KB Output is correct
25 Correct 397 ms 136336 KB Output is correct
26 Correct 372 ms 133784 KB Output is correct
27 Correct 412 ms 136352 KB Output is correct
28 Correct 370 ms 133532 KB Output is correct
29 Correct 183 ms 36816 KB Output is correct
30 Correct 183 ms 32592 KB Output is correct
31 Correct 251 ms 40648 KB Output is correct
32 Correct 155 ms 36816 KB Output is correct
33 Correct 166 ms 32340 KB Output is correct
34 Correct 201 ms 35580 KB Output is correct
35 Correct 249 ms 40640 KB Output is correct
36 Correct 183 ms 35584 KB Output is correct
37 Correct 206 ms 35768 KB Output is correct
38 Correct 160 ms 40956 KB Output is correct