oj.uz

답안 #873690

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873690 2023-11-15T13:16:44 Z andrei_boaca Sky Walking (IOI19_walk) C++17
0 / 100
 846 ms 313928 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;
map<pii,int> f;
vector<pii> muchii[1000005];
vector<pii> nodes[1000005];
ll dist[1000005];
void addnode(int x,int y)
{
    if(f.count({x,y})!=0)
        return;
    ind++;
    f[{x,y}]=ind;
    nodes[x].push_back({y,ind});
}
bool use[1000005];
class Compare {
    public:
       bool operator()(int a, int b){
            return dist[a]<dist[b];
      }
};
void bfs()
{
    for(int i=1;i<=ind;i++)
        dist[i]=INF;
    dist[1]=0;
    priority_queue<int,vector<int>, Compare> pq;
    pq.push(1);
    while(!pq.empty())
    {
        int nod=pq.top();
        if(nod==2)
            return;
        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(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:62:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for(int i=0;i<l.size();i++)
      |                 ~^~~~~~~~~
walk.cpp:83: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]
   83 |             for(int j=1;j<nodes[i].size();j++)
      |                         ~^~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 49756 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 49860 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 59644 KB Output is correct
2 Runtime error 846 ms 313928 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 59644 KB Output is correct
2 Runtime error 846 ms 313928 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 49756 KB Output isn't correct
2 Halted 0 ms 0 KB -