oj.uz

Submission #1015714

# Submission time Handle Problem Language Result Execution time Memory
1015714 2024-07-06T16:53:19 Z andrei_iorgulescu Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 137808 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")

using namespace std;

int hsh(pair<int,int> pr)
{
    return pr.first * 31000 + pr.second;
}

int n,m;
int b[30005],p[30005];
unordered_map<int, bool> viz,luat;
unordered_map<int, int> d;
vector<int> what[30005];
int str,fin;
pair<int,int> q[2000005];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
        cin >> b[i] >> p[i],what[b[i]].push_back(p[i]);
    str = b[1],fin = b[2];
    int bk = 1e6,fr = 1e6;
    q[bk] = {str,0};
    viz[hsh({str,0})] = true;
    int cate = 0,lul = 1e6;
    while (bk <= fr)
    {
        pair<int,int> nod = q[fr];
        int dehnod = hsh(nod);
        fr--;
        if (luat[dehnod])
            continue;
        cate++;
        if (cate > lul)
            assert(false);
        luat[dehnod] = true;
        int dist = d[dehnod];
        if (nod.second != 0)
        {
            pair<int,int> vec;
            vec = {nod.first,0};
            int dehvec = hsh(vec);
            if (!viz[dehvec] or d[dehvec] > dist)
            {
                viz[dehvec] = true;
                q[++fr] = (vec);
                d[dehvec] = dist;
            }

            vec = {nod.first + nod.second,nod.second};
            dehvec = hsh(vec);
            if (!viz[dehvec] and vec.first >= 0 and vec.first < n)
            {
                viz[dehvec] = true;
                q[--bk] = vec;
                d[dehvec] = dist + 1;
            }

            vec = {nod.first - nod.second,nod.second};
            dehvec = hsh(vec);
            if (!viz[dehvec] and vec.first >= 0 and vec.first < n)
            {
                viz[dehvec] = true;
                q[--bk] = vec;
                d[dehvec] = dist + 1;
            }
        }
        else
        {
            for (auto it : what[nod.first])
            {
                pair<int,int> vec = {nod.first,it};
                int dehvec = hsh(vec);
                if (!viz[dehvec] or d[dehvec] > dist)
                {
                    viz[dehvec] = true;
                    q[++fr] = vec;
                    d[dehvec] = dist;
                }
            }
        }
    }
    if (!viz[hsh({fin,0})])
        cout << -1;
    else
        cout << d[hsh({fin,0})];
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 2 ms 3164 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 3 ms 2140 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 1184 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 2 ms 1692 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 3 ms 2140 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 7 ms 3324 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 2 ms 1628 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 3 ms 2100 KB Output is correct
24 Correct 6 ms 3164 KB Output is correct
25 Correct 4 ms 2652 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 3 ms 2140 KB Output is correct
28 Correct 10 ms 4908 KB Output is correct
29 Correct 20 ms 9648 KB Output is correct
30 Correct 6 ms 3420 KB Output is correct
31 Correct 12 ms 5744 KB Output is correct
32 Correct 9 ms 4568 KB Output is correct
33 Correct 45 ms 17576 KB Output is correct
34 Correct 47 ms 17540 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1172 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 2 ms 1700 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 3 ms 2140 KB Output is correct
15 Correct 3 ms 1976 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 7 ms 3308 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 2 ms 1632 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 4 ms 2140 KB Output is correct
24 Correct 6 ms 3236 KB Output is correct
25 Correct 5 ms 2604 KB Output is correct
26 Correct 4 ms 2396 KB Output is correct
27 Correct 3 ms 2140 KB Output is correct
28 Correct 10 ms 4760 KB Output is correct
29 Correct 21 ms 9668 KB Output is correct
30 Correct 6 ms 3420 KB Output is correct
31 Correct 13 ms 5744 KB Output is correct
32 Correct 9 ms 4792 KB Output is correct
33 Correct 43 ms 17680 KB Output is correct
34 Correct 50 ms 17584 KB Output is correct
35 Correct 60 ms 17536 KB Output is correct
36 Correct 9 ms 4024 KB Output is correct
37 Correct 114 ms 29708 KB Output is correct
38 Correct 85 ms 25324 KB Output is correct
39 Correct 93 ms 25436 KB Output is correct
40 Correct 100 ms 25356 KB Output is correct
41 Correct 101 ms 25372 KB Output is correct
42 Correct 6 ms 2908 KB Output is correct
43 Correct 6 ms 2880 KB Output is correct
44 Correct 4 ms 2208 KB Output is correct
45 Correct 298 ms 69272 KB Output is correct
46 Correct 295 ms 69052 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 2 ms 1884 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 3 ms 2140 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 6 ms 3164 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1112 KB Output is correct
20 Correct 2 ms 1628 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1112 KB Output is correct
23 Correct 4 ms 2140 KB Output is correct
24 Correct 6 ms 3164 KB Output is correct
25 Correct 4 ms 2652 KB Output is correct
26 Correct 3 ms 2200 KB Output is correct
27 Correct 3 ms 2140 KB Output is correct
28 Correct 10 ms 4720 KB Output is correct
29 Correct 21 ms 9600 KB Output is correct
30 Correct 6 ms 3416 KB Output is correct
31 Correct 12 ms 5780 KB Output is correct
32 Correct 9 ms 4720 KB Output is correct
33 Correct 46 ms 17580 KB Output is correct
34 Correct 44 ms 17584 KB Output is correct
35 Correct 58 ms 17716 KB Output is correct
36 Correct 10 ms 4020 KB Output is correct
37 Correct 116 ms 29764 KB Output is correct
38 Correct 98 ms 25324 KB Output is correct
39 Correct 98 ms 25500 KB Output is correct
40 Correct 93 ms 25348 KB Output is correct
41 Correct 85 ms 25324 KB Output is correct
42 Correct 6 ms 2904 KB Output is correct
43 Correct 5 ms 2648 KB Output is correct
44 Correct 4 ms 2140 KB Output is correct
45 Correct 272 ms 69152 KB Output is correct
46 Correct 285 ms 69152 KB Output is correct
47 Correct 992 ms 115184 KB Output is correct
48 Correct 4 ms 1884 KB Output is correct
49 Correct 3 ms 1880 KB Output is correct
50 Correct 2 ms 1880 KB Output is correct
51 Correct 258 ms 50104 KB Output is correct
52 Correct 369 ms 58796 KB Output is correct
53 Correct 67 ms 21928 KB Output is correct
54 Correct 7 ms 4972 KB Output is correct
55 Correct 11 ms 7640 KB Output is correct
56 Correct 17 ms 10380 KB Output is correct
57 Correct 356 ms 64936 KB Output is correct
58 Correct 32 ms 15180 KB Output is correct
59 Correct 43 ms 18264 KB Output is correct
60 Correct 59 ms 21164 KB Output is correct
61 Correct 51 ms 19628 KB Output is correct
62 Correct 473 ms 73860 KB Output is correct
63 Execution timed out 1052 ms 137808 KB Time limit exceeded
64 Halted 0 ms 0 KB -