Submission #1332672

#TimeUsernameProblemLanguageResultExecution timeMemory
1332672yusifmNile (IOI24_nile)C++20
0 / 100
2095 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 cnt;
    vector<long long>res;
    sort(nums1.begin(),nums1.end());
    for(int i=0;i<nums4.size();i++)
    {
        cnt=0;
        for(int j=0;j<nums1.size()-1;i++)
        {
            if(abs(nums1[j]-nums1[j+1])<=nums4[i])
            {
                cnt+=2,i++;
            }
        }
        res.push_back(2*nums1.size()-cnt);
    }
    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...