제출 #1250678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1250678		Geforgs	Topical (NOI23_topical)	C++20	40 / 100	1055 ms	126544 KiB

Main

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, k, i, j, x, res=0;
    cin>>n>>k;
    vector<ll> p(k);
    vector<ll> cnt(n);
    vector<set<pair<ll, ll>>> a(k);
    vector<vector<ll>> b(n, vector<ll>(k));
    queue<ll> next;
    for(i=0;i<n;++i){
        for(j=0;j<k;++j){
            cin>>x;
            if(x == 0){
                ++cnt[i];
            }else{
                a[j].insert({x, i});
            }
        }
        if(cnt[i] == k){
            next.push(i);
        }
    }
    for(i=0;i<n;++i){
        for(j=0;j<k;++j){
            cin>>b[i][j];
        }
    }
    while(!next.empty()){
        ++res;
        x = next.front();
        next.pop();
        for(i=0;i<k;++i){
            p[i] += b[x][i];
            while(!a[i].empty() and a[i].begin()->first <= p[i]){
                ++cnt[a[i].begin()->second];
                if(cnt[a[i].begin()->second] == k){
                    next.push(a[i].begin()->second);
                }
                a[i].erase(a[i].begin());
            }
        }
    }
    cout<<res<<endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

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