oj.uz

Submission #111002

# Submission time Handle Problem Language Result Execution time Memory
111002 2019-05-13T14:14:33 Z _demon_ Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 3 ms 412 KB 
#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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Incorrect 2 ms 256 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 412 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Incorrect 3 ms 384 KB Output isn't correct
10 Halted 0 ms 0 KB -