Submission #936955

#	Time	Username	Problem	Language	Result	Execution time	Memory
936955		qwe1rt1yuiop1	Topical (NOI23_topical)	C++14	61 / 100	1095 ms	140512 KiB

Main

#include <bits/stdc++.h>
#define int long long
using namespace std;
using pii = pair<int, int>;

void solve()
{
    int n, k;
    cin >> n >> k;
    vector<vector<int>> a(n, vector<int>(k)), b = a;
    for (auto &i : a)
        for (auto &j : i)
            cin >> j;
    for (auto &i : b)
        for (auto &j : i)
            cin >> j;
    
    if (k == 1)
    {
        vector<pii> v(n);
        for (int i = 0; i < n; ++i)
            v[i].first = a[i][0], v[i].second = b[i][0];
        sort(v.begin(), v.end());
        int cur = 0, ans = 0;
        for (int i = 0; i < n; ++i)
            if (v[i].first <= cur)
            {
                cur += v[i].second;
                ++ans;
            }
        cout << ans << '\n';
        return;
    }
    
    vector<int> cur(k, 0), flag(n, 0);
    while (1)
    {
        int ok = 0;
        for (int i = 0; i < n; ++i)
            if (!flag[i])
            {
                int okk = 1;
                for (int j = 0; j < k; ++j)
                    okk &= cur[j] >= a[i][j];
                if (okk)
                {
                    ok = flag[i] = 1;
                    for (int j = 0; j < k; ++j)
                        cur[j] += b[i][j];
                    break;
                }
            }
        if (!ok)
            break;
    }
    cout << accumulate(flag.begin(), flag.end(), 0LL) << '\n';
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    solve();

    return 0;
}

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