# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1102402 | LTTrungCHL | Topical (NOI23_topical) | C++17 | 171 ms | 86516 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.
///***LTT***///
/// ->NHAT QUOC GIA<- ///
#include<bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("popcnt")
//#define int long long
#define endl "\n"
#define F first
#define S second
#define pb push_back
using namespace std;
vector <int> lg2;
//void MAKE_LOG_ARR(int n){
// lg2.resize(n + 3);
// for (int i = 1;i <= n;++i){
// lg2[i] = __lg(i);
// }
//}
const long long oo = 1e9+7;
const int N = 2 * 1e5 + 10;
int n, k;
vector <pair <int ,int>> in[1000004];
vector <vector <int>> a;
vector <long long> cur, cnt;
void solve(){
cin >> n >> k;
for (int i = 1;i <= n;++i){
for (int j = 1;j <= k;++j){
int v;
cin >> v;
in[j].pb({v, i});
}
}
cur.resize(k + 2,0);
cnt.resize(k + 2,0);
a.resize(n + 2, vector <int> (k + 2,0));
for (int i = 1;i <= n;++i){
for (int j = 1;j <= k;++j){
cin >> a[i][j];
}
}
for (int i = 1;i <= k;++i){
sort(in[i].begin(), in[i].end());
reverse(in[i].begin(), in[i].end());
}
int gain = 0;
while (1){
bool found = false;
for (int i = 1;i <= k;++i){
while (!in[i].empty() and in[i].back().F <= cur[i]){
++cnt[in[i].back().S];
if (cnt[in[i].back().S] == k){
found = true;
for (int j = 1;j <= k;++j){
cur[j] += a[in[i].back().S][j];
cur[j] = min(cur[j], oo);
}
++gain;
}
in[i].pop_back();
}
}
if (!found) break;
}
cout << gain;
return;
}
int main(){
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
if (fopen("ltt.inp", "r")){
freopen("ltt.inp", "r", stdin);
freopen("ltt.out", "w", stdout);
}
// int t;
// cin >> t;
// while(t--){
solve();
// }
return 0;
}
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... |