제출 #1251067

#제출 시각아이디문제언어결과실행 시간메모리
1251067tamzidNile (IOI24_nile)C++20
6 / 100
20 ms2632 KiB
#include "nile.h" #include <bits/stdc++.h> using namespace std; using ll = long long; std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> a, std::vector<int> b, std::vector<int> E) { int n = (int)W.size(); int Q = (int)E.size(); std::vector<long long> R(Q, 0); ll s = 0; for(int i=0;i<n;++i) { s = s + (1LL * b[i]); } if(n % 2 == 0) { for(int i=0;i<Q;++i) R[i] = s; } else { ll c = 1e18; for(int i=0;i<n;++i) { c = min(c,1LL*(a[i] - b[i])); } s += c; for(int i=0;i<Q;++i) R[i] = s; } return R; }
#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...