제출 #1034050

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1034050		DucNguyen2007	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	10 / 100	10 ms	16140 KiB

skyscraper

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define fi first
#define se second
const int maxN=3e4+5;
const ll inf=2e18;
int n,m,b[maxN+1],p[maxN+1];
namespace sub2
{
    int d[2001][2001];
    struct node
    {
        int u,power;
    };
    queue<node> q;
    void solve()
    {
        memset(d,-1,sizeof(d));
        q.push({b[0],p[0]});
        d[b[0]][p[0]]=0;
        ll dem=0;
        while(!q.empty())
        {
            node tmp=q.front();
            q.pop();
            int u=tmp.u,power=tmp.power;
            //cout<<u<<" "<<power<<'\n';
            if(u==b[1])
            {
                cout<<d[u][power];
                return;
            }
            if(u+power<n)
            {
                if(d[u+power][power]==-1)
                {
                    d[u+power][power]=d[u][power]+1;
                    q.push({u+power,power});
                }
            }
            if(u-power>=0)
            {
                if(d[u-power][power]==-1)
                {
                    d[u-power][power]=d[u][power]+1;
                    q.push({u-power,power});
                }
            }
            for(int i=0;i<m;i++)
            {
                if(b[i]==u)
                {
                    if(d[u][p[i]]==-1)
                    {
                        d[u][p[i]]=d[u][power];
                        q.push({u,p[i]});
                    }
                }
            }
        }
        cout<<-1;
    }
}
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        cin>>b[i]>>p[i];
    }
    sub2::solve();
}

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

skyscraper.cpp: In function 'void sub2::solve()':
skyscraper.cpp:23:12: warning: unused variable 'dem' [-Wunused-variable]
   23 |         ll dem=0;
      |            ^~~

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