제출 #1102278

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1102278		ro9669	나일강 (IOI24_nile)	C++17	0 / 100	25 ms	7508 KiB

nile

#include <bits/stdc++.h>
#define fi first
#define se second
#define all(v) v.begin() , v.end()
#define sz(v) int(v.size())
#define unq(v) sort(all(v)); v.resize(unique(all(v)) - v.begin());
//#include "nile.h"
using namespace std;

typedef long long ll;
typedef pair<int , int> ii;
typedef pair<long long , int> lli;

const int maxN = int(2e5)+7;

int n , q;
vector<int> w , a , b , e , id;

namespace sub1{
    bool check(){
        return n <= 2000;
    }

    vector<ll> res;
    ll dp[2007];

    vector<ll> calc(){
        sort(all(id) , [](int x , int y){
            return w[x] < w[y];
        });
        for (int d : e){
            dp[0] = 0;
            for (int i = 0 ; i < n ; i++){
                ll s = 0;
                int x = INT_MAX;
                dp[i + 1] = ll(1e18);
                for (int j = i ; j >= 0 ; j--){
                    s += b[id[j]];
                    x = min(x , a[id[j]] - b[id[j]]);
                    if (w[id[i]] - w[id[j]] <= d){
                        if ((i - j)&1){
                            dp[i + 1] = min(dp[i + 1] , dp[j] + s);
                        }
                        else{
                            dp[i + 1] = min(dp[i + 1] , dp[j] + s + 1ll * x);
                        }
                    }
                    else{
                        break;
                    }
                }
            }
            res.push_back(dp[n]);
        }
        return res;
    }
}

vector<long long> calculate_costs(vector<int> W , vector<int> A , vector<int> B , vector<int> E){
    w = W; a = A; b = B; e = E;
 	n = sz(w); q = sz(e);
    return sub1::calc();
}

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