| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1337189 | aritro_ | 나일강 (IOI24_nile) | C++20 | 18 ms | 2608 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define pb push_back
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
vector<ll> calculate_costs(vector<int>w,vector<int>a,vector<int>b,vector<int>e){
int n=a.size();
int mn=0;
ll cost=0;
for(int i=0;i<n;i++){
//cout<<"HERE"<<endl;
if((a[mn]-b[mn])>(a[i]-b[i])){
mn=i;
//cout<<mn<<endl;
}
}
for(int i=0;i<n;i++) cost+=b[i];
if(n%2==1){
cost-=b[mn];
cost+=a[mn];
}
vector<ll> ans(e.size());
for(int i=0;i<e.size();i++) ans[i]=cost;
return ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
