제출 #127523

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
127523		kjp4155	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1076 ms	34408 KiB

skyscraper

#include <bits/stdc++.h>
 
using namespace std;
 
#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a)           cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b)         cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c)       cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d)     cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e)   cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,s,n) cout<<#a<<"=["; printarray(a,s,n); cout<<"]\n"
 
#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){       bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) {     bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){    bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); }
 
void cio(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout << setprecision(15);
}
 
#define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC )
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)
 
#define endl '\n'
 
typedef tuple<int,int,int> t3;
typedef tuple<int,int,int,int> t4;
void die(){printf("NO\n"); exit(0);}
int xx[8] = {1,-1,0,0,1,1,-1,-1}, yy[8] = {0,0,1,-1,1,-1,1,-1};
const ll mod = 1e9+9;
 
const int MX = 210;
 
int N,M, Bsize = 170;
int B[50050], P[50050];
int dist[30200][250];
vector<int> v[30020];
int main(){
    scanf("%d%d",&N,&M);
    rep(i,M) scanf("%d%d", &B[i], &P[i]);
    rep(i,M) v[B[i]].push_back(P[i]);
    for(int i=0;i<30010;i++) {
        sort(all(v[i]));
        v[i].erase(unique(all(v[i])), v[i].end());
    }
    for(int i=0;i<30200;i++) for(int j=0;j<250;j++) dist[i][j] = 1e9;
    
    typedef pair<int,pii> pp;
    priority_queue<pp, vector<pp>, greater<pp>> pq; 

    dist[B[0]][MX] = 0;
    pq.push({0,{B[0], MX}}); 
    while( !pq.empty() ){
        int d,b,p; d = pq.top().Fi, b = pq.top().Se.Fi, p = pq.top().Se.Se;
        pq.pop();
        if( d > dist[b][p] ) continue;

        if( p == MX ){
            for(auto e : v[b]){
                if( e <= Bsize ){
                    if( dist[b][e] > dist[b][p] ){
                        dist[b][e] = dist[b][p];
                        pq.push({dist[b][e], {b,e}});
                    }
                }
                else{
                    for(int i=1;b+e*i<N;i++){
                        if( dist[b+e*i][MX] > dist[b][p] + i ){
                            dist[b+e*i][MX] = dist[b][p] + i;
                            pq.push({dist[b+e*i][MX], {b+e*i, MX}});
                        }
                    }
                    for(int i=-1;b+e*i>=0;i--){
                        if( dist[b+e*i][MX] > dist[b][p] + abs(i) ){
                            dist[b+e*i][MX] = dist[b][p] + abs(i);
                            pq.push({dist[b+e*i][MX], {b+e*i, MX}});
                        }
                    }
                }
            }
        }
        else{
            if( b + p < N && dist[b+p][p] > dist[b][p] + 1 ){
                dist[b+p][p] = dist[b][p] + 1;
                pq.push({dist[b+p][p], {b+p, p}});
            }
            if( b - p >= 0 && dist[b-p][p] > dist[b][p] + 1 ){
                dist[b-p][p] = dist[b][p] + 1;
                pq.push({dist[b-p][p], {b-p, p}});
            }
            
            if( b + p < N && dist[b+p][MX] > dist[b][p] + 1 ){
                dist[b+p][MX] = dist[b][p] + 1;
                pq.push({dist[b+p][MX], {b+p, MX}});
            }
            if( b - p >= 0 && dist[b-p][MX] > dist[b][p] + 1 ){
                dist[b-p][MX] = dist[b][p] + 1;
                pq.push({dist[b-p][MX], {b-p, MX}});
            }
            
        }
    }

    int mn = dist[B[1]][MX];
    for(int i=0;i<MX;i++) mn = min(mn, dist[B[1]][i]); 
    if( mn > 1e8 ) printf("-1\n");
    else printf("%d\n",mn);
}

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

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:77: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:78:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     rep(i,M) 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: 0 / 43