Submission #833878

#TimeUsernameProblemLanguageResultExecution timeMemory
833878mindiyakCatfish Farm (IOI22_fish)C++17
0 / 100
887 ms2097152 KiB
#include "fish.h" #include <vector> #include <iostream> #define ll long long using namespace std; long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { vector<vector<int>> grid(N,vector<int>(N,0)); vector<int> length(N,0); for(int i=0;i<M;i++)grid[X[i]][Y[i]] = W[i]; for(int i=1;i<N;i++){ ll left = 0,cur = 0; int height = 0; for(int j=0;j<N;j++){ left += grid[i-1][j]; cur += grid[i][j]; if(left>cur){ height = j; left = 0; } } length[i]=height; } // for(int i=0;i<N;i++){ // cout << length[i] << " "; // }cout << endl; ll ans = 0; for(int i=0;i<M;i++){ if(length[X[i]] >= Y[i]) continue; if(X[i] != 0 && length[X[i]-1] >= Y[i])ans += W[i]; if(X[i] != N-1 && length[X[i]+1] >= Y[i])ans += W[i]; } return ans; }
#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...