Submission #111002

#	Time	Username	Problem	Language	Result	Execution time	Memory
111002		_demon_	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	10 / 100	3 ms	412 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
int n,m;
int a[19];
int p[19];
set<int>s;
int solve1(){
    int x=abs(a[0]-a[1]);
    if(x%p[0]==0) return x/p[0];
    else return -1;
}
int solve2(){
    int x=abs(a[0]-a[2]);
    int ans=0;
    if(x%p[0]!=0) return -1;
    ans+=x/p[0];
    int xx=abs(a[2]-a[1]);
    if(xx%p[2]!=0) return -1;
    return ans+xx/p[2];
}
int main(){
    cin>>n>>m;
    for(int i=0;i<m;i++){
        cin>>a[i]>>p[i];
    }
    if(m==2){
        cout<<solve1()<<endl;
        exit(0);
    }
    int x=solve1();
    int xx=solve2();
    s.insert(x);
    s.insert(xx);
    s.erase(-1);
    if(s.size()==0) cout<<-1<<endl;
    else cout<<*s.begin()<<endl;
}

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