oj.uz

답안 #127530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
127530 2019-07-09T13:48:35 Z kjp4155 Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 929 ms 34536 KB 
#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[250][30200];
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[j][i] = 1e9;
    
    typedef pair<int,pii> pp;
    priority_queue<pp, vector<pp>, greater<pp>> pq; 

    dist[MX][B[0]] = 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[p][b] ) continue;

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

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

Compilation message

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.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 30712 KB Output is correct
2 Correct 41 ms 30584 KB Output is correct
3 Correct 43 ms 30612 KB Output is correct
4 Correct 41 ms 30712 KB Output is correct
5 Correct 41 ms 30584 KB Output is correct
6 Correct 41 ms 30584 KB Output is correct
7 Correct 42 ms 30584 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 30540 KB Output is correct
2 Correct 40 ms 30556 KB Output is correct
3 Correct 41 ms 30556 KB Output is correct
4 Correct 41 ms 30524 KB Output is correct
5 Correct 51 ms 30584 KB Output is correct
6 Correct 42 ms 30584 KB Output is correct
7 Correct 41 ms 30584 KB Output is correct
8 Correct 41 ms 30552 KB Output is correct
9 Correct 42 ms 30584 KB Output is correct
10 Correct 41 ms 30584 KB Output is correct
11 Correct 43 ms 30712 KB Output is correct
12 Correct 41 ms 30556 KB Output is correct
13 Correct 41 ms 30584 KB Output is correct
14 Correct 43 ms 30688 KB Output is correct
15 Correct 42 ms 30812 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 30584 KB Output is correct
2 Correct 42 ms 30516 KB Output is correct
3 Correct 42 ms 30624 KB Output is correct
4 Correct 41 ms 30584 KB Output is correct
5 Correct 48 ms 30584 KB Output is correct
6 Correct 47 ms 30556 KB Output is correct
7 Correct 49 ms 30556 KB Output is correct
8 Correct 42 ms 30584 KB Output is correct
9 Correct 41 ms 30584 KB Output is correct
10 Correct 41 ms 30584 KB Output is correct
11 Correct 42 ms 30624 KB Output is correct
12 Correct 42 ms 30584 KB Output is correct
13 Correct 41 ms 30584 KB Output is correct
14 Correct 42 ms 30712 KB Output is correct
15 Correct 43 ms 30672 KB Output is correct
16 Correct 41 ms 30584 KB Output is correct
17 Correct 44 ms 30584 KB Output is correct
18 Correct 41 ms 30584 KB Output is correct
19 Correct 40 ms 30584 KB Output is correct
20 Correct 41 ms 30584 KB Output is correct
21 Correct 48 ms 30584 KB Output is correct
22 Correct 45 ms 30584 KB Output is correct
23 Correct 43 ms 30584 KB Output is correct
24 Correct 43 ms 30584 KB Output is correct
25 Correct 41 ms 30584 KB Output is correct
26 Correct 42 ms 30584 KB Output is correct
27 Correct 42 ms 30652 KB Output is correct
28 Correct 42 ms 30584 KB Output is correct
29 Correct 49 ms 30712 KB Output is correct
30 Correct 43 ms 30504 KB Output is correct
31 Correct 44 ms 30584 KB Output is correct
32 Correct 44 ms 30712 KB Output is correct
33 Correct 56 ms 30716 KB Output is correct
34 Correct 58 ms 30712 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 30544 KB Output is correct
2 Correct 41 ms 30584 KB Output is correct
3 Correct 46 ms 30584 KB Output is correct
4 Correct 41 ms 30584 KB Output is correct
5 Correct 42 ms 30500 KB Output is correct
6 Correct 41 ms 30584 KB Output is correct
7 Correct 41 ms 30544 KB Output is correct
8 Correct 41 ms 30584 KB Output is correct
9 Correct 41 ms 30584 KB Output is correct
10 Correct 42 ms 30584 KB Output is correct
11 Correct 42 ms 30712 KB Output is correct
12 Correct 41 ms 30648 KB Output is correct
13 Correct 41 ms 30680 KB Output is correct
14 Correct 42 ms 30716 KB Output is correct
15 Correct 43 ms 30840 KB Output is correct
16 Correct 41 ms 30584 KB Output is correct
17 Correct 47 ms 30712 KB Output is correct
18 Correct 42 ms 30616 KB Output is correct
19 Correct 41 ms 30588 KB Output is correct
20 Correct 42 ms 30712 KB Output is correct
21 Correct 41 ms 30584 KB Output is correct
22 Correct 42 ms 30760 KB Output is correct
23 Correct 42 ms 30556 KB Output is correct
24 Correct 43 ms 30712 KB Output is correct
25 Correct 42 ms 30584 KB Output is correct
26 Correct 42 ms 30584 KB Output is correct
27 Correct 41 ms 30584 KB Output is correct
28 Correct 42 ms 30584 KB Output is correct
29 Correct 51 ms 30712 KB Output is correct
30 Correct 43 ms 30584 KB Output is correct
31 Correct 45 ms 30684 KB Output is correct
32 Correct 43 ms 30584 KB Output is correct
33 Correct 57 ms 30676 KB Output is correct
34 Correct 58 ms 30712 KB Output is correct
35 Correct 58 ms 31096 KB Output is correct
36 Correct 44 ms 30712 KB Output is correct
37 Correct 68 ms 31224 KB Output is correct
38 Correct 64 ms 31224 KB Output is correct
39 Correct 65 ms 31224 KB Output is correct
40 Correct 66 ms 31224 KB Output is correct
41 Correct 64 ms 31224 KB Output is correct
42 Correct 48 ms 31024 KB Output is correct
43 Correct 47 ms 31096 KB Output is correct
44 Correct 47 ms 31068 KB Output is correct
45 Correct 102 ms 31672 KB Output is correct
46 Correct 102 ms 31544 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 30584 KB Output is correct
2 Correct 42 ms 30580 KB Output is correct
3 Correct 40 ms 30584 KB Output is correct
4 Correct 42 ms 30584 KB Output is correct
5 Correct 43 ms 30500 KB Output is correct
6 Correct 42 ms 30584 KB Output is correct
7 Correct 42 ms 30584 KB Output is correct
8 Correct 41 ms 30584 KB Output is correct
9 Correct 41 ms 30584 KB Output is correct
10 Correct 42 ms 30584 KB Output is correct
11 Correct 42 ms 30684 KB Output is correct
12 Correct 42 ms 30584 KB Output is correct
13 Correct 41 ms 30556 KB Output is correct
14 Correct 42 ms 30584 KB Output is correct
15 Correct 45 ms 30660 KB Output is correct
16 Correct 41 ms 30640 KB Output is correct
17 Correct 44 ms 30604 KB Output is correct
18 Correct 42 ms 30584 KB Output is correct
19 Correct 42 ms 30588 KB Output is correct
20 Correct 43 ms 30712 KB Output is correct
21 Correct 42 ms 30584 KB Output is correct
22 Correct 41 ms 30588 KB Output is correct
23 Correct 42 ms 30556 KB Output is correct
24 Correct 44 ms 30768 KB Output is correct
25 Correct 42 ms 30556 KB Output is correct
26 Correct 42 ms 30556 KB Output is correct
27 Correct 42 ms 30584 KB Output is correct
28 Correct 44 ms 30712 KB Output is correct
29 Correct 48 ms 30584 KB Output is correct
30 Correct 44 ms 30584 KB Output is correct
31 Correct 46 ms 30584 KB Output is correct
32 Correct 45 ms 30588 KB Output is correct
33 Correct 58 ms 30712 KB Output is correct
34 Correct 56 ms 30712 KB Output is correct
35 Correct 60 ms 31096 KB Output is correct
36 Correct 45 ms 30712 KB Output is correct
37 Correct 65 ms 31096 KB Output is correct
38 Correct 66 ms 31224 KB Output is correct
39 Correct 66 ms 31224 KB Output is correct
40 Correct 66 ms 31352 KB Output is correct
41 Correct 65 ms 31224 KB Output is correct
42 Correct 48 ms 31096 KB Output is correct
43 Correct 54 ms 31096 KB Output is correct
44 Correct 54 ms 31100 KB Output is correct
45 Correct 102 ms 31544 KB Output is correct
46 Correct 102 ms 31544 KB Output is correct
47 Correct 132 ms 31644 KB Output is correct
48 Correct 51 ms 31208 KB Output is correct
49 Correct 49 ms 31224 KB Output is correct
50 Correct 47 ms 31096 KB Output is correct
51 Correct 87 ms 31928 KB Output is correct
52 Correct 92 ms 31932 KB Output is correct
53 Correct 59 ms 31352 KB Output is correct
54 Correct 44 ms 30568 KB Output is correct
55 Correct 42 ms 30584 KB Output is correct
56 Correct 55 ms 31864 KB Output is correct
57 Correct 104 ms 30712 KB Output is correct
58 Correct 50 ms 31096 KB Output is correct
59 Correct 52 ms 31096 KB Output is correct
60 Correct 55 ms 31048 KB Output is correct
61 Correct 53 ms 31044 KB Output is correct
62 Correct 78 ms 31736 KB Output is correct
63 Correct 79 ms 32748 KB Output is correct
64 Correct 81 ms 32624 KB Output is correct
65 Correct 283 ms 32752 KB Output is correct
66 Correct 924 ms 34284 KB Output is correct
67 Correct 929 ms 34536 KB Output is correct