제출 #103991

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
103991		LittleFlowers__	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	57 / 100	1052 ms	46728 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(false),cin.tie(nullptr);
#define task "SKYSCRAPER"
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))

const int N=30010;

int n,m;
int b[N],p[N];
queue<ii> q;
vector<int> val[N];
unordered_map<int,int> f[N];

void upd(int x,int y,int z)
{
    if(x-y>=0 && !f[x-y][y]) f[x-y][y]=z+1, q.push({x-y,y});
    if(x+y<n  && !f[x+y][y]) f[x+y][y]=z+1, q.push({x+y,y});
}

main()
{
    //freopen(task".inp","r",stdin);
    //freopen(task".out","w",stdout);
    n=in,m=in;
    forinc(i,1,m) b[i]=in,p[i]=in,val[b[i]].pb(p[i]);
    q.push({b[1],p[1]}); f[b[1]][p[1]]=1;
    while(q.size())
    {
        ii u=q.front(); q.pop(); int x=f[u.fi][u.se];
        if(u.fi==b[2]) return cout<<x-1,0;
        forv(i,val[u.fi]) upd(u.fi,i,x);
        upd(u.fi,u.se,x);
    }
    cout<<-1;
}

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

skyscraper.cpp:36:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^

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