Submission #1332626

#TimeUsernameProblemLanguageResultExecution timeMemory
1332626yus1f_mNile (IOI24_nile)C++20
13 / 100
19 ms2608 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,maxNum1=-INF,maxNum2=-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++)
        {
            maxNum1=max(maxNum1,(long long)(nums3[i]-nums2[i]));
            if(i%2==0)
            {
                maxNum2=max(maxNum2,(long long)(nums3[i]-nums2[i]));
            }
        }
        for(int i=0;i<(long long)nums4.size();i++)
        {
            if(nums4[i]>=2)
            {
                res.push_back(sum-maxNum1);
            }
            else
            {
                res.push_back(sum-maxNum2);
            }
        }
    }
    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...