Submission #1242306

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242306		Geforgs	Marathon Race 2 (JOI24_ho_t3)	C++20	0 / 100	0 ms	320 KiB

Main

#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;

void solve(){
    ll n, q, l, r, i, x, y, time, res, x1, x2, dis, pos;
    cin>>n>>l;
    vector<ll> a(n);
    for(i=0;i<n;++i){
        cin>>a[i];
    }
    sort(a);
    vector<vector<vector<ll>>> dp(n, vector<vector<ll>>(n, vector<ll>(2, inf)));
    dp[0][n-1][1] = 0;
    set<pair<ll, pair<pair<ll, ll>, ll>>> s;
    s.insert({0, {{0, n-1}, 1}});
    while(!s.empty()){
        auto el = *s.begin();
        s.erase(el);
        if(el.second.first.first != el.second.first.second){
            dis = el.first;
            x1 = el.second.first.first;
            x2 = el.second.first.second;
            if(el.second.second){
                if(dp[x1][x2-1][1] > dis + abs(a[x2] - a[x2-1])*(n - x2 + x1 + 1)){
                    s.erase({dp[x1][x2-1][1], {{x1, x2-1}, 1}});
                    dp[x1][x2-1][1] = dis + abs(a[x2] - a[x2-1])*(n - x2 + x1 + 1);
                    s.insert({dp[x1][x2-1][1], {{x1, x2-1}, 1}});
                }
                if(dp[x1][x2-1][0] > dis + abs(a[x2] - a[x1])*(n - x2 + x1 + 1)){
                    s.erase({dp[x1][x2-1][0], {{x1, x2-1}, 0}});
                    dp[x1][x2-1][0] = dis + abs(a[x2] - a[x1])*(n - x2 + x1 + 1);
                    s.insert({dp[x1][x2-1][0], {{x1, x2-1}, 0}});
                }
            }else{
                if(dp[x1+1][x2][1] > dis + abs(a[x2] - a[x1])*(n - x2 + x1 + 1)){
                    s.erase({dp[x1+1][x2][1], {{x1+1, x2}, 1}});
                    dp[x1+1][x2][1] = dis + abs(a[x2] - a[x1])*(n - x2 + x1 + 1);
                    s.insert({dp[x1+1][x2][1], {{x1+1, x2}, 1}});
                }
                if(dp[x1+1][x2][0] > dis + abs(a[x1 + 1] - a[x1])*(n - x2 + x1 + 1)){
                    s.erase({dp[x1+1][x2][0], {{x1+1, x2}, 0}});
                    dp[x1+1][x2][0] = dis + abs(a[x1 + 1] - a[x1])*(n - x2 + x1 + 1);
                    s.insert({dp[x1+1][x2][0], {{x1+1, x2}, 0}});
                }
            }
        }
    }
    vector<vector<vector<ll>>> dp2(n, vector<vector<ll>>(n, vector<ll>(2, inf)));
    swap(dp, dp2);
    dp[0][n-1][0] = 0;
    s.insert({0, {{0, n-1}, 0}});
    while(!s.empty()){
        auto el = *s.begin();
        s.erase(el);
        if(el.second.first.first != el.second.first.second){
            dis = el.first;
            x1 = el.second.first.first;
            x2 = el.second.first.second;
            if(el.second.second){
                if(dp[x1][x2-1][1] > dis + abs(a[x2] - a[x2-1])*(n - x2 + x1 + 1)){
                    s.erase({dp[x1][x2-1][1], {{x1, x2-1}, 1}});
                    dp[x1][x2-1][1] = dis + abs(a[x2] - a[x2-1])*(n - x2 + x1 + 1);
                    s.insert({dp[x1][x2-1][1], {{x1, x2-1}, 1}});
                }
                if(dp[x1][x2-1][0] > dis + abs(a[x2] - a[x1])*(n - x2 + x1 + 1)){
                    s.erase({dp[x1][x2-1][0], {{x1, x2-1}, 0}});
                    dp[x1][x2-1][0] = dis + abs(a[x2] - a[x1])*(n - x2 + x1 + 1);
                    s.insert({dp[x1][x2-1][0], {{x1, x2-1}, 0}});
                }
            }else{
                if(dp[x1+1][x2][1] > dis + abs(a[x2] - a[x1])*(n - x2 + x1 + 1)){
                    s.erase({dp[x1+1][x2][1], {{x1+1, x2}, 1}});
                    dp[x1+1][x2][1] = dis + abs(a[x2] - a[x1])*(n - x2 + x1 + 1);
                    s.insert({dp[x1+1][x2][1], {{x1+1, x2}, 1}});
                }
                if(dp[x1+1][x2][0] > dis + abs(a[x1 + 1] - a[x1])*(n - x2 + x1 + 1)){
                    s.erase({dp[x1+1][x2][0], {{x1+1, x2}, 0}});
                    dp[x1+1][x2][0] = dis + abs(a[x1 + 1] - a[x1])*(n - x2 + x1 + 1);
                    s.insert({dp[x1+1][x2][0], {{x1+1, x2}, 0}});
                }
            }
        }
    }
    vector<ll> c1(n);
    vector<ll> c2(n);
    vector<ll> d1(n);
    vector<ll> d2(n);
    d1[0] = min(dp[0][0][0], dp[0][0][1]) + -a[0]*(n+1);
    d2[0] = min(dp2[0][0][0], dp2[0][0][1]) + -a[0]*(n+1);
    for(i=1;i<n;++i){
        d1[i] = min(d1[i-1], min(dp[i][i][0], dp[i][i][1]) + -a[i]*(n+1));
        d2[i] = min(d2[i-1], min(dp2[i][i][0], dp2[i][i][1]) + -a[i]*(n+1));
    }
    c1[n-1] = min(dp[n-1][n-1][0], dp[n-1][n-1][1]) + a[n-1]*(n+1);
    for(i=n-2;i>=0;--i){
        c1[i] = min(c1[i+1], min(dp[i][i][0], dp[i][i][1]) + a[i]*(n+1));
        c2[i] = min(c2[i+1], min(dp2[i][i][0], dp2[i][i][1]) + a[i]*(n+1));
    }
    cin>>q;
    for(i=0;i<q;++i){
        cin>>x>>y>>time;
        res = inf;
        pos = lower_bound(a.begin(), a.end(), y) - a.begin();
        if(pos < n){
            res = min(res, c1[pos] - y*(n+1) + abs(x - a[0]));
            res = min(res, c2[pos] - y*(n+1) + abs(x - a.back()));
        }
        --pos;
        if(pos >= 0){
            res = min(res, d1[pos] + y*(n+1) + abs(x - a[0]));
            res = min(res, d2[pos] + y*(n+1) + abs(x - a.back()));
        }
        res += n;
        if(res <= time){
            cout<<"Yes"<<endl;
        }else{
            cout<<"No"<<endl;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    srand(time(nullptr));
    ll t=1;
//    cin>>t;
    for(;t>0;--t){
        solve();
    }
    return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 7
• Subtask 3: 0 / 10
• Subtask 4: 0 / 28
• Subtask 5: 0 / 10
• Subtask 6: 0 / 19
• Subtask 7: 0 / 19