oj.uz

Submission #469927

# Submission time Handle Problem Language Result Execution time Memory
469927 2021-09-02T10:48:15 Z ymm Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 106596 KB 
///
///   ♪ Pizza mozzarella rella rella rella... ♪
///

#define _USE_MATH_DEFINES
#define FAST ios::sync_with_stdio(false),cin.tie(0);
#include <bits/stdc++.h>
#define Loop(x, l, r) for(int x = (l); x < (r); ++x)
#define LoopR(x, l, r) for(int x = (r)-1; x >= (l); --x)
#define all(x) x.begin(), x.end()
#define Kill(x) exit((cout << (x) << '\n', 0))
#define YN(flag) ((flag)? "YES": "NO")
#define F first
#define S second
typedef          long long   ll;
typedef unsigned long long  ull;
typedef std::pair<int,int>  pii;
typedef std::pair<ll ,ll >  pll;
using namespace std;

const int N = 30'010;
unordered_map<int,int> d;
vector<int> P[N];
bool vis[N];
int n, m;

void bfs(int sv, int sp)
{
    vector<int> q;
    vis[sv] = 1;
    for(auto p : P[sv]) if(!d.count(sv<<15^p)) d[sv<<15^p] = 0, q.push_back(sv<<15^p);
    if(!d.count(sv<<15^sp)) d[sv<<15^sp] = 0, q.push_back(sv<<15^sp);
    for(int i = 0, j = q.size(), d = 0; i < q.size(); j = q.size(), ++d) for(; i < j; ++i)
    {
        int v = q[i]>>15, p = q[i]&32767;
        //cerr << v << ' ' << p << ": " << d << '\n';
        int u = v+p;
        if(0 <= u && u < n)
        {
            if(!vis[u]){
                vis[u] = 1;
                for(auto p : P[u]) if(!::d.count(u<<15^p)) ::d[u<<15^p] = d+1, q.push_back(u<<15^p);
            }
            if(!::d.count(u<<15^p)) ::d[u<<15^p] = d+1, q.push_back(u<<15^p);
        }
        u = v-p;
        if(0 <= u && u < n)
        {
            if(!vis[u]){
                vis[u] = 1;
                for(auto p : P[u]) if(!::d.count(u<<15^p)) ::d[u<<15^p] = d+1, q.push_back(u<<15^p);
            }
            if(!::d.count(u<<15^p)) ::d[u<<15^p] = d+1, q.push_back(u<<15^p);
        }
    }
}

int main()
{
    FAST;
    cin >> n >> m;
    int p, src, des, dmy;
    cin >> src >> p;
    cin >> des >> dmy;
    P[des].push_back(dmy);
    Loop(i,2,m)
    {
        int v, p;
        cin >> v >> p;
        P[v].push_back(p);
    }
    bfs(src, p);
    cout << (d.count(des<<15^dmy)? d[des<<15^dmy]: -1) << '\n';
}

Compilation message

skyscraper.cpp: In function 'void bfs(int, int)':
skyscraper.cpp:33:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i = 0, j = q.size(), d = 0; i < q.size(); j = q.size(), ++d) for(; i < j; ++i)
      |                                         ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 1024 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 1 ms 1048 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 3 ms 1228 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 2 ms 1228 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 4 ms 1612 KB Output is correct
