# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
914128 | Litusiano | Topical (NOI23_topical) | C++17 | 1059 ms | 24012 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n,k; cin>>n>>k;
vector<vector<int>> r(n,vector<int>(k,0)); auto u = r;
for(auto& x : r){
for(auto& i : x) cin>>i;
}
for(auto& x : u){
for(auto& i : x) cin>>i;
}
unordered_set<int> idx; for(int i = 0; i<n; i++) idx.insert(i);
int prev = 0;
vector<int> act(k,0);
while(prev != idx.size()){
prev = idx.size();
vector<int> temp;
for(int i : idx){
bool ok = 1;
for(int j = 0; j<k; j++){
// cerr<<"HERE "<<r[i][j]<<" "<<act[j]<<endl;
ok&=(r[i][j] <= act[j]);
}
// cerr<<"END "<<endl;
if(ok){
temp.push_back(i);
for(int z = 0; z<k; z++){
act[z] += u[i][z];
}
}
}
for(int i : temp) idx.erase(i);
}
cout<<n-idx.size()<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |