oj.uz

Submission #705537

# Submission time Handle Problem Language Result Execution time Memory
705537 2023-03-04T15:27:51 Z Alihan_8 Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 187 ms 125992 KB 
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m; cin >> n >> m;
    set <int> S[n];
    int en = -1, st = -1;
    for ( int i = 1; i <= m; i++ ){
        int pos, val; cin >> pos >> val;
        if ( i == 1 ) st = pos;
        if ( i == 2 ) en = pos;
        S[pos].insert(val);
    }
    vector <pair<int,int>> g[n];
    for ( int i = 0; i < n; i++ ){
        for ( auto val: S[i] ){
            int cnt = 0;
            for ( int j = i+val; j < n; j += val ){
                g[i].pb({j, ++cnt});
                if ( S[j].count(val) ) break;
            } cnt = 0;
            for ( int j = i-val; j >= 0; j -= val ){
                g[i].pb({j, ++cnt});
                if ( S[j].count(val) ) break;
            }
        }
    }
    const int inf = 1e16;
    vector <int> dis(n, 1e16);
    priority_queue <pair<int,int>> q;
    dis[st] = 0;
    q.push({0, st});
    while ( !q.empty() ){
        auto [val, cur] = q.top();
        q.pop(); val = -val;
        if ( val > dis[cur] ) continue;
        for ( auto [to, w]: g[cur] ){
            int new_dis = val+w;
            if ( new_dis < dis[to] ){
                dis[to] = new_dis;
                q.push({-dis[to], to});
            }
        }
    }
    if ( dis[en] == inf ) dis[en] = -1;
    cout << dis[en];

    cout << '\n';
}
/*
5 3
0 2
1 1
4 1
*/

Compilation message

skyscraper.cpp: In function 'void IO(std::string)':
skyscraper.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 316 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 320 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 456 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 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 972 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 2 ms 1364 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct
33 Correct 5 ms 2912 KB Output is correct
34 Correct 5 ms 2912 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 0 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 340 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 1 ms 592 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 1 ms 716 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 3 ms 1876 KB Output is correct
30 Correct 1 ms 980 KB Output is correct
31 Correct 2 ms 1344 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct
33 Correct 5 ms 2900 KB Output is correct
34 Correct 5 ms 2904 KB Output is correct
35 Correct 16 ms 3852 KB Output is correct
36 Correct 3 ms 980 KB Output is correct
37 Correct 18 ms 5588 KB Output is correct
38 Correct 18 ms 5468 KB Output is correct
39 Correct 18 ms 5644 KB Output is correct
40 Correct 18 ms 5576 KB Output is correct
41 Correct 20 ms 5492 KB Output is correct
42 Correct 4 ms 852 KB Output is correct
43 Correct 7 ms 852 KB Output is correct
44 Correct 5 ms 788 KB Output is correct
45 Correct 21 ms 10192 KB Output is correct
46 Correct 22 ms 10244 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
6 Correct 1 ms 320 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 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 468 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 468 KB Output is correct
15 Correct 1 ms 452 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 852 KB Output is correct
25 Correct 2 ms 828 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 2 ms 972 KB Output is correct
29 Correct 4 ms 1860 KB Output is correct
30 Correct 2 ms 1088 KB Output is correct
31 Correct 2 ms 1364 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 5 ms 2912 KB Output is correct
34 Correct 5 ms 2912 KB Output is correct
35 Correct 15 ms 3784 KB Output is correct
36 Correct 4 ms 980 KB Output is correct
37 Correct 17 ms 5564 KB Output is correct
38 Correct 18 ms 5588 KB Output is correct
39 Correct 19 ms 5616 KB Output is correct
40 Correct 18 ms 5520 KB Output is correct
41 Correct 20 ms 5504 KB Output is correct
42 Correct 7 ms 852 KB Output is correct
43 Correct 7 ms 764 KB Output is correct
44 Correct 7 ms 852 KB Output is correct
45 Correct 21 ms 10312 KB Output is correct
46 Correct 22 ms 10184 KB Output is correct
47 Correct 48 ms 20136 KB Output is correct
48 Correct 18 ms 7760 KB Output is correct
49 Correct 12 ms 6228 KB Output is correct
50 Correct 11 ms 5980 KB Output is correct
51 Correct 42 ms 11740 KB Output is correct
52 Correct 49 ms 12788 KB Output is correct
53 Correct 26 ms 7024 KB Output is correct
54 Correct 6 ms 3516 KB Output is correct
55 Correct 5 ms 4432 KB Output is correct
56 Correct 15 ms 5680 KB Output is correct
57 Correct 36 ms 19832 KB Output is correct
58 Correct 9 ms 4800 KB Output is correct
59 Correct 10 ms 5420 KB Output is correct
60 Correct 12 ms 6732 KB Output is correct
61 Correct 11 ms 5456 KB Output is correct
62 Correct 23 ms 14028 KB Output is correct
63 Correct 68 ms 45312 KB Output is correct
64 Correct 81 ms 51920 KB Output is correct
65 Correct 101 ms 71796 KB Output is correct
66 Correct 187 ms 125992 KB Output is correct
67 Correct 174 ms 125992 KB Output is correct