제출 #45448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
45448		RayaBurong25_1	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	100 / 100	555 ms	121124 KiB

skyscraper

#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#define INF 1000000007
int B[30005], P[30005];
int abs(int a)
{
    return (a < 0)?-a:a;
}
long long Vis[30005][505];
typedef struct node node;
struct node
{
    int u, j, t;
};
std::vector<int> J[30005];
std::queue<node> Q;
int main()
{
    int N, M;
    scanf("%d %d", &N, &M);
    int i;
    node p;
    for (i = 0; i < M; i++)
    {
        scanf("%d %d", &B[i], &P[i]);
        if (i == 0)
            p = {B[i], P[i], 0};
        else
            J[B[i]].push_back(P[i]);
    }
    Vis[B[0]][P[i]/60] |= (1LL << (P[i]%60));
    Q.push(p);
    int w;
    while (!Q.empty())
    {
        p = Q.front();
        Q.pop();
        // printf("pop %d %d %d\n", p.u, p.j, p.t);
        if (p.u == B[1])
        {
            printf("%d", p.t);
            return 0;
        }

        if (p.u + p.j < N && (Vis[p.u + p.j][p.j/60]&(1LL << (p.j%60))) == 0)
        {
            Vis[p.u + p.j][p.j/60] |= (1LL << (p.j%60));
            Q.push({p.u + p.j, p.j, p.t + 1});
        }
        if (p.u - p.j >= 0 && (Vis[p.u - p.j][p.j/60]&(1LL << (p.j%60))) == 0)
        {
            Vis[p.u - p.j][p.j/60] |= (1LL << (p.j%60));
            Q.push({p.u - p.j, p.j, p.t + 1});
        }
        for (i = 0; i < J[p.u].size(); i++)
        {
            w = J[p.u][i];
            if (p.u + w < N && (Vis[p.u + w][w/60]&(1LL << (w%60))) == 0)
            {
                Vis[p.u + w][w/60] |= (1LL << (w%60));
                Q.push({p.u + w, w, p.t + 1});
            }
            if (p.u - w >= 0 && (Vis[p.u - w][w/60]&(1LL << (w%60))) == 0)
            {
                Vis[p.u - w][w/60] |= (1LL << (w%60));
                Q.push({p.u - w, w, p.t + 1});
            }
        }
    }
    printf("-1");
}

컴파일 시 표준 에러 (stderr) 메시지

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:57:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < J[p.u].size(); i++)
                     ~~^~~~~~~~~~~~~~~
skyscraper.cpp:22: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:27:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &B[i], &P[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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