Submission #1234672

#TimeUsernameProblemLanguageResultExecution timeMemory
1234672MuhammadSaram메기 농장 (IOI22_fish)C++20
3 / 100
98 ms8992 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; #define ll long long long long max_weights(int n, int m, vector<int> x, vector<int> y,vector<int> w) { int o=0; ll ans=0,pre[n+1][2]={}; for (int i=0;i<m;i++) o+=x[i]%2,ans+=w[i],pre[y[i]+1][x[i]%2]=w[i]; if (!o) return ans; for (int i=0;i<=1;i++) for (int j=1;j<=n;j++) pre[j][i]+=pre[j-1][i]; if (n==2) return max(pre[n][0],pre[n][1]); for (int i=0;i<=n;i++) ans=max(ans,pre[n][1]-pre[i][1]+max(pre[i][0],pre[i][1])); 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...