제출 #1169490

#제출 시각아이디문제언어결과실행 시간메모리
1169490rayan_bdNile (IOI24_nile)C++20
6 / 100
18 ms2632 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const ll INF = 1e18+100; vector<ll> calculate_costs(vector<int> W,vector<int> A,vector<int> B,vector<int> E){ vector<ll> R; int N = A.size(),mn_a=0; ll tot=0,mn_cost=INF; for(int i=0;i<N;++i){ tot+=B[i]; } if(N&1^1) mn_cost=tot; else{ for(int i=0;i<N;++i){ mn_cost=min(mn_cost,tot-B[i]+A[i]); } } R.resize(E.size(),mn_cost); 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...