Submission #112275

# Submission time Handle Problem Language Result Execution time Memory
112275 2019-05-18T12:27:18 Z dolphingarlic Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
9 ms 7808 KB
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define FOR(i, x, y) for (ll i = x; i < y; i++)
typedef long long ll;
using namespace std;

struct Doge {
    ll jumps, pos, size, direction;
};

vector<pair<ll, ll>> sky[300001];
bool visited[300001];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    fill(visited, visited + 300001, false);
    ll n, m;
    cin >> n >> m;
    ll size = 0, pos = 0;
    FOR(i, 0, m) {
        ll a, b;
        cin >> a >> b;
        sky[a].push_back({i, b});
        if (i == 0) size = b, pos = a;
    }

    queue<Doge> q;
    q.push({0, pos, size, 1});
    while (!q.empty()) {
        Doge curr = q.front();
        q.pop();
        bool push = true;
        // cout << curr.jumps << ' ' << curr.pos << ' ' << curr.size << ' '
        //      << curr.direction << '\n';

        if (curr.pos > -1 && curr.pos < n && !visited[curr.pos]) {
            visited[curr.pos] = true;
            for (auto& i : sky[curr.pos]) {
                if (i.first == 1) return cout << curr.jumps << '\n', 0;
                if (i.second != curr.size) {
                    q.push({curr.jumps + 1, curr.pos + i.second, i.second, 1});
                    q.push({curr.jumps + 1, curr.pos - i.second, i.second, 0});
                }
            }
        } else {
            for (auto& i : sky[curr.pos + curr.size]) {
                if (i.second == curr.size) {
                    push = false;
                }
            }
        }
        if (push && curr.direction && curr.pos + curr.size < n)
            q.push({curr.jumps + 1, curr.pos + curr.size, curr.size, 1});
        else if (push && !curr.direction && curr.pos - curr.size > -1)
            q.push({curr.jumps + 1, curr.pos - curr.size, curr.size, 0});
    }
    cout << "-1\n";
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 7 ms 7680 KB Output is correct
2 Correct 7 ms 7680 KB Output is correct
3 Correct 7 ms 7680 KB Output is correct
4 Correct 7 ms 7680 KB Output is correct
5 Correct 7 ms 7680 KB Output is correct
6 Correct 7 ms 7680 KB Output is correct
7 Correct 8 ms 7680 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 7680 KB Output is correct
2 Correct 7 ms 7680 KB Output is correct
3 Correct 7 ms 7680 KB Output is correct
4 Correct 7 ms 7680 KB Output is correct
5 Correct 7 ms 7680 KB Output is correct
6 Correct 8 ms 7680 KB Output is correct
7 Correct 7 ms 7680 KB Output is correct
8 Correct 8 ms 7680 KB Output is correct
9 Correct 8 ms 7680 KB Output is correct
10 Correct 8 ms 7680 KB Output is correct
11 Correct 8 ms 7680 KB Output is correct
12 Incorrect 9 ms 7680 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 8 ms 7680 KB Output is correct
2 Correct 7 ms 7680 KB Output is correct
3 Correct 8 ms 7680 KB Output is correct
4 Correct 7 ms 7680 KB Output is correct
5 Correct 7 ms 7680 KB Output is correct
6 Correct 7 ms 7680 KB Output is correct
7 Correct 8 ms 7680 KB Output is correct
8 Correct 7 ms 7652 KB Output is correct
9 Correct 7 ms 7680 KB Output is correct
10 Correct 8 ms 7680 KB Output is correct
11 Correct 9 ms 7808 KB Output is correct
12 Incorrect 7 ms 7672 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 7 ms 7680 KB Output is correct
2 Correct 7 ms 7680 KB Output is correct
3 Correct 7 ms 7680 KB Output is correct
4 Correct 7 ms 7680 KB Output is correct
5 Correct 7 ms 7680 KB Output is correct
6 Correct 8 ms 7680 KB Output is correct
7 Correct 7 ms 7680 KB Output is correct
8 Correct 7 ms 7680 KB Output is correct
9 Correct 8 ms 7680 KB Output is correct
10 Correct 7 ms 7680 KB Output is correct
11 Correct 7 ms 7680 KB Output is correct
12 Incorrect 7 ms 7808 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 7 ms 7680 KB Output is correct
2 Correct 7 ms 7680 KB Output is correct
3 Correct 7 ms 7680 KB Output is correct
4 Correct 7 ms 7680 KB Output is correct
5 Correct 7 ms 7680 KB Output is correct
6 Correct 8 ms 7680 KB Output is correct
7 Correct 7 ms 7680 KB Output is correct
8 Correct 7 ms 7680 KB Output is correct
9 Correct 7 ms 7680 KB Output is correct
10 Correct 7 ms 7680 KB Output is correct
11 Correct 8 ms 7680 KB Output is correct
12 Incorrect 8 ms 7680 KB Output isn't correct
13 Halted 0 ms 0 KB -