oj.uz

답안 #209585

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
209585 2020-03-14T17:55:45 Z gratus907 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 248 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define usecppio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) ((x).begin()),((x).end())

#define int ll
using pii = pair <int, int>;
#define INF 0x7f7f7f7f7f7f7f7f
const bool debug = false;
const int MX = 30202;

struct Edge
{
    int dest, w;
    bool operator<(const Edge &p) const
    {
        return w > p.w;
    }
};

bool relax(Edge edge, int u, int dist[])
{
    bool flag = 0;
    int v = edge.dest, w = edge.w;
    if (dist[v] > dist[u] + w && (dist[u]!=INF))
    {
        flag = true;
        dist[v] = dist[u]+w;
    }
    return flag;
}

void dijkstra(int dist[], int start, vector<Edge> graph[])
{
    fill(dist,dist+MX,INF);
    dist[start] = 0;
    priority_queue<Edge> pq;
    pq.push({start,0});
    while(!pq.empty())
    {
        Edge x = pq.top();
        int v = x.dest, w = x.w;
        pq.pop();
        if (w>dist[v])
            continue;
        for (auto ed : graph[v])
            if (relax(ed, v, dist))
                pq.push({ed.dest,dist[ed.dest]});
    }
}

int n, m;
vector <int> bi(30303, 0), pi(30303, 0);
vector <Edge> G[30303];
bitset <30303> mark[30303];
vector <int> doge[30303];
int distances[30303];
bool visit[30303];
void print_graph()
{
    for (int i = 0; i<n; i++)
    {
        for (auto it:G[i])
            printf("From %lld to %lld, %lld\n",i, it.dest, it.w);
    }
}
queue<pii> q;
int32_t main()
{
    usecppio
    cin >> n >> m;
    for (int i = 0; i<m; i++)
    {
        cin >> bi[i] >> pi[i];
        if (!mark[bi[i]][pi[i]] && i!=1)
        {
            mark[bi[i]][pi[i]] = true;
            doge[bi[i]].push_back(pi[i]);
        }
    }
    visit[bi[0]] = true;
    for (auto it:doge[bi[0]])
    {
        q.push({it, bi[0]});
    }
    memset(distances, 0x7f, sizeof(distances));
    while (!q.empty())
    {
        auto dg = q.front();
        q.pop();
        for (int i = 1; ; i++)
        {
            int u = dg.second+i*dg.first;
            if (u >= n) break;
            G[dg.second].push_back({u, i});
            if (!visit[u])
            {
                visit[u] = true;
                for (auto unseen:doge[u])
                {
                    q.push({unseen, u});
                }
            }
        }
        for (int i = -1; ; i--)
        {
            int u = dg.second+i*dg.first;
            if (u < 0) break;
            G[dg.second].push_back({u, -i});
            if (!visit[u])
            {
                visit[u] = true;
                for (auto unseen:doge[u])
                {
                    q.push({unseen, u});
                }
            }
        }
    }
    //print_graph();
    dijkstra(distances,bi[0],G);
    if (distances[bi[1]] >= 10000000)
    {
        printf("-1");
    }
    else printf("%lld\n",distances[bi[1]]);

}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2424 KB Output is correct
2 Correct 6 ms 2424 KB Output is correct
3 Correct 6 ms 2424 KB Output is correct
4 Correct 6 ms 2424 KB Output is correct
5 Correct 7 ms 2424 KB Output is correct
6 Correct 6 ms 2552 KB Output is correct
7 Correct 6 ms 2552 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2424 KB Output is correct
2 Correct 7 ms 2424 KB Output is correct
3 Correct 9 ms 2424 KB Output is correct
4 Correct 6 ms 2424 KB Output is correct
5 Correct 6 ms 2424 KB Output is correct
6 Correct 6 ms 2552 KB Output is correct
7 Correct 6 ms 2424 KB Output is correct
8 Correct 6 ms 2552 KB Output is correct
9 Correct 6 ms 2552 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 7 ms 3064 KB Output is correct
12 Correct 6 ms 2552 KB Output is correct
13 Correct 7 ms 3064 KB Output is correct
14 Correct 10 ms 2808 KB Output is correct
15 Correct 6 ms 2808 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2424 KB Output is correct
2 Correct 6 ms 2424 KB Output is correct
3 Correct 6 ms 2424 KB Output is correct
4 Correct 7 ms 2424 KB Output is correct
5 Correct 6 ms 2424 KB Output is correct
6 Correct 6 ms 2424 KB Output is correct
7 Correct 6 ms 2552 KB Output is correct
8 Correct 6 ms 2552 KB Output is correct
9 Correct 6 ms 2552 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 16 ms 3064 KB Output is correct
12 Correct 6 ms 2552 KB Output is correct
13 Correct 6 ms 3064 KB Output is correct
14 Correct 6 ms 2808 KB Output is correct
15 Correct 7 ms 2808 KB Output is correct
16 Correct 6 ms 3192 KB Output is correct
17 Correct 9 ms 5624 KB Output is correct
18 Correct 8 ms 5496 KB Output is correct
19 Correct 8 ms 4472 KB Output is correct
20 Correct 90 ms 74232 KB Output is correct
21 Correct 7 ms 3960 KB Output is correct
22 Correct 7 ms 4856 KB Output is correct
23 Correct 8 ms 5496 KB Output is correct
24 Correct 11 ms 7416 KB Output is correct
25 Correct 10 ms 7544 KB Output is correct
26 Correct 7 ms 3064 KB Output is correct
27 Correct 7 ms 2936 KB Output is correct
28 Correct 13 ms 10384 KB Output is correct
29 Correct 9 ms 4088 KB Output is correct
30 Correct 8 ms 3192 KB Output is correct
31 Correct 8 ms 3576 KB Output is correct
32 Correct 7 ms 3320 KB Output is correct
33 Correct 10 ms 5108 KB Output is correct
34 Correct 11 ms 5108 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2552 KB Output is correct
2 Correct 6 ms 2424 KB Output is correct
3 Correct 6 ms 2424 KB Output is correct
4 Correct 6 ms 2424 KB Output is correct
5 Correct 6 ms 2424 KB Output is correct
6 Correct 6 ms 2424 KB Output is correct
7 Correct 6 ms 2552 KB Output is correct
8 Correct 6 ms 2552 KB Output is correct
9 Correct 6 ms 2552 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 7 ms 3064 KB Output is correct
12 Correct 6 ms 2552 KB Output is correct
13 Correct 7 ms 3064 KB Output is correct
14 Correct 6 ms 2808 KB Output is correct
15 Correct 6 ms 2808 KB Output is correct
16 Correct 7 ms 3192 KB Output is correct
17 Correct 9 ms 5624 KB Output is correct
18 Correct 8 ms 5496 KB Output is correct
19 Correct 7 ms 4472 KB Output is correct
20 Correct 87 ms 74232 KB Output is correct
21 Correct 7 ms 3960 KB Output is correct
22 Correct 8 ms 4856 KB Output is correct
23 Correct 9 ms 5496 KB Output is correct
24 Correct 11 ms 7416 KB Output is correct
25 Correct 10 ms 7544 KB Output is correct
26 Correct 7 ms 3064 KB Output is correct
27 Correct 7 ms 2936 KB Output is correct
28 Correct 13 ms 10360 KB Output is correct
29 Correct 9 ms 4220 KB Output is correct
30 Correct 7 ms 3192 KB Output is correct
31 Correct 8 ms 3576 KB Output is correct
32 Correct 7 ms 3320 KB Output is correct
33 Correct 10 ms 5236 KB Output is correct
34 Correct 11 ms 5108 KB Output is correct
35 Correct 21 ms 11384 KB Output is correct
36 Correct 11 ms 7032 KB Output is correct
37 Correct 25 ms 16376 KB Output is correct
38 Correct 27 ms 15480 KB Output is correct
39 Correct 27 ms 15736 KB Output is correct
40 Correct 26 ms 15480 KB Output is correct
41 Correct 26 ms 15352 KB Output is correct
42 Correct 10 ms 3320 KB Output is correct
43 Correct 10 ms 3064 KB Output is correct
44 Correct 92 ms 74360 KB Output is correct
45 Correct 20 ms 12276 KB Output is correct
46 Correct 21 ms 12280 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2424 KB Output is correct
2 Correct 6 ms 2424 KB Output is correct
3 Correct 6 ms 2424 KB Output is correct
4 Correct 6 ms 2424 KB Output is correct
5 Correct 6 ms 2424 KB Output is correct
6 Correct 6 ms 2424 KB Output is correct
7 Correct 6 ms 2424 KB Output is correct
8 Correct 6 ms 2552 KB Output is correct
9 Correct 6 ms 2552 KB Output is correct
10 Correct 7 ms 2936 KB Output is correct
11 Correct 7 ms 3064 KB Output is correct
12 Correct 6 ms 2552 KB Output is correct
13 Correct 7 ms 3064 KB Output is correct
14 Correct 6 ms 2808 KB Output is correct
15 Correct 6 ms 2808 KB Output is correct
16 Correct 6 ms 3192 KB Output is correct
17 Correct 9 ms 5624 KB Output is correct
18 Correct 8 ms 5496 KB Output is correct
19 Correct 7 ms 4472 KB Output is correct
20 Correct 89 ms 74232 KB Output is correct
21 Correct 7 ms 3960 KB Output is correct
22 Correct 8 ms 4856 KB Output is correct
23 Correct 9 ms 5496 KB Output is correct
24 Correct 11 ms 7420 KB Output is correct
25 Correct 10 ms 7544 KB Output is correct
26 Correct 7 ms 3064 KB Output is correct
27 Correct 7 ms 2936 KB Output is correct
28 Correct 13 ms 10360 KB Output is correct
29 Correct 8 ms 4088 KB Output is correct
30 Correct 8 ms 3064 KB Output is correct
31 Correct 8 ms 3576 KB Output is correct
32 Correct 7 ms 3320 KB Output is correct
33 Correct 10 ms 5108 KB Output is correct
34 Correct 11 ms 5108 KB Output is correct
35 Correct 20 ms 11384 KB Output is correct
36 Correct 11 ms 7032 KB Output is correct
37 Correct 24 ms 16376 KB Output is correct
38 Correct 26 ms 15484 KB Output is correct
39 Correct 27 ms 15740 KB Output is correct
40 Correct 27 ms 15480 KB Output is correct
41 Correct 25 ms 15352 KB Output is correct
42 Correct 11 ms 3320 KB Output is correct
43 Correct 12 ms 3064 KB Output is correct
44 Correct 93 ms 74360 KB Output is correct
45 Correct 21 ms 12280 KB Output is correct
46 Correct 21 ms 12280 KB Output is correct
47 Correct 80 ms 64892 KB Output is correct
48 Correct 54 ms 59128 KB Output is correct
49 Correct 57 ms 59128 KB Output is correct
50 Correct 44 ms 48504 KB Output is correct
51 Correct 101 ms 85612 KB Output is correct
52 Correct 102 ms 85828 KB Output is correct
53 Correct 74 ms 77816 KB Output is correct
54 Correct 8 ms 3192 KB Output is correct
55 Correct 9 ms 3320 KB Output is correct
56 Runtime error 248 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
57 Halted 0 ms 0 KB -