제출 #1256919

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1256919		nerrrmin	나일강 (IOI24_nile)	C++20	17 / 100	2093 ms	6968 KiB

nile

#include "nile.h"
#define pb push_back
#include<bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int n, q;
long long w[maxn], a[maxn], b[maxn];

long long dp[maxn]; /// best match count
long long solve(int d)
{
    dp[0] = 0;
    for (int i = 1; i < n; ++ i)
    {
        int curr = 0;
        if(i > 0 && w[i] - w[i-1] <= d)curr ++;
        dp[i] = max(dp[i-1], dp[i-2] + curr);
    }
    long long taken = dp[n-1] * 2;
    long long single = n - dp[n-1] * 2;
    return (single * 2 + taken);
}
std::vector<long long> calculate_costs(std::vector<int> W, std::vector<int> A,
                                       std::vector<int> B, std::vector<int> E)
{
    n = W.size();
    for (int i = 0; i < n; ++ i)
        w[i] = W[i];
    for (int i = 0; i < n; ++ i)
        a[i] = A[i];
    for (int i = 0; i < n; ++ i)
        b[i] = B[i];

    sort(w, w+n);
    q = (int)E.size();
    vector < long long > res;
    for (auto d: E)
    {
        res.pb(solve(d));
    }
    return res;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 13
• Subtask 3: 17 / 17
• Subtask 4: 0 / 11
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15
• Subtask 7: 0 / 18