oj.uz

Submission #244804

# Submission time Handle Problem Language Result Execution time Memory
244804 2020-07-05T05:42:58 Z knightron0 Jakarta Skyscrapers (APIO15_skyscraper) C++14
0 / 100
 9 ms 5888 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define printarray(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define rep(n) for (ll i = 0; i < n; i++)
#define repc(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define alla(a, n) a, a + n
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b)/gcd(a, b)
#define int long long int
#define ull unsigned long long

using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
const int INF = 2e10 + 10;

int fastexpo(int b, int exp){
    if(exp == 0) return 1;
    if(exp == 1) return b;
    int ans = (fastexpo(b,exp/2) % MOD);
    ans *= ans;
    ans %= MOD;
    if(exp % 2 == 1){
        ans *= b;
    }
    ans %= MOD;
    return ans;
}

vector<pair<int, int> > adj[MAXN];
int dist[MAXN];
int vis[MAXN] = {false};

void dstra(){
    for(int i = 0;i<MAXN;i++){
        dist[i] = INF;
    }
    priority_queue<pair<int, int> > q;
    q.push(mp(0, 0));
    dist[0] = 0;

    while(!q.empty()){
        int a = q.top().sc;
        q.pop();
        if(vis[a]){
            continue;
        }
        vis[a] = true;
        for(auto v: adj[a]){
            int b = v.fr;
            int w = v.sc;
            if(dist[a]+w < dist[b]){
                dist[b] = dist[a]+w;
                q.push(mp(-dist[b], b));
            }
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
  
    vector<int> pos[MAXN];
    int n, m;
    cin>>n>>m;

    for(int i= 0;i<m;i++){
    	int t1, t2;
    	cin>>t1>>t2;
        pos[t1].pb(t2);
    }
    for(int i = 0;i<n;i++){
        for(int j = 0;j<n;j++){
            int dist = abs(i-j);
            int min1 = INT_MAX;
            int min2 = INT_MAX;
            for(int x: pos[i]){
                if(dist % x == 0){
                    min1 = min(min1, dist/x);
                }
            }
            for(int x: pos[j]){
                if(dist % x == 0){
                    min2 = min(min2, dist/x);
                }
            }
            if(min1 != INT_MAX){
                adj[i].pb(mp(j, min1));
            }
            if(min2 != INT_MAX){
                adj[j].pb(mp(i, min2));
            }
        }
    }
    dstra();
    cout<<dist[1]<<endl;
    
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5760 KB Output is correct
2 Incorrect 9 ms 5760 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5888 KB Output is correct
2 Incorrect 8 ms 5888 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5760 KB Output is correct
2 Incorrect 7 ms 5888 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5760 KB Output is correct
2 Incorrect 8 ms 5760 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5792 KB Output is correct
2 Incorrect 7 ms 5760 KB Output isn't correct
3 Halted 0 ms 0 KB -