Submission #1031865

#TimeUsernameProblemLanguageResultExecution timeMemory
1031865Mr_HusanboyCatfish Farm (IOI22_fish)C++17
0 / 100
52 ms17988 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; #define ff first #define ss second #define all(a) (a).begin(), (a).end() #define ll long long template<typename T> int len(T &a){ return a.size(); } mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y, std::vector<int> w) { vector<vector<ll>> s(2, vector<ll>(n)); for(int i = 0; i < m; i++){ s[x[i]][y[i]] = w[i]; } for(int j = 0; j < 2; j ++) for(int i = 1; i < n; i++) s[j][i] += s[j][i - 1]; ll res = max(s[0][n - 1], s[1][n - 1]); assert(n != 2); if(n == 2) return res; for(int i = 1; i < n; i ++){ res = max(res, s[0][i] + s[1][n - 1] - s[1][i]); } return res; }
#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...