제출 #1199937

#제출 시각아이디문제언어결과실행 시간메모리
1199937fadyscubeCatfish Farm (IOI22_fish)C++17
0 / 100
82 ms11448 KiB
#include "fish.h" #include <vector> #include <algorithm> using namespace std; #define ll long long long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { ll can1 = 0; ll can2 = 0; for (int i = 0; i < M; i++) { if (X[i] == 0) can2 += W[i]; else can1 += W[i]; } if (N <= 2) { return max(can1, can2); } else { vector<pair<int, int>> v; for (int i = 0; i < M; i++) { v.push_back({Y[i], i}); } sort(v.begin(), v.end()); ll tmp = can1; for (int i = 0; i < M;) { int j = v[i].second; if (i+1 < M && v[i].first == v[i+1].first) { tmp += W[j]; tmp -= W[v[i+1].second]; i += 2; } else if (X[j] == 0) { tmp += W[j]; i++; } else { tmp -= W[j]; i++; } can1 = max(tmp, can1); } return can1; } }
#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...