| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1290325 | leehoang | Topical (NOI23_topical) | C++20 | 379 ms | 196984 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define int long long
#define TASK "tropical"
const int maxn = 1e6+5;
const int mod = 1e9+7;
int n,k;
vector<vector<int>> r,u;
vector<int> p;
namespace trau{
vector<int> d;
void solve(){
d.assign(n+5,0);
int res = 0;
while (1){
bool ok = 0;
for (int i = 1;i<=n;i++){
int cnt = 0;
if (!d[i]){
for (int j = 1;j<=k;j++){
if (p[j]>=r[i][j]) cnt++;
}
if (cnt == k){
ok = 1;
for (int j = 1;j<=k;j++){
p[j]+=u[i][j];
}
res++;
d[i] = 1;
}
}
}
if (!ok) break;
}
cout << res;
}
}
namespace sub3{
vector<ii> a;
void solve(){
for (int i = 1;i<=n;i++) a.pb({r[i][1],u[i][1]});
sort(a.begin(),a.end());
int l = 0;
int cnt = 0;
int cur = 0;
for (int i = 0;i<n;i++){
if (a[i].fi <= cur){
cur+=a[i].se;
cnt++;
}
else break;
}
cout << cnt;
}
}
signed main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
if (fopen(TASK".inp","r")){
freopen(TASK".inp","r",stdin);
freopen(TASK".out","w",stdout);
}
cin >> n >> k;
r.assign(n+5,vector<int>(k+5,0));
u.assign(n+5,vector<int>(k+5,0));
p.assign(n+5,0);
for (int i = 1;i<=n;i++){
for (int j = 1;j<=k;j++) cin >> r[i][j];
}
for (int i = 1;i<=n;i++){
for (int j = 1;j<=k;j++) cin >> u[i][j];
}
if (k==1) sub3::solve();
else trau::solve();
// trau::solve();
// sub3::solve();
}
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... | ||||
