제출 #1286222

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1286222		lucian	Topical (NOI23_topical)	C++20	40 / 100	1094 ms	23896 KiB

Main

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

int n, k;
vector<vector<int>> r, u;
vector<int> p;
vector<bool> done;

signed main(){
	cin >> n >> k;
	r.resize(n, vector<int>(k));
	u.resize(n, vector<int>(k));
	p.assign(k, 0);
	done.assign(n, false);
	
	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];
		}
	}
	
	int completed = 0;
	bool progress = true;
	while(progress){
		progress = false;
		for(int i = 0; i < n; i++){
			if(done[i]){
				continue;
			}
			bool can = true;
			for(int j = 0; j < k; j++){
				if(p[j] < r[i][j]){
					can = false;
				}
			}
			if(can){
				done[i] = true;
				completed++;
				progress = true;
				for(int j = 0; j < k; j++){
					p[j] += u[i][j];
				}
			}
		}
	}
	
	cout << completed;
}

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