제출 #1297161

#제출 시각아이디문제언어결과실행 시간메모리
12971611ota나일강 (IOI24_nile)C++20
6 / 100
19 ms3120 KiB
#include <bits/stdc++.h> #include "nile.h" using namespace std; #define ll long long #define pii pair<int, int> #define ff first #define ss second #define entire(x) (x).begin(), (x).end() vector<ll> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> qn){ int n = (ll) a.size(), q = (ll) qn.size(); vector<int> c(n); for (int i = 0; i < n; i++) c[i] = a[i] - b[i]; ll bsum = accumulate(entire(b), 0ll); ll minbad = *min_element(entire(c)); vector<ll> ans(q, bsum + (n % 2) * minbad); 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...