oj.uz

Submission #89283

# Submission time Handle Problem Language Result Execution time Memory
89283 2018-12-11T10:33:17 Z Mouhanad_Hafez Jakarta Skyscrapers (APIO15_skyscraper) C++11
10 / 100
 3 ms 1076 KB 
#include <bits/stdc++.h>
using namespace std;
long long int n,m,B[30005],P[30005];
queue< pair<long long,long long> > q;
int vis[30005];
int main(){
    cin>>n>>m;
    for(int i=0;i<m;i++){
        cin>>B[i]>>P[i];
    }
    q.push({0,0});
    while(!q.empty()){
        pair<long long,long long>temp=q.front();
        q.pop();
        long long int loc=temp.second;
        long long int pwr=temp.first;
        if(vis[loc]) continue;
        vis[loc]=1;
        if(B[loc]==B[1]){
            cout<<pwr;
            return 0;
        }
        for(int i=0;i<m;i++){
            if(abs(B[i]-B[loc])%P[loc]==0){
                q.push({(pwr+abs(B[i]-B[loc])/P[loc]),i});
            }
        }
    }
    cout<<-1;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 532 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 2 ms 632 KB Output is correct
5 Correct 2 ms 632 KB Output is correct
6 Correct 2 ms 688 KB Output is correct
7 Correct 2 ms 692 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 940 KB Output is correct
2 Correct 2 ms 940 KB Output is correct
3 Correct 2 ms 940 KB Output is correct
4 Correct 2 ms 940 KB Output is correct
5 Correct 2 ms 940 KB Output is correct
6 Correct 2 ms 940 KB Output is correct
7 Correct 2 ms 940 KB Output is correct
8 Correct 2 ms 1076 KB Output is correct
9 Incorrect 2 ms 1076 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 1076 KB Output is correct
2 Correct 2 ms 1076 KB Output is correct
3 Correct 2 ms 1076 KB Output is correct
4 Correct 2 ms 1076 KB Output is correct
5 Correct 2 ms 1076 KB Output is correct
6 Correct 2 ms 1076 KB Output is correct
7 Correct 2 ms 1076 KB Output is correct
8 Correct 2 ms 1076 KB Output is correct
9 Incorrect 2 ms 1076 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

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