oj.uz

Submission #209591

# Submission time Handle Problem Language Result Execution time Memory
209591 2020-03-14T18:10:37 Z gratus907 Jakarta Skyscrapers (APIO15_skyscraper) C++17
22 / 100
 111 ms 74260 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();
        bool go = true;
        for (int i = 1; ; i++)
        {
            int u = dg.second+i*dg.first;
            if (u >= n) break;
            if (go)
            {
                G[dg.second].push_back({u, i});
                if (mark[u][dg.second])
                {
                    go = false;
                }
            }
            if (!visit[u])
            {
                visit[u] = true;
                for (auto unseen:doge[u])
                {
                    q.push({unseen, u});
                }
            }
        }
        go = true;
        for (int i = -1; ; i--)
        {
            int u = dg.second+i*dg.first;
            if (u < 0) break;
            if (go)
            {
                G[dg.second].push_back({u, -i});
                if (mark[u][dg.second])
                {
                    go = false;
                }
            }
            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

# Verdict Execution time Memory 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 2552 KB Output is correct
6 Correct 6 ms 2424 KB Output is correct
7 Correct 6 ms 2424 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2424 KB Output is correct
2 Correct 6 ms 2552 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 2428 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 6 ms 2936 KB Output is correct
11 Correct 7 ms 2936 KB Output is correct
12 Correct 6 ms 2552 KB Output is correct
13 Correct 7 ms 3064 KB Output is correct
14 Correct 7 ms 2808 KB Output is correct
15 Correct 7 ms 2808 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory 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 2552 KB Output is correct
5 Correct 6 ms 2424 KB Output is correct
6 Correct 6 ms 2424 KB Output is correct
7 Correct 7 ms 2424 KB Output is correct
8 Correct 6 ms 2552 KB Output is correct
9 Correct 6 ms 2556 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 7 ms 2936 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 2812 KB Output is correct
16 Correct 7 ms 3192 KB Output is correct
17 Correct 9 ms 5496 KB Output is correct
18 Correct 9 ms 5496 KB Output is correct
19 Correct 8 ms 4472 KB Output is correct
20 Correct 111 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 11 ms 5496 KB Output is correct
24 Correct 11 ms 7416 KB Output is correct
25 Correct 11 ms 7544 KB Output is correct
26 Correct 8 ms 3064 KB Output is correct
27 Correct 8 ms 2936 KB Output is correct
28 Incorrect 12 ms 10364 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory 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 5 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 6 ms 2936 KB Output is correct
11 Correct 6 ms 2936 KB Output is correct
12 Correct 6 ms 2552 KB Output is correct
13 Correct 7 ms 3064 KB Output is correct
14 Correct 7 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 5496 KB Output is correct
18 Correct 8 ms 5496 KB Output is correct
19 Correct 7 ms 4348 KB Output is correct
20 Correct 110 ms 74104 KB Output is correct
21 Correct 7 ms 3960 KB Output is correct
22 Correct 9 ms 4856 KB Output is correct
23 Correct 9 ms 5500 KB Output is correct
24 Correct 12 ms 7416 KB Output is correct
25 Correct 11 ms 7548 KB Output is correct
26 Correct 8 ms 3064 KB Output is correct
27 Correct 8 ms 2936 KB Output is correct
28 Incorrect 12 ms 10360 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory 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 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 6 ms 2936 KB Output is correct
12 Correct 6 ms 2552 KB Output is correct
13 Correct 7 ms 3064 KB Output is correct
14 Correct 8 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 5496 KB Output is correct
18 Correct 8 ms 5496 KB Output is correct
19 Correct 7 ms 4472 KB Output is correct
20 Correct 109 ms 74260 KB Output is correct
21 Correct 7 ms 3960 KB Output is correct
22 Correct 7 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 11 ms 7544 KB Output is correct
26 Correct 8 ms 3064 KB Output is correct
27 Correct 8 ms 2936 KB Output is correct
28 Incorrect 12 ms 10360 KB Output isn't correct
29 Halted 0 ms 0 KB -