oj.uz

답안 #873681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873681 2023-11-15T13:09:48 Z andrei_boaca Sky Walking (IOI19_walk) C++17
10 / 100
 4000 ms 280428 KB 
#include "walk.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
const ll INF=1e18;
int n;
int ind;
unordered_map<int,int> f[100005];
vector<pii> muchii[1000005];
vector<pii> nodes[1000005];
ll dist[1000005];
void addnode(int x,int y)
{
    if(f[x][y]!=0)
        return;
    ind++;
    f[x][y]=ind;
    nodes[x].push_back({y,ind});
}
bool use[1000005];
void bfs()
{
    for(int i=1;i<=ind;i++)
        dist[i]=INF;
    dist[1]=0;
    priority_queue<pll,vector<pll>, greater<pll>> pq;
    pq.push({0,1});
    while(!pq.empty())
    {
        int nod=pq.top().second;
        pq.pop();
        if(use[nod])
            continue;
        use[nod]=1;
        for(auto i:muchii[nod])
            if(dist[i.first]>dist[nod]+i.second)
            {
                dist[i.first]=dist[nod]+i.second;
                pq.push({dist[i.first],i.first});
            }
    }
}
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)
{
    n=x.size();
    addnode(s,0);
    addnode(g,0);
    for(int i=0;i<l.size();i++)
    {
        int prv=-1;
        for(int j=l[i];j<=r[i];j++)
            if(y[i]<=h[j])
            {
                addnode(j,y[i]);
                if(prv!=-1)
                {
                    int a=f[prv][y[i]];
                    int b=f[j][y[i]];
                    muchii[a].push_back({b,x[j]-x[prv]});
                    muchii[b].push_back({a,x[j]-x[prv]});
                }
                prv=j;
            }
    }
    for(int i=0;i<n;i++)
        if(!nodes[i].empty())
        {
            sort(nodes[i].begin(),nodes[i].end());
            for(int j=1;j<nodes[i].size();j++)
            {
                ll d=nodes[i][j].first-nodes[i][j-1].first;
                ll a=nodes[i][j].second;
                ll b=nodes[i][j-1].second;
                muchii[a].push_back({b,d});
                muchii[b].push_back({a,d});
            }
        }
    bfs();
    if(dist[2]==INF)
        return -1;
    return dist[2];
}

Compilation message

walk.cpp: In function 'long long int min_distance(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:54:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i=0;i<l.size();i++)
      |                 ~^~~~~~~~~
walk.cpp:75:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |             for(int j=1;j<nodes[i].size();j++)
      |                         ~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 55132 KB Output is correct
2 Correct 12 ms 55132 KB Output is correct
3 Correct 13 ms 55132 KB Output is correct
4 Correct 12 ms 55132 KB Output is correct
5 Correct 12 ms 55384 KB Output is correct
6 Correct 13 ms 55384 KB Output is correct
7 Correct 12 ms 55388 KB Output is correct
8 Correct 12 ms 55344 KB Output is correct
9 Correct 12 ms 55388 KB Output is correct
10 Correct 13 ms 55264 KB Output is correct
11 Correct 15 ms 55388 KB Output is correct
12 Correct 13 ms 55384 KB Output is correct
13 Correct 12 ms 55128 KB Output is correct
14 Correct 12 ms 55220 KB Output is correct
15 Correct 12 ms 55388 KB Output is correct
16 Correct 12 ms 55304 KB Output is correct
17 Correct 13 ms 55388 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 55132 KB Output is correct
2 Correct 12 ms 55132 KB Output is correct
3 Correct 768 ms 153424 KB Output is correct
4 Correct 591 ms 153388 KB Output is correct
5 Correct 402 ms 139796 KB Output is correct
6 Correct 835 ms 130644 KB Output is correct
7 Correct 371 ms 139856 KB Output is correct
8 Correct 1070 ms 178496 KB Output is correct
9 Correct 489 ms 138832 KB Output is correct
10 Correct 901 ms 193108 KB Output is correct
11 Correct 312 ms 102904 KB Output is correct
12 Correct 221 ms 87936 KB Output is correct
13 Correct 712 ms 175448 KB Output is correct
14 Correct 2552 ms 88032 KB Output is correct
15 Correct 1436 ms 88016 KB Output is correct
16 Correct 252 ms 90128 KB Output is correct
17 Correct 277 ms 88912 KB Output is correct
18 Execution timed out 4067 ms 64736 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 64080 KB Output is correct
2 Runtime error 462 ms 280428 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 64080 KB Output is correct
2 Runtime error 462 ms 280428 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 55132 KB Output is correct
2 Correct 12 ms 55132 KB Output is correct
3 Correct 13 ms 55132 KB Output is correct
4 Correct 12 ms 55132 KB Output is correct
5 Correct 12 ms 55384 KB Output is correct
6 Correct 13 ms 55384 KB Output is correct
7 Correct 12 ms 55388 KB Output is correct
8 Correct 12 ms 55344 KB Output is correct
9 Correct 12 ms 55388 KB Output is correct
10 Correct 13 ms 55264 KB Output is correct
11 Correct 15 ms 55388 KB Output is correct
12 Correct 13 ms 55384 KB Output is correct
13 Correct 12 ms 55128 KB Output is correct
14 Correct 12 ms 55220 KB Output is correct
15 Correct 12 ms 55388 KB Output is correct
16 Correct 12 ms 55304 KB Output is correct
17 Correct 13 ms 55388 KB Output is correct
18 Correct 14 ms 55132 KB Output is correct
19 Correct 12 ms 55132 KB Output is correct
20 Correct 768 ms 153424 KB Output is correct
21 Correct 591 ms 153388 KB Output is correct
22 Correct 402 ms 139796 KB Output is correct
23 Correct 835 ms 130644 KB Output is correct
24 Correct 371 ms 139856 KB Output is correct
25 Correct 1070 ms 178496 KB Output is correct
26 Correct 489 ms 138832 KB Output is correct
27 Correct 901 ms 193108 KB Output is correct
28 Correct 312 ms 102904 KB Output is correct
29 Correct 221 ms 87936 KB Output is correct
30 Correct 712 ms 175448 KB Output is correct
31 Correct 2552 ms 88032 KB Output is correct
32 Correct 1436 ms 88016 KB Output is correct
33 Correct 252 ms 90128 KB Output is correct
34 Correct 277 ms 88912 KB Output is correct
35 Execution timed out 4067 ms 64736 KB Time limit exceeded
36 Halted 0 ms 0 KB -