oj.uz

Submission #960683

# Submission time Handle Problem Language Result Execution time Memory
960683 2024-04-10T22:43:47 Z 3omar_ahmed Jakarta Skyscrapers (APIO15_skyscraper) C++17
10 / 100
 27 ms 94848 KB 
#include <bits/stdc++.h>
using namespace std ;
#define int long long
#define endl '\n'
#define all(a) a.begin() , a.end()
#define alr(a) a.rbegin() , a.rend()
const int N = 2003;
vector < int > dis(N, 1e12);
vector < vector < pair < int , int >>> adj((N + 2) * (N + 2));
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);

    int n, m;
    cin >> n >> m;
    pair < int , int > first, second;
    vector < vector < int >> arr(1 + n);
    for(int i = 0 ; i < m ; i++) {
        int a, b;
        cin >> a >> b;
        if(i == 0) {
            first = {a, b};
        } else if(i == 1) {
            second = {a, b};
        }
        arr[a].push_back(b);
    }
    for(int i = 0 ; i < n ; i++) {
        for(auto j : arr[i]) {
            int node = (i * (n + 1) + j);
            adj[i * (n + 1) + n + 1].push_back({node, 0});
            adj[node].push_back({i * (n + 1) + n + 1, 0});
            for(int k = 1 ; k <= n ; k++) {
                if(i + j * k < n) {
                    adj[node].push_back({(i + j * k) * (n + 1) + n + 1, k});
                }
                if(i - j * k >= 0) {
                    adj[node].push_back({(i - j * k) * (n + 1) + n + 1, k});
                }
            }
        }
    }
    int st = first.first * (n + 1) + first.second;
    priority_queue < pair < int , int >> pq;
    pq.push({0, st});
    dis[st] = 0; 
    while(pq.size()) {
        auto top = pq.top();
        pq.pop();
        top.first *= -1;
        if(top.first != dis[top.second])
            continue;
        for(auto ch : adj[top.second]) {
            if(dis[ch.first] > top.first + ch.second) {
                dis[ch.first] = top.first + ch.second;
                pq.push({-dis[ch.first], ch.first});
            }
        }
    }
    int ed = second.first * (n + 1) + second.second;
    if(dis[ed] >= 1e10) dis[ed] = -1;
    cout << dis[ed] << endl;
    return 0 ;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 94808 KB Output is correct
2 Correct 24 ms 94808 KB Output is correct
3 Correct 22 ms 94808 KB Output is correct
4 Correct 22 ms 94812 KB Output is correct
5 Correct 23 ms 94768 KB Output is correct
6 Correct 23 ms 94692 KB Output is correct
7 Correct 23 ms 94812 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 94812 KB Output is correct
2 Correct 22 ms 94812 KB Output is correct
3 Correct 24 ms 94808 KB Output is correct
4 Correct 23 ms 94812 KB Output is correct
5 Correct 23 ms 94848 KB Output is correct
6 Correct 22 ms 94812 KB Output is correct
7 Correct 24 ms 94812 KB Output is correct
8 Correct 26 ms 94804 KB Output is correct
9 Incorrect 23 ms 94812 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 94812 KB Output is correct
2 Correct 23 ms 94812 KB Output is correct
3 Correct 23 ms 94836 KB Output is correct
4 Correct 23 ms 94740 KB Output is correct
5 Correct 23 ms 94788 KB Output is correct
6 Correct 23 ms 94812 KB Output is correct
7 Correct 23 ms 94812 KB Output is correct
8 Correct 26 ms 94812 KB Output is correct
9 Incorrect 24 ms 94812 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 94804 KB Output is correct
2 Correct 23 ms 94696 KB Output is correct
3 Correct 23 ms 94812 KB Output is correct
4 Correct 24 ms 94812 KB Output is correct
5 Correct 22 ms 94812 KB Output is correct
6 Correct 22 ms 94676 KB Output is correct
7 Correct 23 ms 94812 KB Output is correct
8 Correct 22 ms 94808 KB Output is correct
9 Incorrect 22 ms 94808 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 94836 KB Output is correct
2 Correct 24 ms 94812 KB Output is correct
3 Correct 22 ms 94812 KB Output is correct
4 Correct 23 ms 94812 KB Output is correct
5 Correct 23 ms 94808 KB Output is correct
6 Correct 22 ms 94808 KB Output is correct
7 Correct 25 ms 94672 KB Output is correct
8 Correct 23 ms 94812 KB Output is correct
9 Incorrect 24 ms 94820 KB Output isn't correct
10 Halted 0 ms 0 KB -