제출 #1181681

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1181681		asli_bg	Topical (NOI23_topical)	C++20	100 / 100	377 ms	160040 KiB

Main

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

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long

typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;

#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2

const int MAXN=1e6+5;
const int MOD=1e9+7;
const int INF=1e18;

vii vec[MAXN];

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

    int n,k;
    cin>>n>>k;
    vector<vi> r(n+1,vi(k+1));
    FORE(i,1,n+1){
        FORE(j,1,k+1){
            cin>>r[i][j];
        }
    }

    vector<vi> u(n+1,vi(k+1));
    FORE(i,1,n+1){
        FORE(j,1,k+1){
            cin>>u[i][j];
        }
    }

    FORE(j,1,k+1){
        FORE(i,1,n+1){
            vec[j].pb({r[i][j],i});
        }
        sort(all(vec[j]));
    }

    vi say(n+1,0);
    vi pt(k+1,0); //pointer for each topic
    vi deg(k+1,0);

    int ans=0;

    queue<int> q;
    FORE(i,1,n+1){
        bool f=true;
        FORE(j,1,k+1){
            if(r[i][j]!=0) f=false;
        }
        if(f){
            q.push(i);
        }
    }

    vb vis(n+1,false);

    while(!q.empty()){
        auto el=q.front();
        q.pop();

        if(vis[el]) continue;
        vis[el]=true;

        ans++;

        FORE(j,1,k+1){
            deg[j]+=u[el][j];
            while(pt[j]<n and vec[j][pt[j]].fi<=deg[j]){
                say[vec[j][pt[j]].se]++;
                if(say[vec[j][pt[j]].se]==k){
                    q.push(vec[j][pt[j]].se);
                }
                pt[j]++;
            }
        }
    }

    cout<<ans<<endl;    
}   

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