# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1227496 | shiocan | 나일강 (IOI24_nile) | C++20 | 17 ms | 2632 KiB |
#include <bits/stdc++.h>
#include <cstdlib>
#include <stdlib.h>
using namespace std;
#define ull unsigned long long
#define ld long double
#define ll long long
// #define int long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
int mod = 1e9 + 7;
// const int inf = 1e18;
const int N = 1e5 + 50, K = 22;
#include "nile.h"
vector<long long> calculate_costs(vector<int> w, vector<int> a, vector<int> b, vector<int> e){
int n = a.size();
int q = e.size();
vector<long long> ans(q);
int sum = 0;
for(auto i : b)
sum += i;
if(n % 2){
int mn = 1e18, idx = 0;
for(int i = 0; i < n; i++)
if(a[i] - b[i] < mn)
mn = a[i] - b[i], idx = i;
sum -= b[idx];
sum += a[idx];
}
for(int i = 0; i < q; i++)
ans[i] = sum;
return ans;
}
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |