| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 627069 | nihaddhuseynli | 메기 농장 (IOI22_fish) | C++17 | 0 ms | 0 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.
#include <bits/stdc++.h>
#define MAX 300001
#define INF 10000000001
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define ins insert
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
ll n,t,r,m,k,res,x,y,sum;
string s;
set<pll> a[MAX];
set<ll> b[MAX];
bool comp(tuple <ll,ll,ll> x,tuple<ll,ll,ll> y){
return get<0>(x)>get<0>(y);
}
ll max_weights(ll n,ll m, vector<int> c , vector <int> d , vector <int> e){
ll dp[n+1];
dp[0]=0;
dp[1]=0;
ll h=n,sum=0;
if(b[0].size()!=0){
h=*b[0].begin();
for(auto x:a[0]){
sum+=x.second;
}
dp[1]=sum;
}
for(int i=2;i<=n;i++){
dp[i]=dp[i-1];
if(b[i-1].size()!=0){
ll j;
sum=0;
j=distance(b[i-1].begin(),b[i-1].lower_bound(h-1));
if(j==0){
h=n;
}
else{
h=*b[i-1].begin();
}
auto it=a[i-1].begin();
ll z=0;
while(it!=a[i-1].end() && z<j){
dp[i]+=(*it).second;
++it;
z++;
}
sum=0;
for(auto x:a[i-1]){
sum+=x.second;
}
if(sum+dp[i-2]>dp[i]){
dp[i]=sum+dp[i-2];
h=*b[i-1].begin();
}
}
else{
h=n;
}
}
return dp[n];
}
int main() {
ll N, M;
assert(2 == scanf("%d %d", &N, &M));
n=N;
m=M;
std::vector<int> X(M), Y(M), W(M);
for (int i = 0; i < M; ++i) {
assert(3 == scanf("%d %d %d", &X[i], &Y[i], &W[i]));
}
for(int i=0;i<m;i++){
ll k1,k2,k3;
k1=X[i];
k2=Y[i];
k3=W[i];
a[k1].insert(make_pair(n-k2-1,k3));
b[k1].insert(n-k2-1);
}
long long result = max_weights(N, M, X, Y, W);
printf("%lld\n", result);
return 0;
}