oj.uz

Submission #695176

# Submission time Handle Problem Language Result Execution time Memory
695176 2023-02-04T19:02:10 Z HossamHero7 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 243932 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define endl '\n'
void solve(){
    int n,m;
    cin>>n>>m;
    vector<vector<int>> adj(n+1);
    vector<pair<int,int>> v(m);
    int pos = 0;
    for(int i=0;i<m;i++){
        int a,b;cin>>a>>b;
        v[i].first = a;
        v[i].second = b;
        if(i == 1) pos = a;
        adj[a].push_back(i);
    }
    queue<array<int,2>> q;
    vector<vector<bool>> vis(n,vector<bool>(m));
    q.push({v[0].first,0});
    vector<vector<int>> dis(n,vector<int>(m,0));
    while(q.size()){
        array<int,2> cur = q.front();     q.pop();
        for(auto ch : adj[cur[0]]){
            int p = v[ch].second;
            if(cur[0]+p<n && !vis[cur[0]+p][ch]){
                q.push({cur[0]+p,ch});
                dis[cur[0]+p][ch] = dis[cur[0]][cur[1]] + 1;
                vis[cur[0]+p][ch] = 1;
            }
            if(cur[0]-p>=0 && !vis[cur[0]-p][ch]){
                q.push({cur[0]-p,ch});
                dis[cur[0]-p][ch] = dis[cur[0]][cur[1]] + 1;
                vis[cur[0]-p][ch] = 1;
            }
        }

        int p = v[cur[1]].second;
        if(cur[0]+p<n && !vis[cur[0]+p][cur[1]]){
            q.push({cur[0]+p,cur[1]});
            dis[cur[0]+p][cur[1]] = dis[cur[0]][cur[1]] + 1;
            vis[cur[0]+p][cur[1]] = 1;
        }
        if(cur[0]-p>=0 && !vis[cur[0]-p][cur[1]]){
            q.push({cur[0]-p,cur[1]});
            dis[cur[0]-p][cur[1]] = dis[cur[0]][cur[1]] + 1;
            vis[cur[0]-p][cur[1]] = 1;
        }
    }
    if(v[0].first == v[1].first){
        cout<<0<<endl;
    }
    else {
        int ans = 1e9;
        for(int i=0;i<m;i++){
            if(i == 1) continue;
            if(dis[v[1].first][i] == 0) continue;
            ans = min(ans,dis[v[1].first][i]);
        }
        cout<<(ans==1e9?-1:ans)<<endl;
    }
}
int 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:11:9: warning: variable 'pos' set but not used [-Wunused-but-set-variable]
   11 |     int pos = 0;
      |         ^~~

Subtask #1
10.0 / 10.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 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

# 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 0 ms 212 KB Output is correct
4 Correct 1 ms 256 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
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 26 ms 1212 KB Output is correct
13 Correct 23 ms 1196 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 2 ms 1108 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 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 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 468 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 23 ms 1108 KB Output is correct
13 Correct 34 ms 1180 KB Output is correct
14 Correct 2 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 5 ms 5756 KB Output is correct
18 Correct 4 ms 7508 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 229 ms 16800 KB Output is correct
21 Correct 2 ms 2132 KB Output is correct
22 Correct 3 ms 5716 KB Output is correct
23 Correct 4 ms 6740 KB Output is correct
24 Correct 8 ms 15060 KB Output is correct
25 Correct 9 ms 16724 KB Output is correct
26 Correct 97 ms 16776 KB Output is correct
27 Correct 91 ms 16764 KB Output is correct
28 Correct 9 ms 16680 KB Output is correct
29 Correct 7 ms 6484 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 4 ms 5204 KB Output is correct
32 Correct 3 ms 4436 KB Output is correct
33 Correct 14 ms 16724 KB Output is correct
34 Correct 16 ms 16780 KB Output is correct

Subtask #4
0 / 21.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 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 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 24 ms 1212 KB Output is correct
13 Correct 23 ms 1108 KB Output is correct
14 Correct 3 ms 1108 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 6 ms 5756 KB Output is correct
18 Correct 4 ms 7508 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 219 ms 16848 KB Output is correct
21 Correct 1 ms 2132 KB Output is correct
22 Correct 3 ms 5716 KB Output is correct
23 Correct 4 ms 6688 KB Output is correct
24 Correct 8 ms 15060 KB Output is correct
25 Correct 9 ms 16724 KB Output is correct
26 Correct 91 ms 16768 KB Output is correct
27 Correct 84 ms 16724 KB Output is correct
28 Correct 9 ms 16724 KB Output is correct
29 Correct 6 ms 6484 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 5 ms 5204 KB Output is correct
32 Correct 3 ms 4436 KB Output is correct
33 Correct 14 ms 16776 KB Output is correct
34 Correct 20 ms 16724 KB Output is correct
35 Correct 102 ms 149972 KB Output is correct
36 Correct 12 ms 21332 KB Output is correct
37 Correct 122 ms 152596 KB Output is correct
38 Correct 163 ms 242952 KB Output is correct
39 Correct 164 ms 243436 KB Output is correct
40 Correct 193 ms 243468 KB Output is correct
41 Correct 173 ms 243252 KB Output is correct
42 Execution timed out 1089 ms 243932 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.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 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 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 23 ms 1108 KB Output is correct
13 Correct 22 ms 1212 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 5 ms 5716 KB Output is correct
18 Correct 4 ms 7508 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 199 ms 16796 KB Output is correct
21 Correct 1 ms 2132 KB Output is correct
22 Correct 3 ms 5716 KB Output is correct
23 Correct 4 ms 6740 KB Output is correct
24 Correct 8 ms 15060 KB Output is correct
25 Correct 9 ms 16724 KB Output is correct
26 Correct 92 ms 16780 KB Output is correct
27 Correct 85 ms 16760 KB Output is correct
28 Correct 10 ms 16724 KB Output is correct
29 Correct 6 ms 6588 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 4 ms 5204 KB Output is correct
32 Correct 3 ms 4436 KB Output is correct
33 Correct 14 ms 16724 KB Output is correct
34 Correct 14 ms 16772 KB Output is correct
35 Correct 98 ms 149952 KB Output is correct
36 Correct 12 ms 21332 KB Output is correct
37 Correct 125 ms 152608 KB Output is correct
38 Correct 179 ms 243068 KB Output is correct
39 Correct 168 ms 243456 KB Output is correct
40 Correct 181 ms 243372 KB Output is correct
41 Correct 171 ms 243276 KB Output is correct
42 Execution timed out 1106 ms 243808 KB Time limit exceeded
43 Halted 0 ms 0 KB -