oj.uz

Submission #979760

# Submission time Handle Problem Language Result Execution time Memory
979760 2024-05-11T10:49:31 Z VMaksimoski008 Jakarta Skyscrapers (APIO15_skyscraper) C++17
10 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

int main() {
    int n, m;
    cin >> n >> m;

    vector<int> mp[n+1], B(n+1), P(n+1);
    for(int i=0; i<m; i++) {
        cin >> B[i] >> P[i];
        mp[++B[i]].push_back(P[i]);
    }

    priority_queue<pii, vector<pii>, greater<pii> > pq;
    vector<bool> vis(n+1); vector<int> dist(n+1, 1e9);

    dist[B[0]] = 0;
    pq.push({ 0, B[0] });

    while(!pq.empty()) {
        auto [d, u] = pq.top();
        pq.pop();

        if(vis[u]) continue;
        vis[u] = 1;

        for(int &j : mp[u]) {
            int v = u + j;
            while(v <= n) {
                if(dist[v] > dist[u] + (v - u) / j) {
                    dist[v] = dist[u] + (v - u) / j;
                    pq.push({ dist[v], v });
                }
                v += j;
            }

            v = u - j;
            while(v >= 1) {
                if(dist[v] > dist[u] + (u - v) / j) {
                    dist[v] = dist[u] + (u - v) / j;
                    pq.push({ dist[v], v });
                }
                v -= j;
            }
        }
    }

    cout << (dist[B[1]] == 1e9 ? -1 : dist[B[1]]) << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 436 KB Output is correct
2 Correct 1 ms 440 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Runtime error 1 ms 348 KB Execution killed with signal 6
11 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 432 KB Output is correct
10 Runtime error 1 ms 348 KB Execution killed with signal 6
11 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Runtime error 1 ms 348 KB Execution killed with signal 6
11 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 0 ms 440 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Runtime error 1 ms 348 KB Execution killed with signal 6
11 Halted 0 ms 0 KB -