oj.uz

답안 #1097442

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097442 2024-10-07T11:43:02 Z Kerim Jakarta Skyscrapers (APIO15_skyscraper) C++17
0 / 100
 1 ms 424 KB 
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 2e3+5;
const ll INF = 1e18;
bool adj[N][N];
ll dis[N];
 
int main(){
    int n, m;
    scanf("%d%d", &n, &m);
    int s, t;
    for(int i = 1; i <= m; ++i){
        int x, p;
        scanf("%d%d", &x, &p), x++;
        if (i == 1)
            s = x;
        if (i == 2)
            t = x;
        adj[x][p] = 1;
        for(int ad = 1; x-ad*p >= 1 and !adj[x-ad*p][ad]; ++ad)
            adj[x-ad*p][p] = 1;

        for(int ad = 1; x+ad*p <= n and !adj[x+ad*p][ad]; ++ad)
            adj[x+ad*p][p] = 1;

    }
    for(int i = 1; i <= n; ++i)
        dis[i] = INF;
    priority_queue<pli, vector<pli>, greater<pli>> pq;
    pq.push({0, s});
    dis[s] = 0;
    while(!pq.empty()){
        pli P = pq.top();
        pq.pop();
        ll val = P.ff;
        int x = P.ss;
        if(dis[x] != val)
            continue;
        for (int p = 1; p <= n; p++)
            if (adj[x][p]){
                if (x - p >= 1 and umin(dis[x-p], dis[x]+1))
                    pq.push({dis[x-p], x-p});
                if (x + p <= n and umin(dis[x+p], dis[x]+1))
                    pq.push({dis[x+p], x+p});
            }
    }
    if(dis[t] == INF)
        puts("-1");
    else
        printf("%lld\n", dis[t]);
    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp:26:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         scanf("%d%d", &x, &p), x++;
      |         ~~~~~^~~~~~~~~~~~~~~~
skyscraper.cpp:43:12: warning: 's' may be used uninitialized in this function [-Wmaybe-uninitialized]
   43 |     dis[s] = 0;
      |     ~~~~~~~^~~
skyscraper.cpp:59:13: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   59 |     if(dis[t] == INF)
      |        ~~~~~^

Subtask #1
0 / 10.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 43.0

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