제출 #1291622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1291622		1ota	Topical (NOI23_topical)	C++20	40 / 100	1095 ms	23800 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define endl "\n"
#define int long long
#define pii pair<int, int>
#define ff first
#define ss second
#define entire(x) (x).begin(), (x).end()

int32_t main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);

    int n, k; cin >> n >> k;

    vector<vector<int>> a(n, vector<int>(k, 0)), b(n, vector<int>(k, 0));
    for (int i = 0; i < n; i++) for (int j = 0; j < k; j++) cin >> a[i][j];
    for (int i = 0; i < n; i++) for (int j = 0; j < k; j++) cin >> b[i][j];

    int ans = 0;

    vector<int> cur(k, 0);
    vector<bool> vis(n, false);

    auto add = [&](){
        for (int i = 0; i < n; i++){
            if (vis[i]) continue;
            
            bool ok = true;
            for (int j = 0; j < k; j++) ok &= (a[i][j] <= cur[j]);
            if (ok){
                for (int j = 0; j < k; j++) cur[j] += b[i][j];
                vis[i] = true; return true;
            }
        }
        return false;
    };

    for (int i = 0; i < n; i++){
        if (!add()) break;
        ans++;
    }

    cout << ans << endl;

    return 0;
}

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