oj.uz

Submission #877888

# Submission time Handle Problem Language Result Execution time Memory
877888 2023-11-23T20:29:22 Z sysia Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 61 ms 12500 KB 
//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// #define int long long
typedef pair<int, int> T;
const int oo = 1e9+7, K = 30;
const int mod = 998244353;

const int S = 2;

void solve(){
    int n, m; cin >> n >> m;
    vector<vector<T>>g(n*S+2);
    auto ch = [&](int v, int j = 0){return v*S+j;};
    vector<vector<int>>doge(n+1);
    int start, kon;
    for (int i = 0; i<m; i++){
        int v, j; cin >> v >> j;
        if (i == 0) start = ch(v);  
        if (i == 1) kon = ch(v);
        // if (j >= n) continue;
        if (j < S) g[ch(v)].emplace_back(ch(v, j), 0);
        else doge[v].emplace_back(j);
    }
   
    vector<int>dist(n*S+2, oo);
    set<T>s;
    debug(start, kon);
    s.insert({0, start});
    dist[start] = 0;
    while ((int)s.size()){
        auto [d, v] = *s.begin();
        s.erase(s.begin());
        debug(v);
        if (dist[v] < d) continue; 
        //dlugie skoki
        debug(v, doge[v]);
        auto popraw = [&](int what, int from, int c){
            debug(what, from, c);
            if (dist[what] > dist[from] + c){
                dist[what] = dist[from] + c;
                s.insert({dist[what], what});
            }
        };
        if (v%S == 0){
            int vv = v/S;
            for (auto j: doge[vv]){
                for (int u = vv-j, k = 1; u >= 0; u-=j, k++){
                    popraw(ch(u), v, k);
                }
                for (int u = vv+j, k = 1; u<n; u+=j, k++){
                    popraw(ch(u), v, k);
                }
            }
        }
        //jakies inne losowe
        for (auto [x, c]: g[v]){
            popraw(x, v, c);
        }
        //krotkie skoki
        int j = v%S;
        if (j != 0){
            int pos = v-v%S;
            popraw(pos, v, 0);
            int u = pos/S;
            debug(u, j);
            if (u >= j){
                popraw(ch(u-j, j), v, 1);
            }
            if (u + j < n){
                popraw(ch(u+j, j), v, 1);
            }
        }
    }
    int ans = dist[kon];
    if (ans == oo) ans = -1;
    cout << ans << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

Compilation message

skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:98:23: warning: 'kon' may be used uninitialized in this function [-Wmaybe-uninitialized]
   98 |     int ans = dist[kon];
      |                       ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 2 ms 1004 KB Output is correct
34 Correct 3 ms 1116 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 2 ms 860 KB Output is correct
34 Correct 3 ms 1116 KB Output is correct
35 Correct 5 ms 860 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 5 ms 860 KB Output is correct
38 Correct 6 ms 860 KB Output is correct
39 Correct 6 ms 860 KB Output is correct
40 Correct 6 ms 1076 KB Output is correct
41 Correct 6 ms 856 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 4 ms 860 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 6 ms 1116 KB Output is correct
46 Correct 6 ms 1120 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 616 KB Output is correct
24 Correct 1 ms 616 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 856 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 3 ms 860 KB Output is correct
34 Correct 3 ms 1128 KB Output is correct
35 Correct 5 ms 856 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 4 ms 860 KB Output is correct
38 Correct 6 ms 860 KB Output is correct
39 Correct 6 ms 860 KB Output is correct
40 Correct 6 ms 1068 KB Output is correct
41 Correct 8 ms 860 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 4 ms 860 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 5 ms 1116 KB Output is correct
46 Correct 5 ms 1116 KB Output is correct
47 Correct 16 ms 3164 KB Output is correct
48 Correct 5 ms 2652 KB Output is correct
49 Correct 5 ms 2908 KB Output is correct
50 Correct 4 ms 2908 KB Output is correct
51 Correct 22 ms 4904 KB Output is correct
52 Correct 27 ms 6116 KB Output is correct
53 Correct 11 ms 4188 KB Output is correct
54 Correct 3 ms 3420 KB Output is correct
55 Correct 3 ms 3304 KB Output is correct
56 Correct 8 ms 3676 KB Output is correct
57 Correct 57 ms 10128 KB Output is correct
58 Correct 7 ms 3552 KB Output is correct
59 Correct 8 ms 3552 KB Output is correct
60 Correct 9 ms 3548 KB Output is correct
61 Correct 9 ms 3556 KB Output is correct
62 Correct 9 ms 3728 KB Output is correct
63 Correct 32 ms 7516 KB Output is correct
64 Correct 32 ms 7764 KB Output is correct
65 Correct 39 ms 9040 KB Output is correct
66 Correct 59 ms 12372 KB Output is correct
67 Correct 61 ms 12500 KB Output is correct