18 Correct 1 ms 972 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 2 ms 1100 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 2 ms 1280 KB Output is correct
24 Correct 4 ms 1612 KB Output is correct
25 Correct 3 ms 1356 KB Output is correct
26 Correct 3 ms 1356 KB Output is correct
27 Correct 3 ms 1356 KB Output is correct
28 Correct 6 ms 2252 KB Output is correct
29 Correct 13 ms 3800 KB Output is correct
30 Correct 4 ms 1740 KB Output is correct
31 Correct 7 ms 2608 KB Output is correct
32 Correct 5 ms 2252 KB Output is correct
33 Correct 23 ms 6576 KB Output is correct
34 Correct 24 ms 6564 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 2 ms 972 KB Output is correct
13 Correct 2 ms 972 KB Output is correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 2 ms 1228 KB Output is correct
16 Correct 2 ms 972 KB Output is correct
17 Correct 4 ms 1740 KB Output is correct
18 Correct 1 ms 972 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 2 ms 1100 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 2 ms 1228 KB Output is correct
24 Correct 4 ms 1612 KB Output is correct
25 Correct 3 ms 1356 KB Output is correct
26 Correct 2 ms 1356 KB Output is correct
27 Correct 2 ms 1228 KB Output is correct
28 Correct 6 ms 2252 KB Output is correct
29 Correct 13 ms 3788 KB Output is correct
30 Correct 4 ms 1740 KB Output is correct
31 Correct 7 ms 2600 KB Output is correct
32 Correct 5 ms 2252 KB Output is correct
33 Correct 23 ms 6532 KB Output is correct
34 Correct 26 ms 6584 KB Output is correct
35 Correct 30 ms 6228 KB Output is correct
36 Correct 6 ms 1868 KB Output is correct
37 Correct 43 ms 8564 KB Output is correct
38 Correct 43 ms 8132 KB Output is correct
39 Correct 47 ms 8264 KB Output is correct
40 Correct 48 ms 8160 KB Output is correct
41 Correct 44 ms 8108 KB Output is correct
42 Correct 7 ms 1484 KB Output is correct
43 Correct 7 ms 1472 KB Output is correct
44 Correct 7 ms 1184 KB Output is correct
45 Correct 236 ms 23636 KB Output is correct
46 Correct 222 ms 23652 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 1008 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 2 ms 1228 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 4 ms 1612 KB Output is correct
18 Correct 1 ms 972 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 2 ms 1100 KB Output is correct
21 Correct 1 ms 972 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 3 ms 1280 KB Output is correct
24 Correct 4 ms 1612 KB Output is correct
25 Correct 3 ms 1356 KB Output is correct
26 Correct 3 ms 1356 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 6 ms 2252 KB Output is correct
29 Correct 13 ms 3776 KB Output is correct
30 Correct 5 ms 1740 KB Output is correct
31 Correct 7 ms 2600 KB Output is correct
32 Correct 6 ms 2252 KB Output is correct
33 Correct 25 ms 6620 KB Output is correct
34 Correct 25 ms 6584 KB Output is correct
35 Correct 31 ms 6196 KB Output is correct
36 Correct 6 ms 1868 KB Output is correct
37 Correct 46 ms 8496 KB Output is correct
38 Correct 43 ms 8192 KB Output is correct
39 Correct 44 ms 8208 KB Output is correct
40 Correct 43 ms 8240 KB Output is correct
41 Correct 44 ms 8140 KB Output is correct
42 Correct 7 ms 1484 KB Output is correct
43 Correct 7 ms 1356 KB Output is correct
44 Correct 8 ms 1292 KB Output is correct
45 Correct 240 ms 23632 KB Output is correct
46 Correct 214 ms 23708 KB Output is correct
47 Correct 455 ms 43396 KB Output is correct
48 Correct 7 ms 1612 KB Output is correct
49 Correct 7 ms 1704 KB Output is correct
50 Correct 5 ms 1520 KB Output is correct
51 Correct 111 ms 15728 KB Output is correct
52 Correct 137 ms 16808 KB Output is correct
53 Correct 32 ms 6876 KB Output is correct
54 Correct 3 ms 1740 KB Output is correct
55 Correct 4 ms 2216 KB Output is correct
56 Correct 13 ms 3588 KB Output is correct
57 Correct 158 ms 21896 KB Output is correct
58 Correct 16 ms 4448 KB Output is correct
59 Correct 24 ms 6344 KB Output is correct
60 Correct 30 ms 7096 KB Output is correct
61 Correct 29 ms 6492 KB Output is correct
62 Correct 227 ms 25116 KB Output is correct
63 Execution timed out 1089 ms 106596 KB Time limit exceeded
64 Halted 0 ms 0 KB -