oj.uz

Submission #1047082

# Submission time Handle Problem Language Result Execution time Memory
1047082 2024-08-07T08:42:32 Z vjudge1 Sky Walking (IOI19_walk) C++17
33 / 100
 720 ms 113564 KB 
#include "walk.h"
#include<bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
map<int,int>pos[100100];
vector<pair<int,int>> adj[1<<20];
int CC;
void AE(int a,int b,int c){
    adj[a].push_back({b,c});
    adj[b].push_back({a,c});
}
int whatpos(int i,int j){
    if(pos[i].count(j))
        return pos[i][j];
    pos[i][j]=++CC;
    auto it=pos[i].find(j);
    if(it!=pos[i].begin())
        AE(prev(it)->second,CC,it->first-prev(it)->first);
    if(next(it)!=pos[i].end())
        AE(next(it)->second,CC,next(it)->first-it->first);
    return CC;
}
long long dis[1<<20];
long long djik(int a,int b){
    memset(dis,9,sizeof dis);
    priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<>> pq;
    pq.push({0,a});
    dis[a]=0;
    while(pq.size()){
        auto[d,x]=pq.top();
        pq.pop();
        if(d-dis[x])continue;
        for(auto[v,w]:adj[x])
            if(dis[v]>d+w)
                pq.push({dis[v]=d+w,v});
    }
    return dis[b]<dis[0]?dis[b]:-1;
}
set<int>intersection[100100];
map<int,int>lft,rt;
void makestuf(vector<int>h,int pos){
    lft.clear();
    rt.clear();
    int n=h.size();
    for(int i=0;i<=pos;i++)
        lft[h[i]]=max(lft[h[i]],i);
    for(int i=pos;i<n;i++)
        if(rt.count(h[i]))
            rt[h[i]]=min(rt[h[i]],i);
        else rt[h[i]]=i;
    auto it=lft.end();
    while(--it!=lft.begin())
        if(it->second>=prev(it)->second)
            it=lft.erase(prev(it));
    it=rt.end();
    while(--it!=rt.begin())
        if(it->second<=prev(it)->second)
            it=rt.erase(prev(it));
}
long long min_distance(VI x,VI h,VI l,VI r,VI y,int s,int g) {
    int m=l.size();
    makestuf(h,s);
    for(int i=0;i<m;i++)
        if(l[i]<s&&r[i]>s) {
            int A=lft.lower_bound(y[i])->second;
            int B=rt.lower_bound(y[i])->second;
            assert(A>=l[i]);
            assert(B<=r[i]);
            if(A-l[i])
                l.push_back(l[i]),
                r.push_back(l[i]=A),
                y.push_back(y[i]);
            if(B-r[i])
                r.push_back(r[i]),
                l.push_back(r[i]=B),
                y.push_back(y[i]);
        }
    m=l.size();
    makestuf(h,g);
    for(int i=0;i<m;i++)
        if(l[i]<g&&r[i]>g) {
            int A=lft.lower_bound(y[i])->second;
            int B=rt.lower_bound(y[i])->second;
            assert(A>=l[i]);
            assert(B<=r[i]);
            if(A-l[i])
                l.push_back(l[i]),
                r.push_back(l[i]=A),
                y.push_back(y[i]);
            if(B-r[i])
                r.push_back(r[i]),
                l.push_back(r[i]=B),
                y.push_back(y[i]);
        }
    m=l.size();
    vector<pair<int,int>> endpts;
    for(int i=0;i<m;i++) if(l[i]-r[i])
        endpts.push_back({l[i],i}),
        endpts.push_back({r[i],i}),
        whatpos(l[i],y[i]),whatpos(r[i],y[i]);
    sort(endpts.begin(),endpts.end());
    set<pair<int,int>> active;
    for(auto[b,i]:endpts){
        int pos=y[i];
        if(active.lower_bound({pos,0})!=active.begin()){
            auto it=--active.lower_bound({pos,0});
            intersection[it->second].insert(b);
            whatpos(b,it->first);
        }
        if(active.count({pos,i}))
            active.erase({pos,i});
        else active.insert({pos,i});
    }
    for(int i=0;i<m;i++){
        if(l[i]==r[i])continue;
        intersection[i].erase(l[i]);
        intersection[i].insert(r[i]);
        int prvind=whatpos(l[i],y[i]),prvpos=x[l[i]];
        for(auto j:intersection[i])
            AE(prvind,whatpos(j,y[i]),x[j]-prvpos),
            prvind=whatpos(j,y[i]),prvpos=x[j];
    }
    return djik(whatpos(s,0),whatpos(g,0));
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 42588 KB Output is correct
2 Correct 5 ms 42588 KB Output is correct
3 Correct 6 ms 42588 KB Output is correct
4 Correct 7 ms 42588 KB Output is correct
5 Runtime error 28 ms 73564 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 42584 KB Output is correct
2 Correct 6 ms 42588 KB Output is correct
3 Runtime error 44 ms 79696 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 54012 KB Output is correct
2 Correct 674 ms 110912 KB Output is correct
3 Correct 590 ms 111064 KB Output is correct
4 Correct 563 ms 108280 KB Output is correct
5 Correct 602 ms 110532 KB Output is correct
6 Correct 617 ms 105764 KB Output is correct
7 Correct 212 ms 74788 KB Output is correct
8 Correct 132 ms 68472 KB Output is correct
9 Correct 590 ms 100580 KB Output is correct
10 Correct 304 ms 73920 KB Output is correct
11 Correct 11 ms 43412 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 54012 KB Output is correct
2 Correct 674 ms 110912 KB Output is correct
3 Correct 590 ms 111064 KB Output is correct
4 Correct 563 ms 108280 KB Output is correct
5 Correct 602 ms 110532 KB Output is correct
6 Correct 617 ms 105764 KB Output is correct
7 Correct 212 ms 74788 KB Output is correct
8 Correct 132 ms 68472 KB Output is correct
9 Correct 590 ms 100580 KB Output is correct
10 Correct 304 ms 73920 KB Output is correct
11 Correct 11 ms 43412 KB Output is correct
12 Correct 593 ms 111276 KB Output is correct
13 Correct 516 ms 109504 KB Output is correct
14 Correct 686 ms 113564 KB Output is correct
15 Correct 408 ms 99092 KB Output is correct
16 Correct 451 ms 98500 KB Output is correct
17 Correct 522 ms 110016 KB Output is correct
18 Correct 412 ms 99008 KB Output is correct
19 Correct 450 ms 98340 KB Output is correct
20 Correct 290 ms 76920 KB Output is correct
21 Correct 93 ms 49096 KB Output is correct
22 Correct 354 ms 95940 KB Output is correct
23 Correct 305 ms 92692 KB Output is correct
24 Correct 222 ms 78528 KB Output is correct
25 Correct 294 ms 88868 KB Output is correct
26 Correct 174 ms 70088 KB Output is correct
27 Correct 720 ms 112068 KB Output is correct
28 Correct 466 ms 108996 KB Output is correct
29 Correct 635 ms 105932 KB Output is correct
30 Correct 294 ms 78020 KB Output is correct
31 Correct 645 ms 103612 KB Output is correct
32 Correct 201 ms 72336 KB Output is correct
33 Correct 198 ms 71168 KB Output is correct
34 Correct 343 ms 77676 KB Output is correct
35 Correct 266 ms 80020 KB Output is correct
36 Correct 176 ms 73956 KB Output is correct
37 Correct 139 ms 70948 KB Output is correct
38 Correct 162 ms 68284 KB Output is correct
39 Correct 348 ms 82460 KB Output is correct
40 Correct 165 ms 70560 KB Output is correct
41 Correct 201 ms 71096 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 42588 KB Output is correct
2 Correct 5 ms 42588 KB Output is correct
3 Correct 6 ms 42588 KB Output is correct
4 Correct 7 ms 42588 KB Output is correct
5 Runtime error 28 ms 73564 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -