oj.uz

Submission #1026839

# Submission time Handle Problem Language Result Execution time Memory
1026839 2024-07-18T12:16:02 Z hotboy2703 Sky Walking (IOI19_walk) C++17
33 / 100
 657 ms 150068 KB 
#include "walk.h"
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))
struct walk{
    ll l,r,y;
};
vector <walk> all;
const ll MAXN = 1e5 + 100;
const ll INF = 1e18;
vector <pll> g[MAXN*20];
ll dist[MAXN*20];
ll dijkstra(ll s,ll t){
    memset(dist,0x3f,sizeof dist);
    dist[s] = 0;
    priority_queue <pll,vector <pll> ,greater <> > q;
    q.push(MP(dist[s],s));
    while (!q.empty()){
        auto u = q.top().se;
        ll val = q.top().fi;
        q.pop();
        if (dist[u] != val)continue;
        for (auto tmp:g[u]){
            ll v = tmp.fi,w = tmp.se;
            if (dist[u] + w < dist[v]){
                dist[v] = dist[u] + w;
                q.push(MP(dist[v],v));
            }
        }
    }
    if (dist[t] >=INF)dist[t] = -1;
    return dist[t];
}
ll SUSSYBAKA;
struct point{
    ll x,y,id;
    point(ll x1=-1,ll y1=-1):x(x1),y(y1),id(x1==-1?-1:SUSSYBAKA++){
    }
    bool operator < (const point &p)const {
        return MP(x,y)<MP(p.x,p.y);
    }
    bool operator == (const point &p)const {
        return MP(x,y)==MP(p.x,p.y);
    }
};
vector <point> vertices;
long long min_distance(std::vector<int> X, std::vector<int> h, std::vector<int> l, std::vector<int> r, std::vector<int> y, int S, int G){
    ll m = sz(l);
    ll n = sz(X);
    for (ll i = 0;i < m;i ++){
        all.push_back({l[i],r[i],y[i]});
    }
    sort(all.begin(),all.end(),[](walk a1,walk a2){return a1.y<a2.y;});
    vector <ll> order;
    order.resize(n);
    iota(order.begin(),order.end(),0);
    sort(order.begin(),order.end(),[&](ll x,ll y){return h[x] > h[y];});
    vertices.emplace_back(X[S],0);
    vertices.emplace_back(X[G],0);
    for (auto x:all){
        vertices.emplace_back(X[x.l],x.y);
        vertices.emplace_back(X[x.r],x.y);
    }
    auto add_vertex = [&](bool inv){
        vector <ll> bd;
        for (ll i = inv?n-1:0;inv?i>=0:i<n;inv?i--:i++){
//            cout<<i<<endl;
            if (sz(bd) && h[bd.back()] < h[i])bd.pop_back();
            bd.push_back(i);
            if (i==S||i==G){
                ll ptr = sz(bd)-1;
                for (auto x:all){
                    while (ptr>=0&&h[bd[ptr]] < x.y)ptr--;
                    if (ptr != -1 && x.l <= bd[ptr] && bd[ptr] <= x.r){
                        vertices.emplace_back(X[bd[ptr]],x.y);
                    }
                }
            }
        }
    };
    add_vertex(0);
    add_vertex(1);
//    return -1;
    vector <pair <pll,bool> > event;
    for (auto x:all){
        event.emplace_back(MP(X[x.l],x.y),1);
        event.emplace_back(MP(X[x.r]+1,x.y),0);
    }
    sort(event.begin(),event.end());
    sort(vertices.begin(),vertices.end());
    vertices.resize(unique(vertices.begin(),vertices.end())-vertices.begin());

    {
        ll ptr = 0;
        multiset <ll> ms;
        vector <pll> Tm;
        for (auto x:vertices){
            while (ptr<sz(event) && event[ptr].fi.fi <= x.x){
                if (event[ptr].se)ms.insert(event[ptr].fi.se);
                else ms.erase(ms.find((event[ptr].fi.se)));
                ptr++;
            }
            auto tmp = ms.upper_bound(x.y);
            if (tmp != ms.end())Tm.emplace_back(x.x,*(tmp));
            tmp = ms.lower_bound(x.y);
            if (tmp != ms.begin())Tm.emplace_back(x.x,*prev(tmp));
        }
        for (auto x:Tm)vertices.emplace_back(x.fi,x.se);
    }
    sort(vertices.begin(),vertices.end());
    vertices.resize(unique(vertices.begin(),vertices.end())-vertices.begin());
    auto add_edge = [&](point a1,point a2){
        ll w = abs(a1.x-a2.x) + abs(a1.y-a2.y);
        g[a1.id].push_back(MP(a2.id,w));
        g[a2.id].push_back(MP(a1.id,w));
    };

    for (ll j = 0;j + 1 < sz(vertices);j ++){
        if (vertices[j].x == vertices[j+1].x)add_edge(vertices[j],vertices[j+1]);
    }
    auto cmp_y = [](point a1,point a2){return MP(a1.y,a1.x) < MP(a2.y,a2.x);};
    sort(vertices.begin(),vertices.end(),cmp_y);
    auto fi = [&](pll x){
        return lower_bound(vertices.begin(),vertices.end(),x,
                           [](point a1,pll val){return MP(a1.y,a1.x) < MP(val.se,val.fi);})-vertices.begin();
    };
    vector <ll> cnt(sz(vertices));
    for (auto x:all){
        cnt[fi(MP(X[x.l],x.y))] ++;
        cnt[fi(MP(X[x.r],x.y))] --;
    }
    for (ll i = 0;i < sz(vertices);i ++){
        if (i)cnt[i]+=cnt[i-1];
        if (cnt[i]){
            add_edge(vertices[i],vertices[i+1]);
        }
    }
    for (ll i = 0;i < sz(vertices);i ++){
        if (MP(vertices[i].x,vertices[i].y) == MP(ll(X[S]),0LL))S = vertices[i].id;
        if (MP(vertices[i].x,vertices[i].y) == MP(ll(X[G]),0LL))G = vertices[i].id;

    }
    return dijkstra(S,G);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 63068 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 63064 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 76248 KB Output is correct
2 Correct 475 ms 138040 KB Output is correct
3 Correct 509 ms 141844 KB Output is correct
4 Correct 604 ms 145788 KB Output is correct
5 Correct 646 ms 147804 KB Output is correct
6 Correct 582 ms 141828 KB Output is correct
7 Correct 266 ms 107200 KB Output is correct
8 Correct 230 ms 97808 KB Output is correct
9 Correct 530 ms 137904 KB Output is correct
10 Correct 247 ms 113072 KB Output is correct
11 Correct 19 ms 64324 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 76248 KB Output is correct
2 Correct 475 ms 138040 KB Output is correct
3 Correct 509 ms 141844 KB Output is correct
4 Correct 604 ms 145788 KB Output is correct
5 Correct 646 ms 147804 KB Output is correct
6 Correct 582 ms 141828 KB Output is correct
7 Correct 266 ms 107200 KB Output is correct
8 Correct 230 ms 97808 KB Output is correct
9 Correct 530 ms 137904 KB Output is correct
10 Correct 247 ms 113072 KB Output is correct
11 Correct 19 ms 64324 KB Output is correct
12 Correct 504 ms 142448 KB Output is correct
13 Correct 449 ms 145936 KB Output is correct
14 Correct 632 ms 150068 KB Output is correct
15 Correct 438 ms 127044 KB Output is correct
16 Correct 471 ms 134704 KB Output is correct
17 Correct 519 ms 146652 KB Output is correct
18 Correct 450 ms 127512 KB Output is correct
19 Correct 452 ms 133228 KB Output is correct
20 Correct 283 ms 104812 KB Output is correct
21 Correct 36 ms 66112 KB Output is correct
22 Correct 454 ms 130604 KB Output is correct
23 Correct 442 ms 127188 KB Output is correct
24 Correct 330 ms 114808 KB Output is correct
25 Correct 429 ms 124608 KB Output is correct
26 Correct 307 ms 113456 KB Output is correct
27 Correct 657 ms 148872 KB Output is correct
28 Correct 423 ms 145940 KB Output is correct
29 Correct 595 ms 143012 KB Output is correct
30 Correct 290 ms 106816 KB Output is correct
31 Correct 539 ms 138056 KB Output is correct
32 Correct 233 ms 107628 KB Output is correct
33 Correct 253 ms 112464 KB Output is correct
34 Correct 285 ms 115448 KB Output is correct
35 Correct 298 ms 118264 KB Output is correct
36 Correct 258 ms 106920 KB Output is correct
37 Correct 201 ms 104612 KB Output is correct
38 Correct 264 ms 114144 KB Output is correct
39 Correct 296 ms 120820 KB Output is correct
40 Correct 216 ms 111960 KB Output is correct
41 Correct 216 ms 104508 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 63068 KB Output isn't correct
2 Halted 0 ms 0 KB -