제출 #1107420

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1107420		12345678	Topical (NOI23_topical)	C++17	40 / 100	1072 ms	33108 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define ll long long

ll n, k, cnt;
vector<ll> cur, p, vs;
vector<vector<ll>> r, u;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    cur.resize(k);
    p.resize(n);
    vs.resize(n);
    r.resize(n);
    u.resize(n);
    for (int i=0; i<n; i++) r[i].resize(k), u[i].resize(k);
    for (int i=0; i<n; i++) for (int j=0; j<k; j++) cin>>r[i][j];
    for (int i=0; i<n; i++) for (int j=0; j<k; j++) cin>>u[i][j];
    while (1)
    {
        ll progress=0;
        for (int i=0; i<n; i++)
        {
            while (p[i]<k&&cur[p[i]]>=r[i][p[i]]) p[i]++;
            if (!vs[i]&&p[i]==k) 
            {
                vs[i]=1;
                cnt++;
                for (int j=0; j<k; j++) cur[j]+=u[i][j];
                progress=1;
            }
        }
        if (!progress) break;
    }
    cout<<cnt;
}

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