oj.uz

답안 #554722

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
554722 2022-04-29T09:37:39 Z kwongweng Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 719 ms 24672 KB 
/*
Solution for APIO 2015 - Skyscrapper
Tags : sqrt decomposition
*/

#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define ms memset
#define pb push_back
#define fi first
#define se second
 
ll MOD = 1000000007;
 
ll power(ll base, ll n){
	if (n == 0) return 1;
	if (n == 1) return base;
	ll halfn = power(base, n/2);
	if (n % 2 == 0) return (halfn * halfn) % MOD;
	return (((halfn * halfn) % MOD) * base) % MOD;
}
 
ll inverse(ll n){
	return power(n, MOD-2);
}
 
ll add(ll a, ll b){
	return (a+b) % MOD;
}
 
ll mul(ll a, ll b){
	a %= MOD;
	return (a*b) % MOD;
}
 
ll gcd(ll a, ll b){
    if (a == 1) return 1;
    if (a == 0) return b;
    return gcd(b%a, a);
}
 
void solve(){
    int n, m; cin >> n>> m;
    vi doge[n];
    int dest; int start;
    FOR(i,0,m){
        int b, p; cin >> b >> p;
        doge[b].pb(p);
        if (i==0) start = b;
        if (i==1) dest = b;
    }
    int B = floor(sqrt(n));
    set<pair<int, ii>> st;
    int dist[n][B+1];
    FOR(i,0,n){
        FOR(j,0,B+1){
            dist[i][j] = MOD;
        }
    }
    dist[start][0] = 0;
    st.insert({dist[start][0], {start, 0}});
    while (!st.empty()){
        auto node = *st.begin();
        st.erase(st.begin());
        int u = node.se.fi, w = node.se.se;
        if (w==0){
            for (int p : doge[u]){
                if (p > B){
                    int cur = u+p;
                    while (cur<n){
                        if (dist[cur][0] <= dist[u][w] + (cur-u)/p){
                            cur += p; continue;
                        }
                        if (dist[cur][0] != MOD){
                            st.erase({dist[cur][0], {cur, 0}});
                        }
                        dist[cur][0] = dist[u][w] + (cur-u)/p;
                        st.insert({dist[cur][0], {cur, 0}});
                        cur += p;
                    }
                    cur = u-p;
                    while (cur >= 0){
                        if (dist[cur][0] <= dist[u][w] + (u-cur)/p){
                            cur -= p; continue;
                        }
                        if (dist[cur][0] != MOD){
                            st.erase({dist[cur][0], {cur, 0}});
                        }
                        dist[cur][0] = dist[u][w] + (u-cur)/p;
                        st.insert({dist[cur][0], {cur, 0}});
                        cur -= p;
                    }
                    continue;
                }
                if (dist[u][p] <= dist[u][w]){
                    continue;
                }
                if (dist[u][p] != MOD){
                    st.erase({dist[u][p], {u, p}});
                }
                dist[u][p] = dist[u][w];
                st.insert({dist[u][p], {u, p}});
            }
            continue;
        }
        if (dist[u][0] > dist[u][w]){
            if (dist[u][0] != MOD){
                st.erase({dist[u][0], {u, 0}});
            }
            dist[u][0] = dist[u][w];
            st.insert({dist[u][0], {u, 0}});
        }
        if (u+w < n && dist[u+w][w] > dist[u][w] + 1){
            if (dist[u+w][w] != MOD){
                st.erase({dist[u+w][w], {u+w, w}});
            }
            dist[u+w][w] = dist[u][w] + 1;
            st.insert({dist[u+w][w], {u+w, w}});
        }
        if (u-w >= 0 && dist[u-w][w] > dist[u][w] + 1){
            if (dist[u-w][w] != MOD){
                st.erase({dist[u-w][w], {u-w, w}});
            }
            dist[u-w][w] = dist[u][w] + 1;
            st.insert({dist[u-w][w], {u-w, w}});
        }
    }
    if (dist[dest][0] == MOD){
        cout << -1;
        return;
    }
    cout << dist[dest][0];
}
 
int main() {
    ios::sync_with_stdio(false);
    int TC = 1;
    //cin >> TC;
    FOR(i, 1, TC+1){
        //cout << "Case #" << i << ": ";
        solve();
    }
}

