oj.uz

답안 #705530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705530 2023-03-04T15:21:38 Z Alihan_8 Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 299 ms 262144 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) ) continue;
            } cnt = 0;
            for ( int j = i-val; j >= 0; j -= val ){
                g[i].pb({j, ++cnt});
                if ( S[j].count(val) ) continue;
            }
        }
    }
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 468 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

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 468 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 468 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 72 ms 64664 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 980 KB Output is correct
29 Correct 3 ms 2004 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 2 ms 1364 KB Output is correct
32 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 468 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 468 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 71 ms 64676 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 1 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 2 ms 980 KB Output is correct
29 Correct 3 ms 2004 KB Output is correct
30 Correct 1 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 4 ms 2912 KB Output is correct
34 Correct 5 ms 2912 KB Output is correct
35 Correct 11 ms 4564 KB Output is correct
36 Correct 2 ms 980 KB Output is correct
37 Correct 12 ms 7428 KB Output is correct
38 Correct 14 ms 6680 KB Output is correct
39 Correct 15 ms 7048 KB Output is correct
40 Correct 15 ms 6740 KB Output is correct
41 Correct 14 ms 6484 KB Output is correct
42 Correct 4 ms 724 KB Output is correct
43 Correct 4 ms 596 KB Output is correct
44 Correct 74 ms 64688 KB Output is correct
45 Correct 19 ms 10012 KB Output is correct
46 Correct 19 ms 10064 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 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 0 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 468 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 468 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 72 ms 64676 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 980 KB Output is correct
29 Correct 3 ms 2004 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 2 ms 1364 KB Output is correct
32 Correct 1 ms 1108 KB Output is correct
33 Correct 5 ms 2912 KB Output is correct
34 Correct 5 ms 2956 KB Output is correct
35 Correct 11 ms 4564 KB Output is correct
36 Correct 2 ms 980 KB Output is correct
37 Correct 12 ms 7520 KB Output is correct
38 Correct 14 ms 6596 KB Output is correct
39 Correct 15 ms 6988 KB Output is correct
40 Correct 14 ms 6740 KB Output is correct
41 Correct 17 ms 6492 KB Output is correct
42 Correct 4 ms 724 KB Output is correct
43 Correct 4 ms 596 KB Output is correct
44 Correct 73 ms 64680 KB Output is correct
45 Correct 19 ms 10064 KB Output is correct
46 Correct 19 ms 10064 KB Output is correct
47 Correct 37 ms 23820 KB Output is correct
48 Correct 12 ms 7624 KB Output is correct
49 Correct 10 ms 5972 KB Output is correct
50 Correct 8 ms 5860 KB Output is correct
51 Correct 37 ms 13360 KB Output is correct
52 Correct 35 ms 13176 KB Output is correct
53 Correct 15 ms 6748 KB Output is correct
54 Correct 3 ms 3416 KB Output is correct
55 Correct 5 ms 4412 KB Output is correct
56 Runtime error 299 ms 262144 KB Execution killed with signal 9
57 Halted 0 ms 0 KB -