| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1234740 | mariza | 메기 농장 (IOI22_fish) | C++20 | 79 ms | 15788 KiB |
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5;
#define MID ((l+r)/2)
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){
ll c=0;
vector<pair<ll,ll>> c0, c1;
for(ll i=0; i<m; i++){
if(x[i]==1){
c+=w[i];
c1.push_back({y[i],w[i]});
}
else c0.push_back({y[i],w[i]});
}
sort(c0.begin(),c0.end());
sort(c1.begin(),c1.end());
ll idx0=0, idx1=0;
ll ans=c;
for(ll h=0; h<n; h++){
if(idx0<c0.size() && c0[idx0].first==h){
c+=c0[idx0].second;
idx0++;
}
if(idx1<c1.size() && c1[idx1].first==h){
c-=c1[idx1].second;
idx1++;
}
ans=max(ans,c);
// cout<<h<<" "<<c<<endl;
}
return ans;
}
| # | 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... | ||||
| # | 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... | ||||
