oj.uz

답안 #416323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
416323 2021-06-02T10:19:11 Z idk321 Sky Walking (IOI19_walk) C++17
10 / 100
 4000 ms 1048580 KB 
#include "walk.h"

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;


const int M = 2000005;
const int N = 100005;
const ll INF = 2000000000000000000LL;
vector<array<int, 2>> adj[M];
vector<array<int, 2>> isAt[N];

int cnode = 0;


///usr/include/c++/10/bits/stl_heap.h|209|error: ‘bool Comparator::operator()(const std::__debug::array<long long int, 2>&, const std::__debug::array<long long int, 2>&) const’ is private within this context|

struct Comparator
{

    bool operator() (const array<ll, 2>& ar1, const array<ll, 2>& ar2) const
    {
        return tie(ar1[1], ar1[0]) > tie(ar2[1], ar2[0]);
    }
};

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) {

    int snode = -1;
    int gnode = -1;
    for (int i = 0; i < x.size(); i++)
    {
        isAt[i].push_back({cnode, 0});
        if (i == s)
        {
            snode = cnode;
        }
        if (i == g)
        {
            gnode = cnode;
        }
        cnode++;
    }



    vector<array<int, 2>> byHeight;
    for (int i = 0; i < l.size(); i++)
    {
        byHeight.push_back({y[i], i});
    }
    sort(byHeight.begin(), byHeight.end());

    set<int> ok;

    for (int i = 0; i < x.size(); i++) ok.insert(i);

    for (int ci = 0; ci < l.size(); ci++)
    {
        int i = byHeight[ci][1];
        int prev = -1;
        for (auto it = ok.lower_bound(l[i]); it != ok.end() && *it <= r[i]; )
        {
            int j = *it;
            if (h[j] >= y[i])
            {
                for (auto ar : isAt[j])
                {
                    adj[cnode].push_back({ar[0], abs(ar[1] - y[i])});
                    adj[ar[0]].push_back({cnode, abs(ar[1] - y[i])});
                }

                isAt[j].push_back({cnode, y[i]});
                if (prev != -1)
                {
                    adj[cnode].push_back({cnode - 1, x[j] - x[prev]});
                    adj[cnode - 1].push_back({cnode, x[j] - x[prev]});
                }
                prev = j;
                cnode++;
                it++;
            } else
            {
                it = ok.erase(it);
            }
        }
    }

    priority_queue<array<ll, 2>, vector<array<ll, 2>>, Comparator> pq;

    pq.push({snode, 0});

    vector<ll> dist(M, INF);
    while (!pq.empty())
    {
        auto cur = pq.top();
        pq.pop();
        if (dist[cur[0]] != INF) continue;
        dist[cur[0]] = cur[1];



        for (auto next : adj[cur[0]])
        {
            if (dist[next[0]] == INF)
            {

                pq.push({next[0], next[1] + cur[1]});
            }
        }
    }



    if (dist[gnode] == INF) return -1;
	return dist[gnode];
}

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:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i = 0; i < x.size(); i++)
      |                     ~~^~~~~~~~~~
walk.cpp:49:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for (int i = 0; i < l.size(); i++)
      |                     ~~^~~~~~~~~~
walk.cpp:57:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |     for (int i = 0; i < x.size(); i++) ok.insert(i);
      |                     ~~^~~~~~~~~~
walk.cpp:59:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     for (int ci = 0; ci < l.size(); ci++)
      |                      ~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 65220 KB Output is correct
2 Correct 39 ms 65144 KB Output is correct
3 Correct 37 ms 65192 KB Output is correct
4 Correct 36 ms 65220 KB Output is correct
5 Correct 39 ms 65420 KB Output is correct
6 Correct 38 ms 65356 KB Output is correct
7 Correct 38 ms 65324 KB Output is correct
8 Correct 37 ms 65356 KB Output is correct
9 Correct 36 ms 65264 KB Output is correct
10 Correct 38 ms 65508 KB Output is correct
11 Correct 36 ms 65228 KB Output is correct
12 Correct 36 ms 65168 KB Output is correct
13 Correct 37 ms 65248 KB Output is correct
14 Correct 37 ms 65204 KB Output is correct
15 Correct 37 ms 65144 KB Output is correct
16 Correct 38 ms 65224 KB Output is correct
17 Correct 38 ms 65576 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 65252 KB Output is correct
2 Correct 36 ms 65232 KB Output is correct
3 Execution timed out 4123 ms 771192 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 281 ms 86568 KB Output is correct
2 Runtime error 3276 ms 1048580 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 281 ms 86568 KB Output is correct
2 Runtime error 3276 ms 1048580 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 65220 KB Output is correct
2 Correct 39 ms 65144 KB Output is correct
3 Correct 37 ms 65192 KB Output is correct
4 Correct 36 ms 65220 KB Output is correct
5 Correct 39 ms 65420 KB Output is correct
6 Correct 38 ms 65356 KB Output is correct
7 Correct 38 ms 65324 KB Output is correct
8 Correct 37 ms 65356 KB Output is correct
9 Correct 36 ms 65264 KB Output is correct
10 Correct 38 ms 65508 KB Output is correct
11 Correct 36 ms 65228 KB Output is correct
12 Correct 36 ms 65168 KB Output is correct
13 Correct 37 ms 65248 KB Output is correct
14 Correct 37 ms 65204 KB Output is correct
15 Correct 37 ms 65144 KB Output is correct
16 Correct 38 ms 65224 KB Output is correct
17 Correct 38 ms 65576 KB Output is correct
18 Correct 37 ms 65252 KB Output is correct
19 Correct 36 ms 65232 KB Output is correct
20 Execution timed out 4123 ms 771192 KB Time limit exceeded
21 Halted 0 ms 0 KB -