oj.uz

답안 #695183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
695183 2023-02-04T19:07:56 Z HossamHero7 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 243808 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<pair<int,int>> q;
    vector<vector<bool>> vis(n,vector<bool>(m));
    vector<bool> vis2(n);
    q.push({v[0].first,0});
    vector<vector<int>> dis(n,vector<int>(m,0));
    while(q.size()){
        pair<int,int> cur = q.front();     q.pop();
        if(!vis2[cur.first]){
            for(auto ch : adj[cur.first]){
                int p = v[ch].second;
                if(cur.first+p<n && !vis[cur.first+p][ch]){
                    q.push({cur.first+p,ch});
                    dis[cur.first+p][ch] = dis[cur.first][cur.second] + 1;
                    vis[cur.first+p][ch] = 1;
                }
                if(cur.first-p>=0 && !vis[cur.first-p][ch]){
                    q.push({cur.first-p,ch});
                    dis[cur.first-p][ch] = dis[cur.first][cur.second] + 1;
                    vis[cur.first-p][ch] = 1;
                }
            }
        }

        vis2[cur.first] = 1;
        int p = v[cur.second].second;
        if(cur.first+p<n && !vis[cur.first+p][cur.second]){
            q.push({cur.first+p,cur.second});
            dis[cur.first+p][cur.second] = dis[cur.first][cur.second] + 1;
            vis[cur.first+p][cur.second] = 1;
        }
        if(cur.first-p>=0 && !vis[cur.first-p][cur.second]){
            q.push({cur.first-p,cur.second});
            dis[cur.first-p][cur.second] = dis[cur.first][cur.second] + 1;
            vis[cur.first-p][cur.second] = 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 1 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 1 ms 1108 KB Output is correct
12 Correct 5 ms 1216 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1108 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 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 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 1 ms 1108 KB Output is correct
12 Correct 5 ms 1108 KB Output is correct
13 Correct 5 ms 1200 KB Output is correct
14 Correct 1 ms 1172 KB Output is correct
15 Correct 2 ms 1108 KB Output is correct
16 Correct 1 ms 980 KB Output is correct
17 Correct 4 ms 5716 KB Output is correct
18 Correct 4 ms 7508 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 184 ms 16796 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 10 ms 15060 KB Output is correct
25 Correct 8 ms 16656 KB Output is correct
26 Correct 78 ms 16764 KB Output is correct
27 Correct 74 ms 16740 KB Output is correct
28 Correct 11 ms 16724 KB Output is correct
29 Correct 6 ms 6484 KB Output is correct
30 Correct 3 ms 1876 KB Output is correct
31 Correct 4 ms 5204 KB Output is correct
32 Correct 4 ms 4436 KB Output is correct
33 Correct 13 ms 16724 KB Output is correct
34 Correct 14 ms 16724 KB Output is correct

Subtask #4
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 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
8 Correct 0 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 1 ms 1108 KB Output is correct
12 Correct 5 ms 1108 KB Output is correct
13 Correct 5 ms 1200 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 4 ms 5716 KB Output is correct
18 Correct 4 ms 7508 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 146 ms 16800 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 8 ms 16724 KB Output is correct
26 Correct 78 ms 16764 KB Output is correct
27 Correct 75 ms 16724 KB Output is correct
28 Correct 9 ms 16724 KB Output is correct
29 Correct 5 ms 6484 KB Output is correct
30 Correct 2 ms 1876 KB Output is correct
31 Correct 4 ms 5296 KB Output is correct
32 Correct 3 ms 4436 KB Output is correct
33 Correct 17 ms 16724 KB Output is correct
34 Correct 14 ms 16784 KB Output is correct
35 Correct 81 ms 150080 KB Output is correct
36 Correct 11 ms 21336 KB Output is correct
37 Correct 100 ms 152656 KB Output is correct
38 Correct 119 ms 243024 KB Output is correct
39 Correct 137 ms 243396 KB Output is correct
40 Correct 114 ms 243452 KB Output is correct
41 Correct 115 ms 243316 KB Output is correct
42 Execution timed out 1097 ms 243788 KB Time limit exceeded
43 Halted 0 ms 0 KB -

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 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 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 4 ms 1108 KB Output is correct
13 Correct 5 ms 1108 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 4 ms 5716 KB Output is correct
18 Correct 3 ms 7508 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 168 ms 16792 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 75 ms 16764 KB Output is correct
27 Correct 73 ms 16724 KB Output is correct
28 Correct 9 ms 16724 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 5 ms 4404 KB Output is correct
33 Correct 17 ms 16776 KB Output is correct
34 Correct 14 ms 16784 KB Output is correct
35 Correct 76 ms 149984 KB Output is correct
36 Correct 12 ms 21332 KB Output is correct
37 Correct 91 ms 152648 KB Output is correct
38 Correct 116 ms 243048 KB Output is correct
39 Correct 125 ms 243464 KB Output is correct
40 Correct 143 ms 243464 KB Output is correct
41 Correct 115 ms 243348 KB Output is correct
42 Execution timed out 1093 ms 243808 KB Time limit exceeded
43 Halted 0 ms 0 KB -