oj.uz

Submission #1015709

# Submission time Handle Problem Language Result Execution time Memory
1015709 2024-07-06T16:49:36 Z andrei_iorgulescu Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 114952 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 = 1e7;
    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 1 ms 1112 KB Output is correct
3 Correct 1 ms 1112 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 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 1 ms 1116 KB Output is correct
3 Correct 1 ms 1112 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 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

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 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 1128 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 2136 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 7 ms 3164 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 0 ms 1116 KB Output is correct
20 Correct 2 ms 1732 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 3152 KB Output is correct
25 Correct 4 ms 2396 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 3 ms 2140 KB Output is correct
28 Correct 12 ms 4720 KB Output is correct
29 Correct 21 ms 9612 KB Output is correct
30 Correct 6 ms 3420 KB Output is correct
31 Correct 11 ms 5712 KB Output is correct
32 Correct 9 ms 4720 KB Output is correct
33 Correct 44 ms 17580 KB Output is correct
34 Correct 42 ms 17580 KB Output is correct

Subtask #4
21.0 / 21.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 0 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 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 2060 KB Output is correct
16 Correct 0 ms 1116 KB Output is correct
17 Correct 6 ms 3316 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 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 2140 KB Output is correct
24 Correct 6 ms 3164 KB Output is correct
25 Correct 4 ms 2396 KB Output is correct
26 Correct 3 ms 2396 KB Output is correct
27 Correct 3 ms 2136 KB Output is correct
28 Correct 10 ms 4720 KB Output is correct
29 Correct 21 ms 9416 KB Output is correct
30 Correct 6 ms 3672 KB Output is correct
31 Correct 12 ms 5644 KB Output is correct
32 Correct 9 ms 4720 KB Output is correct
33 Correct 44 ms 17592 KB Output is correct
34 Correct 44 ms 17584 KB Output is correct
35 Correct 68 ms 17464 KB Output is correct
36 Correct 9 ms 4020 KB Output is correct
37 Correct 104 ms 29492 KB Output is correct
38 Correct 99 ms 25076 KB Output is correct
39 Correct 97 ms 25068 KB Output is correct
40 Correct 95 ms 25072 KB Output is correct
41 Correct 93 ms 25072 KB Output is correct
42 Correct 6 ms 2652 KB Output is correct
43 Correct 5 ms 2652 KB Output is correct
44 Correct 4 ms 1884 KB Output is correct
45 Correct 289 ms 69032 KB Output is correct
46 Correct 307 ms 68892 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 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 1 ms 1116 KB Output is correct
7 Correct 0 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 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 7 ms 3164 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 1 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 2140 KB Output is correct
24 Correct 6 ms 3164 KB Output is correct
25 Correct 4 ms 2396 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 4720 KB Output is correct
29 Correct 21 ms 9632 KB Output is correct
30 Correct 6 ms 3420 KB Output is correct
31 Correct 11 ms 5644 KB Output is correct
32 Correct 9 ms 4668 KB Output is correct
33 Correct 44 ms 17736 KB Output is correct
34 Correct 45 ms 17628 KB Output is correct
35 Correct 61 ms 17464 KB Output is correct
36 Correct 9 ms 4020 KB Output is correct
37 Correct 113 ms 29584 KB Output is correct
38 Correct 92 ms 25080 KB Output is correct
39 Correct 113 ms 25116 KB Output is correct
40 Correct 95 ms 25072 KB Output is correct
41 Correct 92 ms 25072 KB Output is correct
42 Correct 6 ms 2652 KB Output is correct
43 Correct 5 ms 2652 KB Output is correct
44 Correct 4 ms 1884 KB Output is correct
45 Correct 281 ms 68920 KB Output is correct
46 Correct 297 ms 68896 KB Output is correct
47 Execution timed out 1014 ms 114952 KB Time limit exceeded
48 Halted 0 ms 0 KB -