oj.uz

Submission #105563

# Submission time Handle Problem Language Result Execution time Memory
105563 2019-04-13T13:43:20 Z Kastanda Jakarta Skyscrapers (APIO15_skyscraper) C++11
22 / 100
 25 ms 768 KB 
#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int N = 30004;
int n, m, head[N], nxt[N], D[N];
pair < int , int > A[N];
priority_queue < pair < int , int > > Pq;
inline void Add(int v, int i)
{
    nxt[i] = head[v]; head[v] = i;
}
int main()
{
    memset(nxt, -1, sizeof(nxt));
    memset(head, -1, sizeof(head));
    scanf("%d%d", &n, &m);
    for (int i = 0; i < m; i++)
        scanf("%d%d", &A[i].x, &A[i].y), Add(A[i].x, i);
    memset(D, 63, sizeof(D)); D[A[0].x] = 0;
    Pq.push({0, A[0].x});
    while (Pq.size())
    {
        int d = -Pq.top().x, v = Pq.top().y; Pq.pop();
        if (v == A[1].x)
            return !printf("%d\n", d);
        if (d > D[v]) continue;
        for (; ~ head[v]; head[v] = nxt[head[v]])
        {
            for (int id = v + A[head[v]].y; id < n; id += A[head[v]].y)
                if (D[id] > (++ d)) D[id] = d, Pq.push({-d, id});
            d = D[v];
            for (int id = v - A[head[v]].y; id >= 0; id -= A[head[v]].y)
                if (D[id] > (++ d)) D[id] = d, Pq.push({-d, id});
        }
    }
    return !printf("-1\n");
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:17:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp:19:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &A[i].x, &A[i].y), Add(A[i].x, i);
         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 25 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 ms 768 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 4 ms 640 KB Output is correct
15 Correct 3 ms 640 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 612 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 4 ms 640 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 3 ms 640 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 3 ms 764 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 2 ms 640 KB Output is correct
20 Correct 10 ms 768 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 640 KB Output is correct
24 Incorrect 4 ms 768 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 768 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 2 ms 640 KB Output is correct
15 Correct 4 ms 768 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 3 ms 768 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 10 ms 768 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 3 ms 768 KB Output is correct
23 Correct 3 ms 768 KB Output is correct
24 Incorrect 4 ms 768 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 2 ms 640 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 4 ms 768 KB Output is correct
14 Correct 2 ms 732 KB Output is correct
15 Correct 3 ms 768 KB Output is correct
16 Correct 0 ms 640 KB Output is correct
17 Correct 3 ms 740 KB Output is correct
18 Correct 3 ms 768 KB Output is correct
19 Correct 3 ms 640 KB Output is correct
20 Correct 10 ms 768 KB Output is correct
21 Correct 4 ms 768 KB Output is correct
22 Correct 3 ms 640 KB Output is correct
23 Correct 4 ms 640 KB Output is correct
24 Incorrect 4 ms 768 KB Output isn't correct
25 Halted 0 ms 0 KB -