oj.uz

Submission #1015716

# Submission time Handle Problem Language Result Execution time Memory
1015716 2024-07-06T16:54:46 Z andrei_iorgulescu Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 136332 KB 
#include <bits/stdc++.h>

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;
        if (nod.first == fin and nod.second == 0)
            break;
        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 1116 KB Output is correct
2 Correct 0 ms 1180 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 1116 KB Output is correct
6 Correct 0 ms 1116 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 0 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 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 1012 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 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 2136 KB Output is correct
15 Correct 2 ms 1628 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 0 ms 1116 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 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 0 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1136 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 3 ms 2140 KB Output is correct
15 Correct 2 ms 1628 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 2 ms 1628 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 1700 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 1884 KB Output is correct
24 Correct 4 ms 2468 KB Output is correct
25 Correct 1 ms 1372 KB Output is correct
26 Correct 2 ms 1628 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 10 ms 4564 KB Output is correct
29 Correct 21 ms 9512 KB Output is correct
30 Correct 6 ms 3420 KB Output is correct
31 Correct 11 ms 5744 KB Output is correct
32 Correct 9 ms 4720 KB Output is correct
33 Correct 44 ms 17684 KB Output is correct
34 Correct 24 ms 9868 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 1 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 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 1116 KB Output is correct
11 Correct 1 ms 1116 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 2068 KB Output is correct
15 Correct 2 ms 1628 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 2 ms 1628 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 1884 KB Output is correct
24 Correct 4 ms 2396 KB Output is correct
25 Correct 2 ms 1248 KB Output is correct
26 Correct 1 ms 1628 KB Output is correct
27 Correct 2 ms 1884 KB Output is correct
28 Correct 8 ms 4628 KB Output is correct
29 Correct 18 ms 9604 KB Output is correct
30 Correct 6 ms 3420 KB Output is correct
31 Correct 11 ms 5744 KB Output is correct
32 Correct 9 ms 4720 KB Output is correct
33 Correct 48 ms 17608 KB Output is correct
34 Correct 23 ms 9856 KB Output is correct
35 Correct 28 ms 10096 KB Output is correct
36 Correct 3 ms 1628 KB Output is correct
37 Correct 20 ms 5500 KB Output is correct
38 Correct 11 ms 4792 KB Output is correct
39 Correct 4 ms 1828 KB Output is correct
40 Correct 6 ms 2544 KB Output is correct
41 Correct 27 ms 8828 KB Output is correct
42 Correct 3 ms 2140 KB Output is correct
43 Correct 4 ms 2396 KB Output is correct
44 Correct 4 ms 2140 KB Output is correct
45 Correct 299 ms 69168 KB Output is correct
46 Correct 131 ms 37228 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 1 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 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 1116 KB Output is correct
11 Correct 1 ms 1116 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 2 ms 1628 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 2 ms 1628 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 1652 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 1884 KB Output is correct
24 Correct 4 ms 2396 KB Output is correct
25 Correct 1 ms 1372 KB Output is correct
26 Correct 2 ms 1628 KB Output is correct
27 Correct 3 ms 2140 KB Output is correct
28 Correct 12 ms 4628 KB Output is correct
29 Correct 20 ms 9612 KB Output is correct
30 Correct 7 ms 3392 KB Output is correct
31 Correct 10 ms 5740 KB Output is correct
32 Correct 9 ms 4720 KB Output is correct
33 Correct 43 ms 17636 KB Output is correct
34 Correct 23 ms 9868 KB Output is correct
35 Correct 28 ms 10228 KB Output is correct
36 Correct 2 ms 1624 KB Output is correct
37 Correct 14 ms 5452 KB Output is correct
38 Correct 13 ms 4792 KB Output is correct
39 Correct 6 ms 1884 KB Output is correct
40 Correct 6 ms 2556 KB Output is correct
41 Correct 25 ms 8824 KB Output is correct
42 Correct 4 ms 2136 KB Output is correct
43 Correct 5 ms 2396 KB Output is correct
44 Correct 4 ms 2116 KB Output is correct
45 Correct 297 ms 69188 KB Output is correct
46 Correct 133 ms 37312 KB Output is correct
47 Correct 14 ms 5904 KB Output is correct
48 Correct 4 ms 1880 KB Output is correct
49 Correct 4 ms 1884 KB Output is correct
50 Correct 5 ms 1628 KB Output is correct
51 Correct 45 ms 12664 KB Output is correct
52 Correct 47 ms 13844 KB Output is correct
53 Correct 9 ms 4184 KB Output is correct
54 Correct 8 ms 4976 KB Output is correct
55 Correct 13 ms 7640 KB Output is correct
56 Correct 22 ms 10376 KB Output is correct
57 Correct 1 ms 1372 KB Output is correct
58 Correct 37 ms 15272 KB Output is correct
59 Correct 33 ms 14928 KB Output is correct
60 Correct 32 ms 14920 KB Output is correct
61 Correct 24 ms 11400 KB Output is correct
62 Correct 422 ms 69148 KB Output is correct
63 Execution timed out 1048 ms 136332 KB Time limit exceeded
64 Halted 0 ms 0 KB -