Submission #1218237

#TimeUsernameProblemLanguageResultExecution timeMemory
1218237cpismayilmmdv985Topical (NOI23_topical)C++20
40 / 100
1096 ms23800 KiB
#include <bits/stdc++.h> int main() { using namespace std; ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int N, K; cin >> N >> K; vector<vector<int64_t>> R(N, vector<int64_t> (K)), U(N, vector<int64_t> (K)); 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]; vector<int64_t> P(K); vector<bool> used(N); int cnt = 0; while (true) { bool flag = false; for (int i = 0; i < N; i++) { if (used[i]) continue; bool valid = true; for (int j = 0; j < K; j++) if (P[j] < R[i][j]) { valid = false; break; } if (valid) { used[i] = flag = true; for (int j = 0; j < K; j++) P[j] += U[i][j]; } } if (!flag) break; } for (int i = 0; i < N; i++) cnt += used[i]; cout << cnt; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...