oj.uz

Submission #839349

# Submission time Handle Problem Language Result Execution time Memory
839349 2023-08-29T19:20:32 Z popovicirobert Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
 
using namespace std;

constexpr int MAXN = 30'000;
constexpr int MAXP = 30'000;

bitset<MAXP + 1> visited[MAXN];

struct Node {
    unsigned short b, p;
    int dist;
};
 
int main() {
#ifdef HOME
    ifstream cin("input.in");
    ofstream cout("output.out");
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
 
    int n, m;
    cin >> n >> m;

    vector<unsigned short> b(m), p(m);
    vector<unsigned short> P(n);
    for (int i = 0; i < m; i++) {
        cin >> b[i] >> p[i];
        P[b[i]] = p[i];
    }

    deque<Node> Q;
    Q.push_front({b[0], p[0], 0});
    visited[b[0]][p[0]] = true;

    while (Q.size()) {
        auto curr = Q.front();
        Q.pop_front();

        auto Go = [&Q](int b, int p, int dist, bool front) {
            if (!visited[b][p]) {
                if (front) {
                    Q.push_front({b, p, dist});
                } else {
                    Q.push_back({b, p, dist});
                }
                visited[b][p] = true;
            }
        };

        if (curr.b == b[1]) {
            cout << curr.dist << "\n";
            return 0;
        }

        Go(curr.b, P[curr.b], curr.dist, true);
        if (curr.b >= curr.p) {
            Go(curr.b - curr.p, curr.p, curr.dist + 1, false);
        }
        if (curr.b + curr.p < n) {
            Go(curr.b + curr.p, curr.p, curr.dist + 1, false);
        }
    }

    cout << -1 << "\n";
 
    return 0;
}

Compilation message

skyscraper.cpp: In lambda function:
skyscraper.cpp:44:35: warning: narrowing conversion of 'b' from 'int' to 'short unsigned int' [-Wnarrowing]
   44 |                     Q.push_front({b, p, dist});
      |                                   ^
skyscraper.cpp:44:38: warning: narrowing conversion of 'p' from 'int' to 'short unsigned int' [-Wnarrowing]
   44 |                     Q.push_front({b, p, dist});
      |                                      ^
skyscraper.cpp:46:34: warning: narrowing conversion of 'b' from 'int' to 'short unsigned int' [-Wnarrowing]
   46 |                     Q.push_back({b, p, dist});
      |                                  ^
skyscraper.cpp:46:37: warning: narrowing conversion of 'p' from 'int' to 'short unsigned int' [-Wnarrowing]
   46 |                     Q.push_back({b, p, dist});
      |                                     ^

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 284 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Halted 0 ms 0 KB -