oj.uz

Submission #695185

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

using namespace std;
typedef long long ll;
#define endl '\n'
vector<int> adj[2000];
bitset<30000> vis[2000];
bitset<2000> vis2;
int dis[2000][30000];
void solve(){
    int n,m;
    cin>>n>>m;
    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;
    q.push({v[0].first,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:14:9: warning: variable 'pos' set but not used [-Wunused-but-set-variable]
   14 |     int pos = 0;
      |         ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 5 ms 2008 KB Output is correct
13 Correct 5 ms 2000 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 1 ms 1876 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 0 ms 852 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 5 ms 2004 KB Output is correct
13 Correct 6 ms 2004 KB Output is correct
14 Correct 1 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 7 ms 11220 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 160 ms 31692 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 10 ms 15504 KB Output is correct
24 Correct 15 ms 25440 KB Output is correct
25 Correct 12 ms 22868 KB Output is correct
26 Correct 85 ms 31636 KB Output is correct
27 Correct 82 ms 31688 KB Output is correct
28 Correct 16 ms 30280 KB Output is correct
29 Correct 13 ms 21716 KB Output is correct
30 Correct 9 ms 17236 KB Output is correct
31 Correct 12 ms 20308 KB Output is correct
32 Correct 11 ms 19540 KB Output is correct
33 Correct 20 ms 31544 KB Output is correct
34 Correct 20 ms 31480 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 0 ms 852 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 5 ms 2004 KB Output is correct
13 Correct 5 ms 2004 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 1 ms 1876 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 8 ms 11244 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 162 ms 31744 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 8 ms 15476 KB Output is correct
24 Correct 13 ms 25452 KB Output is correct
25 Correct 14 ms 22892 KB Output is correct
26 Correct 89 ms 31752 KB Output is correct
27 Correct 82 ms 31692 KB Output is correct
28 Correct 15 ms 30292 KB Output is correct
29 Correct 15 ms 21668 KB Output is correct
30 Correct 10 ms 17280 KB Output is correct
31 Correct 12 ms 20384 KB Output is correct
32 Correct 13 ms 19540 KB Output is correct
33 Correct 19 ms 31432 KB Output is correct
34 Correct 20 ms 31408 KB Output is correct
35 Correct 70 ms 153292 KB Output is correct
36 Correct 13 ms 26596 KB Output is correct
37 Correct 88 ms 161136 KB Output is correct
38 Correct 125 ms 239224 KB Output is correct
39 Correct 112 ms 238796 KB Output is correct
40 Correct 109 ms 239568 KB Output is correct
41 Correct 116 ms 237996 KB Output is correct
42 Execution timed out 1094 ms 211856 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 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 5 ms 1912 KB Output is correct
13 Correct 5 ms 2004 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 1 ms 1876 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 7 ms 11264 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 185 ms 31748 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 9 ms 15452 KB Output is correct
24 Correct 15 ms 25428 KB Output is correct
25 Correct 12 ms 22868 KB Output is correct
26 Correct 87 ms 31644 KB Output is correct
27 Correct 83 ms 31684 KB Output is correct
28 Correct 15 ms 30164 KB Output is correct
29 Correct 17 ms 21672 KB Output is correct
30 Correct 11 ms 17276 KB Output is correct
31 Correct 11 ms 20308 KB Output is correct
32 Correct 10 ms 19540 KB Output is correct
33 Correct 20 ms 31520 KB Output is correct
34 Correct 20 ms 31424 KB Output is correct
35 Correct 71 ms 153296 KB Output is correct
36 Correct 13 ms 26588 KB Output is correct
37 Correct 89 ms 161228 KB Output is correct
38 Correct 114 ms 239236 KB Output is correct
39 Correct 116 ms 238680 KB Output is correct
40 Correct 116 ms 239568 KB Output is correct
41 Correct 112 ms 238068 KB Output is correct
42 Execution timed out 1107 ms 213860 KB Time limit exceeded
43 Halted 0 ms 0 KB -