oj.uz

답안 #73647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
73647 2018-08-28T16:15:39 Z Vardanyan Jakarta Skyscrapers (APIO15_skyscraper) C++14
0 / 100
 4 ms 1268 KB 
//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
const int N = 30007;
vector<pair<int,int> > g[N];
int B[N],P[N];
int dist[N];
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i = 0;i<m;i++){
        int b,p;
        scanf("%d%d",&b,&p);
        int bb = b;
        int c = 1;
        while(bb+p<n){
            bb+=p;
            g[b].push_back({bb,c});
            c++;
        }
        bb = b;
        c = 1;
        while(bb-p>=0){
            bb-=p;
            g[b].push_back({bb,c});
            c++;
        }
    }
    priority_queue<pair<int,int> > pq;
    dist[0] = 0;
    for(int i = 1;i<=n;i++) dist[i] = 1000*1000*1000+7;
    pq.push({0,0});
    while(!pq.empty()){
        pair<int,int> v = pq.top();
        pq.pop();
        int gag = v.second;
        for(int i = 0;i<g[gag].size();i++){
            int to = g[gag][i].first;
            int d = g[gag][i].second;
            if(d+(-v.first)<dist[to]){
                dist[to] = d+(-v.first);
                pq.push({-dist[to],to});
            }
        }
    }
    if(dist[1] == 1000*1000*1000+7) dist[1] = -1;
    cout<<dist[1]<<endl;
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:38:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0;i<g[gag].size();i++){
                       ~^~~~~~~~~~~~~~
skyscraper.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
skyscraper.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&b,&p);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1016 KB Output is correct
2 Incorrect 3 ms 1256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1256 KB Output is correct
2 Incorrect 3 ms 1268 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1268 KB Output is correct
2 Incorrect 3 ms 1268 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1268 KB Output is correct
2 Incorrect 3 ms 1268 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1268 KB Output is correct
2 Incorrect 3 ms 1268 KB Output isn't correct
3 Halted 0 ms 0 KB -