oj.uz

Submission #232489

# Submission time Handle Problem Language Result Execution time Memory
232489 2020-05-17T07:41:32 Z balbit Jakarta Skyscrapers (APIO15_skyscraper) C++14
0 / 100
 5 ms 436 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<" - ", _do(__VA_ARGS__)
template<typename T> void _do(T && x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y){cerr<<x<<", "; _do(y...);}
#define IOS()

#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#endif // BALBIT

#define pii pair<int, int>
#define f first
#define s second

#define ALL(x) x.begin(), x.end()
#define SZ(x) (int)(x.size())
#define pb push_back

const int maxn = 2005;
vector<pii> g[maxn];
int d[maxn];
set<pii> bp;

signed main(){
    IOS();
    int n,m; cin>>n>>m;
    int S = -1, T = -1;
    for (int i = 0; i<m; ++i) {
        int b,p; cin>>b>>p;
        if (i == 0) S = b;
        if (i == 1) T = b;
        if (bp.count({b,p})) continue;
        bp.insert({b,p});
        for (int j = 0; j<n; ++j) {
            if ((j-b) % p == 0 && j!=b) {
                g[b].pb({j,abs(j-b)/p});
            }
        }
    }
    memset(d, 0x3f, sizeof d);
    d[S] = 0;
    priority_queue<pii, vector<pii>, greater<pii> > pq;
    pq.push({0,S});
    while (!pq.empty()) {
        int v = pq.top().s; int w = pq.top().f; pq.pop();
        bug(v, d[v]);
        if (d[v] != w) {
            continue;
        }
        for (pii u : g[v]) {
            if (d[u.f] > d[v] + u.s) {
                d[u.f] = d[v] + u.s;
                pq.push({d[u.f], u.f});
            }
        }
    }
    cout<<d[T]<<endl;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Incorrect 5 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 416 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Incorrect 5 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 436 KB Output is correct
4 Incorrect 5 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Incorrect 4 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Incorrect 4 ms 384 KB Output isn't correct
5 Halted 0 ms 0 KB -