oj.uz

답안 #959859

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959859 2024-04-09T08:47:25 Z quanlt206 Jakarta Skyscrapers (APIO15_skyscraper) C++17
0 / 100
 1 ms 604 KB 
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 2e3 + 7;

int n, m, d[N][N], a[N], b[N];

vector<int> v[N];

int col0 = 0, col1 = 1;

void bfs(int s, int x, int t) {
    deque<pii> dq;
    FOR(i, 0, n)
        FOR(j, 0, n) d[i][j] = 1e9;
    dq.push_front({s, x});
    d[s][x] = 0;
    while (!dq.empty()) {
        pii tmp = dq.front();
        dq.pop_front();
        int x = tmp.X, y = tmp.Y;
        if (x == col1) {
            cout<<d[x][y];
            exit(0);
        }
        for (auto a : v[x])
            if (minimize(d[x][a], d[x][y])) dq.push_front({x, a});
        if (x - y >= 0 && minimize(d[x - y][y], d[x][y] + 1)) dq.push_back({x - y, y});
        if (x + y < n && minimize(d[x + y][y], d[x][y] + 1)) dq.push_back({x + y, y});
    }
    cout<<-1;
}

int main() {
//    freopen("APIO15_SKYSCRAPER.inp", "r", stdin);
//    freopen("APIO15_SKYSCRAPER.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m;
    REP(i, 0, m) {
        cin>>a[i]>>b[i];
        v[a[i]].push_back(b[i]);
    }
    bfs(a[0], b[0], a[1]);
    return 0;

}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Incorrect 1 ms 520 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 516 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -