Submission #1289311

#TimeUsernameProblemLanguageResultExecution timeMemory
1289311kawhietNile (IOI24_nile)C++20
6 / 100
2095 ms2604 KiB
#include <bits/stdc++.h> #include "nile.h" using namespace std; vector<long long> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e) { int n = w.size(); int q = e.size(); vector<long long> ret; long long mn = 1e18; if (n % 2 == 0) { mn = accumulate(b.begin(), b.end(), 0LL); } else { for (int i = 0; i < n; i++) { long long x = a[i]; for (int j = 0; j < n; j++) { if (j == i) continue; x += b[j]; } mn = min(mn, x); } } ret.assign(q, mn); return ret; }
#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...