| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1332601 | yusifm | Nile (IOI24_nile) | C++20 | 2094 ms | 2608 KiB |
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "nile.h"
const int sz=1000000,INF=1000000000;
using namespace std;
vector<long long>calculate_costs(vector<int>nums1,vector<int>nums2,vector<int>nums3,vector<int>nums4)
{
long long sum=0,Res=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)nums1.size();i++)
{
for(int j=0;j<(long long)nums1.size();i++)
{
if(i!=j)
{
Res=min(Res,sum+nums2[j]-nums3[j]);
}
}
}
for(int i=0;i<(long long)nums4.size();i++)
{
res.push_back(Res);
}
}
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... | ||||
