Submission #761505

#TimeUsernameProblemLanguageResultExecution timeMemory
761505raul2008487Catfish Farm (IOI22_fish)C++17
0 / 100
82 ms24256 KiB
#include "fish.h" #include<bits/stdc++.h> #define pb push_back #define ll long long #define pll pair<ll,ll> using namespace std; long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) { vector<vector<ll>> fish(2,vector<ll>(N,0)); ll i; for(i=0;i<M;i++){ fish[X[i]][Y[i]]=W[i]; } vector<vector<ll>> pre(2,vector<ll>(N,0)); ll md=0; md=max(md,fish[0][0]-fish[1][0]); pre[0][0]=fish[0][0]; pre[1][0]=fish[1][0]; for(i=1;i<N;i++){ pre[0][i]=pre[0][i-1]+fish[0][i]; pre[1][i]=pre[1][i-1]+fish[1][i]; md=max(md,pre[0][i]-pre[1][i]); } return pre[1][N-1]+md; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...