oj.uz

Submission #1015710

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

using namespace std;

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

pair<int,int> dehsh(int x)
{
    return {x / 31000, x % 31000};
}

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[10000005];

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 = 5e6,fr = 5e6;
    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 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 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 0 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 0 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 3160 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 1 ms 3416 KB Output is correct
11 Correct 2 ms 3928 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 3 ms 4188 KB Output is correct
15 Correct 3 ms 4188 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 3164 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 1 ms 3164 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 1 ms 3164 KB Output is correct
9 Correct 1 ms 3164 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 2 ms 3676 KB Output is correct
12 Correct 1 ms 3160 KB Output is correct
13 Correct 1 ms 3160 KB Output is correct
14 Correct 3 ms 4188 KB Output is correct
15 Correct 3 ms 3952 KB Output is correct
16 Correct 1 ms 3164 KB Output is correct
17 Correct 6 ms 5292 KB Output is correct
18 Correct 1 ms 3164 KB Output is correct
19 Correct 1 ms 3164 KB Output is correct
20 Correct 3 ms 3676 KB Output is correct
21 Correct 1 ms 3160 KB Output is correct
22 Correct 1 ms 3164 KB Output is correct
23 Correct 4 ms 4112 KB Output is correct
24 Correct 6 ms 5212 KB Output is correct
25 Correct 4 ms 4444 KB Output is correct
26 Correct 3 ms 4356 KB Output is correct
27 Correct 3 ms 4188 KB Output is correct
28 Correct 10 ms 6768 KB Output is correct
29 Correct 20 ms 11144 KB Output is correct
30 Correct 6 ms 5464 KB Output is correct
31 Correct 11 ms 7536 KB Output is correct
32 Correct 9 ms 6556 KB Output is correct
33 Correct 44 ms 18864 KB Output is correct
34 Correct 43 ms 18860 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3160 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 0 ms 3164 KB Output is correct
4 Correct 0 ms 3164 KB Output is correct
5 Correct 0 ms 3164 KB Output is correct
6 Correct 0 ms 3164 KB Output is correct
7 Correct 1 ms 3164 KB Output is correct
8 Correct 0 ms 3164 KB Output is correct
9 Correct 0 ms 3164 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 2 ms 3676 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 2 ms 4188 KB Output is correct
15 Correct 2 ms 4188 KB Output is correct
16 Correct 1 ms 3164 KB Output is correct
17 Correct 6 ms 5212 KB Output is correct
18 Correct 1 ms 3164 KB Output is correct
19 Correct 1 ms 3212 KB Output is correct
20 Correct 1 ms 3676 KB Output is correct
21 Correct 1 ms 3164 KB Output is correct
22 Correct 1 ms 3164 KB Output is correct
23 Correct 3 ms 4068 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 4 ms 4528 KB Output is correct
26 Correct 4 ms 4188 KB Output is correct
27 Correct 3 ms 4188 KB Output is correct
28 Correct 10 ms 6588 KB Output is correct
29 Correct 17 ms 11148 KB Output is correct
30 Correct 5 ms 5468 KB Output is correct
31 Correct 10 ms 7536 KB Output is correct
32 Correct 8 ms 6512 KB Output is correct
33 Correct 43 ms 18904 KB Output is correct
34 Correct 40 ms 18864 KB Output is correct
35 Correct 51 ms 19000 KB Output is correct
36 Correct 9 ms 5816 KB Output is correct
37 Correct 88 ms 30448 KB Output is correct
38 Correct 82 ms 26092 KB Output is correct
39 Correct 82 ms 26096 KB Output is correct
40 Correct 81 ms 26096 KB Output is correct
41 Correct 81 ms 26036 KB Output is correct
42 Correct 5 ms 4696 KB Output is correct
43 Correct 5 ms 4476 KB Output is correct
44 Correct 4 ms 3932 KB Output is correct
45 Correct 270 ms 68904 KB Output is correct
46 Correct 276 ms 68896 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3164 KB Output is correct
2 Correct 1 ms 3164 KB Output is correct
3 Correct 1 ms 3164 KB Output is correct
4 Correct 1 ms 3164 KB Output is correct
5 Correct 1 ms 3164 KB Output is correct
6 Correct 0 ms 3164 KB Output is correct
7 Correct 0 ms 3164 KB Output is correct
8 Correct 0 ms 3164 KB Output is correct
9 Correct 0 ms 3164 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 2 ms 3932 KB Output is correct
12 Correct 1 ms 3164 KB Output is correct
13 Correct 1 ms 3164 KB Output is correct
14 Correct 3 ms 4188 KB Output is correct
15 Correct 3 ms 4208 KB Output is correct
16 Correct 1 ms 3164 KB Output is correct
17 Correct 6 ms 5212 KB Output is correct
18 Correct 1 ms 3164 KB Output is correct
19 Correct 1 ms 3164 KB Output is correct
20 Correct 1 ms 3676 KB Output is correct
21 Correct 1 ms 3164 KB Output is correct
22 Correct 1 ms 3164 KB Output is correct
23 Correct 3 ms 4160 KB Output is correct
24 Correct 5 ms 5212 KB Output is correct
25 Correct 3 ms 4444 KB Output is correct
26 Correct 3 ms 4188 KB Output is correct
27 Correct 3 ms 4188 KB Output is correct
28 Correct 10 ms 6772 KB Output is correct
29 Correct 22 ms 11144 KB Output is correct
30 Correct 5 ms 5464 KB Output is correct
31 Correct 9 ms 7576 KB Output is correct
32 Correct 7 ms 6512 KB Output is correct
33 Correct 43 ms 18788 KB Output is correct
34 Correct 40 ms 18864 KB Output is correct
35 Correct 51 ms 19000 KB Output is correct
36 Correct 9 ms 6068 KB Output is correct
37 Correct 103 ms 30464 KB Output is correct
38 Correct 84 ms 26356 KB Output is correct
39 Correct 81 ms 26096 KB Output is correct
40 Correct 78 ms 26200 KB Output is correct
41 Correct 85 ms 26096 KB Output is correct
42 Correct 5 ms 4696 KB Output is correct
43 Correct 5 ms 4444 KB Output is correct
44 Correct 4 ms 3932 KB Output is correct
45 Correct 262 ms 68892 KB Output is correct
46 Correct 290 ms 68900 KB Output is correct
47 Correct 949 ms 115028 KB Output is correct
48 Correct 5 ms 3928 KB Output is correct
49 Correct 4 ms 3932 KB Output is correct
50 Correct 3 ms 3812 KB Output is correct
51 Correct 254 ms 50000 KB Output is correct
52 Correct 344 ms 58964 KB Output is correct
53 Correct 59 ms 23536 KB Output is correct
54 Correct 6 ms 6952 KB Output is correct
55 Correct 13 ms 9428 KB Output is correct
56 Correct 16 ms 12172 KB Output is correct
57 Correct 334 ms 64792 KB Output is correct
58 Correct 35 ms 16812 KB Output is correct
59 Correct 43 ms 19640 KB Output is correct
60 Correct 52 ms 22188 KB Output is correct
61 Correct 49 ms 20908 KB Output is correct
62 Correct 454 ms 73876 KB Output is correct
63 Execution timed out 1046 ms 150236 KB Time limit exceeded
64 Halted 0 ms 0 KB -