oj.uz

Submission #1047079

# Submission time Handle Problem Language Result Execution time Memory
1047079 2024-08-07T08:39:33 Z vjudge1 Sky Walking (IOI19_walk) C++17
33 / 100
 683 ms 122472 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,abs(c)});
    adj[b].push_back({a,abs(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;
            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;
            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++)
        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++){
        intersection[i].insert(r[i]);
        intersection[i].erase(l[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 42584 KB Output is correct
2 Correct 5 ms 42588 KB Output is correct
3 Correct 5 ms 42464 KB Output is correct
4 Correct 5 ms 42644 KB Output is correct
5 Incorrect 5 ms 42548 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 42588 KB Output is correct
2 Correct 6 ms 42640 KB Output is correct
3 Runtime error 139 ms 122472 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 53960 KB Output is correct
2 Correct 651 ms 111044 KB Output is correct
3 Correct 574 ms 111096 KB Output is correct
4 Correct 545 ms 108228 KB Output is correct
5 Correct 608 ms 110532 KB Output is correct
6 Correct 594 ms 105664 KB Output is correct
7 Correct 203 ms 74972 KB Output is correct
8 Correct 136 ms 68448 KB Output is correct
9 Correct 578 ms 100792 KB Output is correct
10 Correct 283 ms 73920 KB Output is correct
11 Correct 11 ms 43416 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 53960 KB Output is correct
2 Correct 651 ms 111044 KB Output is correct
3 Correct 574 ms 111096 KB Output is correct
4 Correct 545 ms 108228 KB Output is correct
5 Correct 608 ms 110532 KB Output is correct
6 Correct 594 ms 105664 KB Output is correct
7 Correct 203 ms 74972 KB Output is correct
8 Correct 136 ms 68448 KB Output is correct
9 Correct 578 ms 100792 KB Output is correct
10 Correct 283 ms 73920 KB Output is correct
11 Correct 11 ms 43416 KB Output is correct
12 Correct 601 ms 111364 KB Output is correct
13 Correct 506 ms 109508 KB Output is correct
14 Correct 683 ms 113436 KB Output is correct
15 Correct 396 ms 99008 KB Output is correct
16 Correct 451 ms 98244 KB Output is correct
17 Correct 512 ms 109848 KB Output is correct
18 Correct 402 ms 99008 KB Output is correct
19 Correct 461 ms 98240 KB Output is correct
20 Correct 311 ms 76996 KB Output is correct
21 Correct 82 ms 49312 KB Output is correct
22 Correct 349 ms 95684 KB Output is correct
23 Correct 313 ms 92860 KB Output is correct
24 Correct 217 ms 78700 KB Output is correct
25 Correct 288 ms 88848 KB Output is correct
26 Correct 169 ms 70084 KB Output is correct
27 Correct 672 ms 112068 KB Output is correct
28 Correct 460 ms 108992 KB Output is correct
29 Correct 640 ms 106016 KB Output is correct
30 Correct 287 ms 78020 KB Output is correct
31 Correct 627 ms 103616 KB Output is correct
32 Correct 213 ms 72632 KB Output is correct
33 Correct 196 ms 71108 KB Output is correct
34 Correct 290 ms 77756 KB Output is correct
35 Correct 262 ms 79780 KB Output is correct
36 Correct 183 ms 73952 KB Output is correct
37 Correct 139 ms 70948 KB Output is correct
38 Correct 141 ms 68508 KB Output is correct
39 Correct 333 ms 82324 KB Output is correct
40 Correct 152 ms 70620 KB Output is correct
41 Correct 161 ms 70952 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 42584 KB Output is correct
2 Correct 5 ms 42588 KB Output is correct
3 Correct 5 ms 42464 KB Output is correct
4 Correct 5 ms 42644 KB Output is correct
5 Incorrect 5 ms 42548 KB Output isn't correct
6 Halted 0 ms 0 KB -