oj.uz

답안 #430048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430048 2021-06-16T11:11:06 Z rumen_m Sky Walking (IOI19_walk) C++17
10 / 100
 52 ms 6544 KB 
#include "walk.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5000;
vector <pair <int, int> > g[maxn];
vector <pair <int,int> > inter[maxn];
int ver;
long long dist[maxn];
bool vis[maxn];
priority_queue <pair <long long, int> > q;
long long dijkstra(int a, int b)
{
   // vis[a] = 1;
   for(int i=0;i<ver;i++)
    dist[i] = 1e18;
   dist[a] = 0;
    q.push({(long long)0, a});
    while(!q.empty())
    {
        int v = q.top().second;
        if(vis[v]||dist[v]!=-q.top().first){q.pop();continue;}
        q.pop();
        //cout<<v<<"->"<<dist[v]<<endl;
        vis[v] =1;
        if(v==b)return dist[v];
        for(auto u:g[v])
        {
            //cout<<u.first<<" "<<dist[v]+u.second<<endl;
            if(vis[u.first])continue;
            if(dist[u.first]>dist[v]+u.second)
            {
                dist[u.first]=dist[v]+u.second;
                q.push({-dist[u.first],u.first});
            }
        }
    }
    return -1;
}
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) {
	ver = x.size();
	int i,j;
	for(i=0;i<x.size();i++)
   {
          inter[i].push_back({0,i});
         // inter[i].push_back({h[i],i});
    }

//inter[s].push_back({0,s});
//inter[_g].push_back({0,_g});
    for(i=0;i<l.size();i++)
    {int prev = -1,id;
        for(j=l[i];j<=r[i];j++)
        {
            if(y[i]>h[j])continue;
            inter[j].push_back({y[i],ver});
            if(prev!=-1)
            {
                g[ver].push_back({prev,x[j]-x[id]});
                g[prev].push_back({ver,x[j]-x[id]});
            }
            prev = ver;
            id = j;
            ver++;
        }
    }
    for(i=0;i<x.size();i++)
    {
        sort(inter[i].begin(),inter[i].end());
        for(j=0;j<inter[i].size()-1;j++)
        {
            //cout<<i<<" :: "<<inter[i][j].first<<" "<<inter[i][j+1].first<<endl;
            g[inter[i][j].second].push_back({inter[i][j+1].second,inter[i][j+1].first-inter[i][j].first});
            g[inter[i][j+1].second].push_back({inter[i][j].second,inter[i][j+1].first-inter[i][j].first});
        }
    }
    //cout<<"OK"<<endl;
   return dijkstra(s,_g);
}

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:42:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |  for(i=0;i<x.size();i++)
      |          ~^~~~~~~~~
walk.cpp:50:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for(i=0;i<l.size();i++)
      |             ~^~~~~~~~~
walk.cpp:66:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(i=0;i<x.size();i++)
      |             ~^~~~~~~~~
walk.cpp:69:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for(j=0;j<inter[i].size()-1;j++)
      |                 ~^~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 588 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Runtime error 52 ms 6544 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 18 ms 4172 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 18 ms 4172 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Runtime error 52 ms 6544 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -