oj.uz

답안 #520876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
520876 2022-01-31T10:43:32 Z knon0501 Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 936 ms 50000 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int dist[30005][200];
int vis[30005][200];

vector<int> a[30005];
typedef pair<int,pair<int,int>> pp;
int n, m;
int main()
{
   // freopen("input.txt","r",stdin);
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin >> n >> m;
    int t;
    int k;
    for (int i = 0; i < m; i++)
    {

        int x, y;
        cin >> x >> y;
        if (i == 0)
            k = x;
        if (i == 1)
            t = x;
        a[x].emplace_back(y);
    }
    int s=sqrt(n);
    for (int i = 0; i < n; i++)
        for(int j=0 ; j<=s ; j++)
            dist[i][j] = INF;
    dist[k][0] = 0;

    priority_queue<pp,vector<pp>,greater<pp>> Q;
    Q.push({0,{k,0}});

    while(!Q.empty()){
        auto x=Q.top(); Q.pop();
        int v=x.second.first;
        int w=x.second.second;
        int d=x.first;
        if(vis[v][w])continue;
        vis[v][w]=1;
        if(w==0){
            for(auto e: a[v]){
                if(e>s){
                    int cnt=0;
                    for(int i=v+e  ; i<n ; i+=e){
                        cnt++;
                        if(dist[i][0]>d+cnt){
                            dist[i][0]=d+cnt;
                            Q.push({dist[i][0],{i,0}});
                        }
                    }
                    cnt=0;
                    for(int i=v-e ; i>=0 ;i-=e){
                        cnt++;
                        if (dist[i][0] > d + cnt)
                        {
                            dist[i][0] = d + cnt;
                            Q.push({dist[i][0], {i, 0}});
                        }
                    }
                }
                else{
                    if(dist[v][e]>d){
                        dist[v][e]=d;
                        Q.push({d,{v,e}});
                    }
                }
            }    
        }
        else{
            if(v+w<n && dist[v+w][w]>d+1){
                dist[v+w][w]=d+1;
                Q.push({dist[v+w][w],{v+w,w}});
            }
            if(v-w>=0 && dist[v-w][w]>d+1){
                dist[v-w][w]=d+1;
                Q.push({dist[v-w][w],{v-w,w}});
            }
            if(dist[v][0]>d){
                dist[v][0]=d;
                Q.push({d,{v,0}});
            }
        }
    }
    if (dist[t][0] == INF)
        cout << -1;
    else
        cout << dist[t][0];
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:89:18: warning: 't' may be used uninitialized in this function [-Wmaybe-uninitialized]
   89 |     if (dist[t][0] == INF)
      |         ~~~~~~~~~^

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 2 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 3 ms 2124 KB Output is correct
18 Correct 2 ms 2380 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 3 ms 4172 KB Output is correct
21 Correct 1 ms 1356 KB Output is correct
22 Correct 1 ms 2380 KB Output is correct
23 Correct 3 ms 3532 KB Output is correct
24 Correct 3 ms 4044 KB Output is correct
25 Correct 3 ms 4172 KB Output is correct
26 Correct 3 ms 4172 KB Output is correct
27 Correct 3 ms 4172 KB Output is correct
28 Correct 3 ms 4172 KB Output is correct
29 Correct 8 ms 4172 KB Output is correct
30 Correct 4 ms 4168 KB Output is correct
31 Correct 7 ms 4172 KB Output is correct
32 Correct 4 ms 4172 KB Output is correct
33 Correct 12 ms 4312 KB Output is correct
34 Correct 12 ms 4300 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 3 ms 2124 KB Output is correct
18 Correct 2 ms 2380 KB Output is correct
19 Correct 1 ms 2636 KB Output is correct
20 Correct 3 ms 4172 KB Output is correct
21 Correct 2 ms 1356 KB Output is correct
22 Correct 1 ms 2380 KB Output is correct
23 Correct 3 ms 3532 KB Output is correct
24 Correct 4 ms 4044 KB Output is correct
25 Correct 5 ms 4172 KB Output is correct
26 Correct 3 ms 4172 KB Output is correct
27 Correct 3 ms 4172 KB Output is correct
28 Correct 3 ms 4172 KB Output is correct
29 Correct 8 ms 4172 KB Output is correct
30 Correct 4 ms 4172 KB Output is correct
31 Correct 6 ms 4228 KB Output is correct
32 Correct 4 ms 4172 KB Output is correct
33 Correct 13 ms 4428 KB Output is correct
34 Correct 12 ms 4300 KB Output is correct
35 Correct 10 ms 3532 KB Output is correct
36 Correct 3 ms 2764 KB Output is correct
37 Correct 13 ms 4264 KB Output is correct
38 Correct 13 ms 4428 KB Output is correct
39 Correct 14 ms 4464 KB Output is correct
40 Correct 14 ms 4496 KB Output is correct
41 Correct 17 ms 4428 KB Output is correct
42 Correct 7 ms 4312 KB Output is correct
43 Correct 6 ms 4308 KB Output is correct
44 Correct 6 ms 4300 KB Output is correct
45 Correct 23 ms 4552 KB Output is correct
46 Correct 21 ms 4508 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 2 ms 1228 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 3 ms 2124 KB Output is correct
18 Correct 1 ms 2380 KB Output is correct
19 Correct 1 ms 2636 KB Output is correct
20 Correct 3 ms 4172 KB Output is correct
21 Correct 1 ms 1356 KB Output is correct
22 Correct 2 ms 2380 KB Output is correct
23 Correct 4 ms 3532 KB Output is correct
24 Correct 3 ms 4044 KB Output is correct
25 Correct 5 ms 4172 KB Output is correct
26 Correct 4 ms 4172 KB Output is correct
27 Correct 3 ms 4172 KB Output is correct
28 Correct 4 ms 4172 KB Output is correct
29 Correct 10 ms 4168 KB Output is correct
30 Correct 6 ms 4172 KB Output is correct
31 Correct 7 ms 4172 KB Output is correct
32 Correct 5 ms 4252 KB Output is correct
33 Correct 12 ms 4252 KB Output is correct
34 Correct 13 ms 4300 KB Output is correct
35 Correct 10 ms 3532 KB Output is correct
36 Correct 3 ms 2764 KB Output is correct
37 Correct 12 ms 4340 KB Output is correct
38 Correct 22 ms 4480 KB Output is correct
39 Correct 16 ms 4556 KB Output is correct
40 Correct 20 ms 4496 KB Output is correct
41 Correct 20 ms 4620 KB Output is correct
42 Correct 6 ms 4508 KB Output is correct
43 Correct 9 ms 4428 KB Output is correct
44 Correct 6 ms 4428 KB Output is correct
45 Correct 16 ms 4580 KB Output is correct
46 Correct 21 ms 4628 KB Output is correct
47 Correct 98 ms 21232 KB Output is correct
48 Correct 20 ms 19836 KB Output is correct
49 Correct 16 ms 21580 KB Output is correct
50 Correct 15 ms 23372 KB Output is correct
51 Correct 72 ms 49088 KB Output is correct
52 Correct 80 ms 49256 KB Output is correct
53 Correct 47 ms 48880 KB Output is correct
54 Correct 37 ms 47944 KB Output is correct
55 Correct 27 ms 47872 KB Output is correct
56 Correct 34 ms 49092 KB Output is correct
57 Correct 103 ms 48016 KB Output is correct
58 Correct 30 ms 48268 KB Output is correct
59 Correct 35 ms 48464 KB Output is correct
60 Correct 45 ms 48336 KB Output is correct
61 Correct 51 ms 48492 KB Output is correct
62 Correct 69 ms 49168 KB Output is correct
63 Correct 83 ms 49688 KB Output is correct
64 Correct 87 ms 49740 KB Output is correct
65 Correct 341 ms 49960 KB Output is correct
66 Correct 936 ms 49972 KB Output is correct
67 Correct 880 ms 50000 KB Output is correct