제출 #1286217

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1286217		lucian	Topical (NOI23_topical)	C++20	12 / 100	1 ms	580 KiB

Main

#include <bits/stdc++.h>
#define int long long

using namespace std;
int n, k;
pair<int, pair<int, int>> knowledge;
vector<pair<int, pair<int, int>>> r;
vector<pair<int, pair<int, int>>> u;

signed main(){
    knowledge.first = 0;
    knowledge.second.first = 0;
    knowledge.second.second = 0;

    cin >> n >> k;
    r.resize(n);
    u.resize(n);

    for(int i = 0; i < n; i++){
        cin >> r[i].first >> r[i].second.first >> r[i].second.second;
    }
    for(int i = 0; i < n; i++){
        cin >> u[i].first >> u[i].second.first >> u[i].second.second;
    }

    vector<bool> done(n, false);
    int completed = 0;
    bool progress = true;

    while(progress){
        progress = false;
        for(int i = 0; i < n; i++){
            if(done[i]){
            	continue;
			}
            if(knowledge.first >= r[i].first && knowledge.second.first >= r[i].second.first && knowledge.second.second >= r[i].second.second){
                done[i] = true;
                completed++;
                progress = true;
                knowledge.first += u[i].first;
                knowledge.second.first += u[i].second.first;
                knowledge.second.second += u[i].second.second;
            }
        }
    }

    cout << completed;
}

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