Submission #1107425

#	Time	Username	Problem	Language	Result	Execution time	Memory
1107425		12345678	Topical (NOI23_topical)	C++17	40 / 100	1074 ms	181344 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define ll long long

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

ll n, k, cnt;
vector<ll> cur, sm;
vector<vector<ll>> r, u;
vector<set<pair<ll, ll>>> s;
queue<ll> q;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    cur.resize(k);
    sm.resize(n);
    s.resize(k);
    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], sm[i]+=r[i][j];
    for (int i=0; i<n; i++) for (int j=0; j<k; j++) cin>>u[i][j];
    for (int i=0; i<n; i++) 
    {
        if (sm[i]==0) q.push(i);
        else s[0].insert({r[i][0], i});
    }
    while (!q.empty())
    {
        auto x=q.front();
        q.pop();
        cnt++;
        for (int i=0; i<k; i++) 
        {
            cur[i]+=u[x][i];
            while (!s[i].empty()&&s[i].begin()->first<=cur[i])
            {
                ll tmp=s[i].begin()->second;
                s[i].erase(s[i].begin());
                if (i==k-1) q.push(tmp);
                else s[i+1].insert({r[tmp][i+1], tmp});
            }
        }
    }
    cout<<cnt;
}

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