Submission #1208416

#	Time	Username	Problem	Language	Result	Execution time	Memory
1208416		lalig777	Topical (NOI23_topical)	C++20	100 / 100	439 ms	79516 KiB

Main

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#define int long long
using namespace std;

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, k;
	int sol=0;
	cin>>n>>k;
	vector<priority_queue<pair<int,int> > >req(k);
	vector<vector<int> >gain(n, vector<int>(k));
	vector<int>p(k, 0);
	vector<int>ans(n, 0);
	for (int i=0; i<n; i++){
		for (int j=0; j<k; j++){
			int x; cin>>x;
			req[j].push(make_pair(-x, i));
		}
	}
	for (int i=0; i<n; i++){
		for (int j=0; j<k; j++) cin>>gain[i][j];
	}
	
	bool algo=true;
	while (algo==true){
		algo=false;
		for (int i=0; i<k; i++){
			while (!req[i].empty()){
				if (-req[i].top().first<=p[i]){
					int ind=req[i].top().second;
					req[i].pop();
					ans[ind]++;
					if (ans[ind]==k){
						ans[ind]=0;
						algo=true;
						sol++;
						for (int j=0; j<k; j++){
							p[j]+=gain[ind][j];
						}
					}
				}else break;
			}
		}
	}
	cout<<sol<<'\n';
}

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