| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1332619 | yus1f_m | Nile (IOI24_nile) | C++20 | 18 ms | 2608 KiB |
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "nile.h"
const long long sz=1000000,INF=1000000000000000000;
using namespace std;
vector<long long>calculate_costs(vector<int>nums1,vector<int>nums2,vector<int>nums3,vector<int>nums4)
{
long long sum=0,maxNum=-INF;
vector<long long>res;
for(int i=0;i<(long long)nums3.size();i++)
{
sum+=nums3[i];
}
if((long long)nums1.size()%2==0)
{
for(int i=0;i<(long long)nums4.size();i++)
{
res.push_back(sum);
}
}
else
{
for(int i=0;i<(long long)nums2.size();i++)
{
maxNum=max(maxNum,(long long)(nums3[i]-nums2[i]));
}
for(int i=0;i<(long long)nums4.size();i++)
{
if(nums4[i]>=2)
{
res.push_back(sum-maxNum);
}
else
{
res.push_back(sum-max(nums3[0]-nums2[0],nums3[nums3.size()-1]-nums2[nums2.size()-1]));
}
}
}
return res;
}| # | 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... | ||||
