oj.uz

답안 #1015718

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015718 2024-07-06T16:56:40 Z andrei_iorgulescu Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 128708 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;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:30:18: warning: unused variable 'lul' [-Wunused-variable]
   30 |     int cate = 0,lul = 1e6;
      |                  ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 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 1112 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 0 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 1 ms 1628 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1160 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 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 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 2 ms 2160 KB Output is correct
15 Correct 1 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 0 ms 1116 KB Output is correct
20 Correct 2 ms 1628 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 3 ms 2112 KB Output is correct
24 Correct 5 ms 2396 KB Output is correct
25 Correct 1 ms 1372 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 4572 KB Output is correct
29 Correct 17 ms 9612 KB Output is correct
30 Correct 6 ms 3564 KB Output is correct
31 Correct 10 ms 5652 KB Output is correct
32 Correct 9 ms 4716 KB Output is correct
33 Correct 39 ms 17592 KB Output is correct
34 Correct 21 ms 9868 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1112 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 1180 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 2 ms 2140 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct
16 Correct 0 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 1 ms 1628 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1164 KB Output is correct
23 Correct 3 ms 2140 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 2 ms 1880 KB Output is correct
28 Correct 8 ms 4624 KB Output is correct
29 Correct 22 ms 9608 KB Output is correct
30 Correct 5 ms 3420 KB Output is correct
31 Correct 10 ms 5740 KB Output is correct
32 Correct 10 ms 4720 KB Output is correct
33 Correct 41 ms 17544 KB Output is correct
34 Correct 24 ms 9896 KB Output is correct
35 Correct 27 ms 10104 KB Output is correct
36 Correct 2 ms 1628 KB Output is correct
37 Correct 12 ms 5392 KB Output is correct
38 Correct 11 ms 4780 KB Output is correct
39 Correct 4 ms 1884 KB Output is correct
40 Correct 7 ms 2652 KB Output is correct
41 Correct 22 ms 8724 KB Output is correct
42 Correct 3 ms 2136 KB Output is correct
43 Correct 4 ms 2396 KB Output is correct
44 Correct 8 ms 2072 KB Output is correct
45 Correct 296 ms 69136 KB Output is correct
46 Correct 112 ms 37208 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 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 1 ms 1116 KB Output is correct
7 Correct 1 ms 1368 KB Output is correct
8 Correct 0 ms 1112 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 1184 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 3 ms 1948 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1628 KB Output is correct
18 Correct 0 ms 1116 KB Output is correct
19 Correct 0 ms 1116 KB Output is correct
20 Correct 2 ms 1628 KB Output is correct
21 Correct 0 ms 1116 KB Output is correct
22 Correct 1 ms 1112 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 4 ms 2396 KB Output is correct
25 Correct 1 ms 1244 KB Output is correct
26 Correct 1 ms 1628 KB Output is correct
27 Correct 2 ms 1880 KB Output is correct
28 Correct 9 ms 4528 KB Output is correct
29 Correct 19 ms 9612 KB Output is correct
30 Correct 6 ms 3420 KB Output is correct
31 Correct 11 ms 5716 KB Output is correct
32 Correct 8 ms 4720 KB Output is correct
33 Correct 44 ms 17684 KB Output is correct
34 Correct 23 ms 10052 KB Output is correct
35 Correct 25 ms 10108 KB Output is correct
36 Correct 2 ms 1628 KB Output is correct
37 Correct 13 ms 5364 KB Output is correct
38 Correct 13 ms 4792 KB Output is correct
39 Correct 3 ms 1884 KB Output is correct
40 Correct 7 ms 2628 KB Output is correct
41 Correct 29 ms 8828 KB Output is correct
42 Correct 4 ms 2140 KB Output is correct
43 Correct 5 ms 2620 KB Output is correct
44 Correct 4 ms 2112 KB Output is correct
45 Correct 288 ms 69192 KB Output is correct
46 Correct 134 ms 37216 KB Output is correct
47 Correct 15 ms 5904 KB Output is correct
48 Correct 4 ms 1884 KB Output is correct
49 Correct 4 ms 1848 KB Output is correct
50 Correct 3 ms 1628 KB Output is correct
51 Correct 44 ms 12588 KB Output is correct
52 Correct 44 ms 13792 KB Output is correct
53 Correct 10 ms 4188 KB Output is correct
54 Correct 8 ms 4984 KB Output is correct
55 Correct 12 ms 7636 KB Output is correct
56 Correct 17 ms 10372 KB Output is correct
57 Correct 1 ms 1368 KB Output is correct
58 Correct 35 ms 15260 KB Output is correct
59 Correct 31 ms 14912 KB Output is correct
60 Correct 33 ms 14924 KB Output is correct
61 Correct 23 ms 11404 KB Output is correct
62 Correct 530 ms 69324 KB Output is correct
63 Execution timed out 1039 ms 128708 KB Time limit exceeded
64 Halted 0 ms 0 KB -