제출 #1319293

#제출 시각아이디문제언어결과실행 시간메모리
1319293nathlol2Topical (NOI23_topical)C++20
40 / 100
110 ms31728 KiB
#include <bits/stdc++.h> #define int long long using namespace std; int n, m, ans; signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; int r[n + 1][m + 1], u[n + 1][m + 1], a[n + 1], v[n + 1]; memset(a, 0, sizeof a); memset(v, 0, sizeof v); for(int i = 1;i<=n;i++) for(int j = 1;j<=m;j++) cin >> r[i][j]; for(int i = 1;i<=n;i++) for(int j = 1;j<=m;j++) cin >> u[i][j]; if(n <= 1000){ while(1){ bool f = 0; for(int i = 1;i<=n;i++){ if(v[i]) continue; bool ff = 1; for(int j = 1;j<=m;j++){ if(a[j] < r[i][j]){ ff = 0; } } if(ff){ f = 1; for(int j = 1;j<=m;j++){ a[j] += u[i][j]; } v[i] = 1; break; } } if(!f) break; ++ans; } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...