oj.uz

Submission #1015711

# Submission time Handle Problem Language Result Execution time Memory
1015711 2024-07-06T16:51:01 Z andrei_iorgulescu Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 115208 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")

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 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 0 ms 3164 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3016 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 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 4184 KB Output is correct

Subtask #3
14.0 / 14.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 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 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 4 ms 4188 KB Output is correct
16 Correct 1 ms 3164 KB Output is correct
17 Correct 7 ms 5268 KB Output is correct
18 Correct 1 ms 3160 KB Output is correct
19 Correct 1 ms 3164 KB Output is correct
20 Correct 2 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 4 ms 4240 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 4188 KB Output is correct
27 Correct 3 ms 4188 KB Output is correct
28 Correct 8 ms 6768 KB Output is correct
29 Correct 19 ms 11032 KB Output is correct
30 Correct 5 ms 5324 KB Output is correct
31 Correct 10 ms 7536 KB Output is correct
32 Correct 9 ms 6512 KB Output is correct
33 Correct 44 ms 18824 KB Output is correct
34 Correct 46 ms 18812 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 3160 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 3416 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
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 3252 KB Output is correct
22 Correct 1 ms 3164 KB Output is correct
23 Correct 3 ms 4188 KB Output is correct
24 Correct 6 ms 5184 KB Output is correct
25 Correct 5 ms 4564 KB Output is correct
26 Correct 3 ms 4184 KB Output is correct
27 Correct 3 ms 4188 KB Output is correct
28 Correct 8 ms 6768 KB Output is correct
29 Correct 18 ms 11148 KB Output is correct
30 Correct 5 ms 5468 KB Output is correct
31 Correct 10 ms 7348 KB Output is correct
32 Correct 9 ms 6512 KB Output is correct
33 Correct 44 ms 18872 KB Output is correct
34 Correct 44 ms 18756 KB Output is correct
35 Correct 57 ms 18900 KB Output is correct
36 Correct 11 ms 5940 KB Output is correct
37 Correct 108 ms 30464 KB Output is correct
38 Correct 92 ms 26096 KB Output is correct
39 Correct 93 ms 26096 KB Output is correct
40 Correct 89 ms 26092 KB Output is correct
41 Correct 101 ms 26100 KB Output is correct
42 Correct 6 ms 4700 KB Output is correct
43 Correct 5 ms 4444 KB Output is correct
44 Correct 4 ms 3932 KB Output is correct
45 Correct 289 ms 69068 KB Output is correct
46 Correct 285 ms 68904 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 3224 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 3236 KB Output is correct
11 Correct 3 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 3 ms 4188 KB Output is correct
15 Correct 3 ms 4184 KB Output is correct
16 Correct 1 ms 3160 KB Output is correct
17 Correct 6 ms 5244 KB Output is correct
18 Correct 1 ms 3164 KB Output is correct
19 Correct 1 ms 3164 KB Output is correct
20 Correct 2 ms 3676 KB Output is correct
21 Correct 1 ms 3156 KB Output is correct
22 Correct 1 ms 3164 KB Output is correct
23 Correct 4 ms 4188 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 4188 KB Output is correct
27 Correct 3 ms 4284 KB Output is correct
28 Correct 10 ms 6768 KB Output is correct
29 Correct 20 ms 11148 KB Output is correct
30 Correct 6 ms 5468 KB Output is correct
31 Correct 11 ms 7536 KB Output is correct
32 Correct 9 ms 6648 KB Output is correct
33 Correct 44 ms 18872 KB Output is correct
34 Correct 44 ms 18820 KB Output is correct
35 Correct 72 ms 18896 KB Output is correct
36 Correct 11 ms 6052 KB Output is correct
37 Correct 105 ms 30444 KB Output is correct
38 Correct 94 ms 26092 KB Output is correct
39 Correct 92 ms 26168 KB Output is correct
40 Correct 95 ms 26156 KB Output is correct
41 Correct 93 ms 26096 KB Output is correct
42 Correct 6 ms 4700 KB Output is correct
43 Correct 5 ms 4660 KB Output is correct
44 Correct 4 ms 3968 KB Output is correct
45 Correct 282 ms 68884 KB Output is correct
46 Correct 300 ms 68988 KB Output is correct
47 Execution timed out 1041 ms 115208 KB Time limit exceeded
48 Halted 0 ms 0 KB -