# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
705512 | 2023-03-04T14:55:18 Z | Alihan_8 | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 1 ms | 340 KB |
#include <bits/stdc++.h> // include <ext/pb_ds/assoc_container.hpp> // include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; using namespace std; #define all(x) x.begin(), x.end() #define pb push_back // define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> #define mpr make_pair #define ln '\n' void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} #define int long long signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n, m; cin >> n >> m; vector <int> g[n]; for ( int i = 1; i <= m; i++ ){ int pos, val; cin >> pos >> val; g[pos].pb(val); } const int N = 2e3+1; vector <vector<int>> dis(n, vector <int> (N, -1)); queue <pair<int,int>> q; for ( auto i: g[0] ){ dis[0][i] = 0; q.push({0, i}); } while ( !q.empty() ){ auto [cur, val] = q.front(); q.pop(); if ( cur == 1 ){ cout << dis[cur][val] << ln; return 0; } for ( auto sign: {-1, 1} ){ int to = cur-val*sign; if ( to >= 0 and to < n ){ if ( dis[to][val] == -1 ){ dis[to][val] = dis[cur][val]+1; q.push({to, val}); } for ( auto w: g[to] ){ if ( dis[cur][w] != -1 ) continue; dis[to][w] = dis[cur][val]+1; q.push({to, w}); } } } } cout << "-1"; cout << '\n'; } /* 5 3 0 2 1 1 4 1 */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Incorrect | 0 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Incorrect | 0 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Incorrect | 1 ms | 316 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Incorrect | 0 ms | 320 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Incorrect | 1 ms | 340 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |