oj.uz

답안 #695195

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
695195 2023-02-04T19:19:27 Z HossamHero7 Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 1000 ms 243360 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(cur.first == v[1].first) continue;
        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

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

Subtask #2
12.0 / 12.0

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

# 결과 실행 시간 메모리 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
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 5 ms 1876 KB Output is correct
14 Correct 1 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 6 ms 11092 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 468 KB Output is correct
20 Correct 153 ms 31664 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 15480 KB Output is correct
24 Correct 13 ms 25420 KB Output is correct
25 Correct 9 ms 19028 KB Output is correct
26 Correct 8 ms 13868 KB Output is correct
27 Correct 7 ms 14764 KB Output is correct
28 Correct 14 ms 28628 KB Output is correct
29 Correct 12 ms 21668 KB Output is correct
30 Correct 10 ms 17220 KB Output is correct
31 Correct 11 ms 20340 KB Output is correct
32 Correct 10 ms 19496 KB Output is correct
33 Correct 20 ms 31480 KB Output is correct
34 Correct 21 ms 31468 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 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
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 5 ms 1876 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 6 ms 11092 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 211 ms 31840 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 15444 KB Output is correct
24 Correct 13 ms 25428 KB Output is correct
25 Correct 9 ms 19028 KB Output is correct
26 Correct 7 ms 13780 KB Output is correct
27 Correct 8 ms 14804 KB Output is correct
28 Correct 14 ms 28608 KB Output is correct
29 Correct 12 ms 21716 KB Output is correct
30 Correct 10 ms 17236 KB Output is correct
31 Correct 12 ms 20308 KB Output is correct
32 Correct 10 ms 19556 KB Output is correct
33 Correct 19 ms 31436 KB Output is correct
34 Correct 20 ms 31372 KB Output is correct
35 Correct 73 ms 150008 KB Output is correct
36 Correct 14 ms 26296 KB Output is correct
37 Correct 86 ms 160944 KB Output is correct
38 Correct 112 ms 239052 KB Output is correct
39 Correct 135 ms 238120 KB Output is correct
40 Correct 111 ms 239508 KB Output is correct
41 Correct 122 ms 238160 KB Output is correct
42 Correct 13 ms 14248 KB Output is correct
43 Correct 10 ms 15224 KB Output is correct
44 Execution timed out 1102 ms 243352 KB Time limit exceeded
45 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 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
8 Correct 1 ms 468 KB Output is correct
9 Correct 0 ms 596 KB Output is correct
10 Correct 1 ms 1236 KB Output is correct
11 Correct 1 ms 1876 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 5 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 6 ms 11092 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 171 ms 31716 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 7 ms 15444 KB Output is correct
24 Correct 12 ms 25364 KB Output is correct
25 Correct 9 ms 19072 KB Output is correct
26 Correct 7 ms 13840 KB Output is correct
27 Correct 8 ms 14804 KB Output is correct
28 Correct 14 ms 28664 KB Output is correct
29 Correct 15 ms 21716 KB Output is correct
30 Correct 10 ms 17236 KB Output is correct
31 Correct 11 ms 20348 KB Output is correct
32 Correct 10 ms 19540 KB Output is correct
33 Correct 19 ms 31508 KB Output is correct
34 Correct 21 ms 31500 KB Output is correct
35 Correct 68 ms 149972 KB Output is correct
36 Correct 13 ms 26196 KB Output is correct
37 Correct 97 ms 160900 KB Output is correct
38 Correct 122 ms 238992 KB Output is correct
39 Correct 128 ms 238020 KB Output is correct
40 Correct 115 ms 239564 KB Output is correct
41 Correct 112 ms 238008 KB Output is correct
42 Correct 11 ms 14292 KB Output is correct
43 Correct 10 ms 15276 KB Output is correct
44 Execution timed out 1105 ms 243360 KB Time limit exceeded
45 Halted 0 ms 0 KB -