Compilation message

skyscraper.cpp:10: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   10 | #pragma GCC optimization ("Ofast")
      | 
skyscraper.cpp:11: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   11 | #pragma GCC optimization ("unroll-loops")
      | 
skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:73:20: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized]
   73 |     dist[start][0] = 0;
      |     ~~~~~~~~~~~~~~~^~~
skyscraper.cpp:141:21: warning: 'dest' may be used uninitialized in this function [-Wmaybe-uninitialized]
  141 |     if (dist[dest][0] == MOD){
      |         ~~~~~~~~~~~~^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 324 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 2 ms 588 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 720 KB Output is correct
26 Correct 1 ms 712 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 2 ms 800 KB Output is correct
29 Correct 8 ms 704 KB Output is correct
30 Correct 3 ms 724 KB Output is correct
31 Correct 5 ms 704 KB Output is correct
32 Correct 2 ms 724 KB Output is correct
33 Correct 11 ms 852 KB Output is correct
34 Correct 14 ms 980 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 584 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 2 ms 580 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 1 ms 720 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 7 ms 772 KB Output is correct
30 Correct 3 ms 724 KB Output is correct
31 Correct 5 ms 724 KB Output is correct
32 Correct 4 ms 724 KB Output is correct
33 Correct 12 ms 904 KB Output is correct
34 Correct 12 ms 852 KB Output is correct
35 Correct 10 ms 928 KB Output is correct
36 Correct 3 ms 596 KB Output is correct
37 Correct 14 ms 1108 KB Output is correct
38 Correct 14 ms 1320 KB Output is correct
39 Correct 15 ms 1236 KB Output is correct
40 Correct 14 ms 1248 KB Output is correct
41 Correct 15 ms 1268 KB Output is correct
42 Correct 6 ms 1108 KB Output is correct
43 Correct 5 ms 1108 KB Output is correct
44 Correct 5 ms 1096 KB Output is correct
45 Correct 17 ms 1288 KB Output is correct
46 Correct 18 ms 1192 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 456 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 712 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 1 ms 724 KB Output is correct
28 Correct 2 ms 712 KB Output is correct
29 Correct 7 ms 724 KB Output is correct
30 Correct 2 ms 724 KB Output is correct
31 Correct 5 ms 724 KB Output is correct
32 Correct 3 ms 828 KB Output is correct
33 Correct 11 ms 852 KB Output is correct
34 Correct 12 ms 904 KB Output is correct
35 Correct 10 ms 1052 KB Output is correct
36 Correct 3 ms 524 KB Output is correct
37 Correct 13 ms 1132 KB Output is correct
38 Correct 14 ms 1264 KB Output is correct
39 Correct 16 ms 1236 KB Output is correct
40 Correct 14 ms 1328 KB Output is correct
41 Correct 14 ms 1316 KB Output is correct
42 Correct 5 ms 1128 KB Output is correct
43 Correct 5 ms 1108 KB Output is correct
44 Correct 5 ms 1100 KB Output is correct
45 Correct 17 ms 1236 KB Output is correct
46 Correct 17 ms 1232 KB Output is correct
47 Correct 69 ms 7244 KB Output is correct
48 Correct 13 ms 15444 KB Output is correct
49 Correct 15 ms 17364 KB Output is correct
50 Correct 14 ms 19796 KB Output is correct
51 Correct 58 ms 23104 KB Output is correct
52 Correct 69 ms 23168 KB Output is correct
53 Correct 23 ms 22348 KB Output is correct
54 Correct 12 ms 21332 KB Output is correct
55 Correct 13 ms 21332 KB Output is correct
56 Correct 21 ms 22680 KB Output is correct
57 Correct 80 ms 21576 KB Output is correct
58 Correct 20 ms 21716 KB Output is correct
59 Correct 21 ms 21912 KB Output is correct
60 Correct 27 ms 21844 KB Output is correct
61 Correct 23 ms 21868 KB Output is correct
62 Correct 46 ms 22764 KB Output is correct
63 Correct 77 ms 23712 KB Output is correct
64 Correct 87 ms 23676 KB Output is correct
65 Correct 292 ms 23724 KB Output is correct
66 Correct 713 ms 24672 KB Output is correct
67 Correct 719 ms 24652 KB Output is correct