Submission #923927

#TimeUsernameProblemLanguageResultExecution timeMemory
923927ezzzayJakarta Skyscrapers (APIO15_skyscraper)C++14
0 / 100
1 ms348 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define ff first
#define ss second
#define pb push_back
#define inf 1e17
const int N=15;
int arr[N][N];
int cur[N],pw[N];
signed main(){
    int n,m;
    cin>>n>>m;
    vector<int>v;
    for(int i=0;i<m;i++){
        cin>>cur[i]>>pw[i];
        
    }
    if(n==2){
        if(abs(cur[0]-cur[1])%pw[0]){
            cout<<-1;
        }
        else{
            cout<<abs(cur[0]-cur[1])/pw[0];
        }
    }
    else{
        int s=0;
        if(abs(cur[0]-cur[2])%pw[0]){
            cout<<-1;
            return 0;
        }
        else{
            s+=abs(cur[0]-cur[2])/pw[0];
        }
        
        if(abs(cur[2]-cur[1])%pw[2]){
            cout<<-1;
            return 0;
        }
        else{
            s+=abs(cur[2]-cur[1])/pw[2];
        }
        cout<<s;
    }
    
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...