oj.uz

답안 #962498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
962498 2024-04-13T17:20:25 Z BhavayGoyal Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 8 ms 2096 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T> using oset = 
            tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define ll long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"

const int MOD = 1e9+7;
const int inf = 1e9;
const ll linf = 1e18;

const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


// -------------------------------------------------- Main Code --------------------------------------------------

const int N = 3e4+4;
int n, m, power[N], position[N];
vi building[N];

void sol() {
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, p; cin >> x >> p; x++;
        position[i] = x;
        power[i] = p;
        building[x].pb(i);
    }

    // priority_queue<array<int, 3>, vector<array<int, 3>>, greater<>> q;
    deque<array<int, 3>> q;
    q.push_back({0, 1, position[1]}); //  curr dist, curr dogde, curr building
    vii dis(m+1, vi(n+1, inf));
    dis[1][position[1]] = 0;
    while (!q.empty()) {
        array<int, 3> f = q.front(); q.pop_front();
        int currDoge = f[1], currBuild = f[2], dist = f[0];
        if (dist != dis[currDoge][currBuild]) continue;

        if (currDoge == 2) {
            cout << dist << endl; 
            return;
        }

        // go to a differeent doge
        for (auto chDoge : building[currBuild]) {
            if (dis[chDoge][currBuild] > dis[currDoge][currBuild]) {
                dis[chDoge][currBuild] = dis[currDoge][currBuild];
                q.push_front({dis[chDoge][currBuild], chDoge, currBuild});
            }
        }

        // go to next building
        if (power[currDoge] + currBuild <= n) {
            int chBuild = power[currDoge] + currBuild;
            if (dis[currDoge][chBuild] > dis[currDoge][currBuild] + 1) {
                dis[currDoge][chBuild] = dis[currDoge][currBuild] + 1;
                q.push_front({dis[currDoge][chBuild], currDoge, chBuild});
            }
        }

        // go to previous building
        if (currBuild - power[currDoge] >= 1) {
            int chBuild = currBuild - power[currDoge];
            if (dis[currDoge][chBuild] > dis[currDoge][currBuild] + 1) {
                dis[currDoge][chBuild] = dis[currDoge][currBuild] + 1;
                q.push_back({dis[currDoge][chBuild], currDoge, chBuild});
            }
        }
    }

    cout << -1 << endl;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    // cin >> t; 
    while (t--) {
        sol();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1368 KB Output is correct
3 Correct 1 ms 1112 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 928 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 7 ms 2096 KB Output is correct
13 Correct 1 ms 1880 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Incorrect 1 ms 1884 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 7 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Incorrect 1 ms 1884 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 1880 KB Output is correct
12 Correct 8 ms 1880 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Incorrect 1 ms 1884 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 944 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1112 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 7 ms 2092 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Incorrect 1 ms 1884 KB Output isn't correct
16 Halted 0 ms 0 KB -