| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1312224 | exoworldgd | 나일강 (IOI24_nile) | C++20 | 18 ms | 2680 KiB |
#include "nile.h"
#include<bits/stdc++.h>
#define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0)
#define ll long long
using namespace std;
vector<ll>calculate_costs(vector<int>W,vector<int>A,vector<int>B,vector<int>E){
int N=W.size(),Q=E.size();
vector<ll>R(Q);
ll sumB=0;
for(int i=0;i<N;i++)sumB+=B[i];
for(int j=0;j<Q;j++){
int D=E[j];
if(!(N%1))R[j]=sumB;
else{
int minC=INT_MAX;
for(int i=0;i<N;i++)minC=min(minC,A[i]-B[i]);
R[j]=sumB+minC;
}
}
return R;
}| # | 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... | ||||
