제출 #1245348

#제출 시각아이디문제언어결과실행 시간메모리
1245348CyberCow나일강 (IOI24_nile)C++20
6 / 100
17 ms2632 KiB
#include "nile.h" #include <bits/stdc++.h> using namespace std; using ll = long long; vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) { int Q = (int)E.size(); vector<long long> R(Q, 0); ll gum = 0, gg = 0; int mi = 1e9; for (int i = 0; i < A.size(); i++) { gum += B[i]; gg += A[i]; mi = min(mi, A[i] - B[i]); } for (int i = 0; i < Q; i++) { if(E[i] == 0) { R[i] = gg; } else { if(A.size() % 2 == 1) R[i] = gum + mi; else R[i] = gum; } } 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...