Submission #882401

#	Time	Username	Problem	Language	Result	Execution time	Memory
882401		vjudge1	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	10 / 100	1070 ms	31692 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18 + 7;
void solve(){
    int n,m;
    cin >> n >> m;
    pair < int , int > doge[m];
    for(int i = 0;i<m;i++){
        cin >> doge[i].first >> doge[i].second;
    }
    int dp[m][m];
    for(int i = 0;i<m;i++){
        for(int j = 0;j<m;j++){
            int len = abs(doge[i].first - doge[j].first);
            if(len % doge[i].second == 0)dp[i][j] = len / doge[i].second;
            else dp[i][j] = inf;
        }
    }
    for(int j = 0;j<m;j++){
        for(int i = 0;i<m;i++){
            for(int k = 0;k<m;k++){
                if(dp[i][j] != inf and dp[j][k] != inf){
                    dp[i][k] = min(dp[i][k] , dp[i][j] + dp[j][k]);
                }
            }
        }
    }
    cout << (dp[0][1] == inf ? -1 : dp[0][1]) << endl;
}
signed main(){  
    ios_base::sync_with_stdio(0);cin.tie(0);
    int testcase = 1;//cin >> testcase;
    while(testcase--)solve();
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43