結果
問題 | No.1382 Travel in Mitaru city |
ユーザー |
![]() |
提出日時 | 2021-02-05 19:28:31 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 69 ms / 2,000 ms |
コード長 | 2,758 bytes |
コンパイル時間 | 1,081 ms |
コンパイル使用メモリ | 118,260 KB |
実行使用メモリ | 12,120 KB |
最終ジャッジ日時 | 2024-07-04 03:37:20 |
合計ジャッジ時間 | 5,497 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 68 |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:93:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 93 | auto [num,v] = q.top();q.pop(); | ^
ソースコード
#include <iostream>#include <iomanip>#include <algorithm>#include <assert.h>#include <complex>#include <utility>#include <vector>#include <string>#include <stack>#include <queue>#include <tuple>#include <cmath>#include <bitset>#include <cctype>#include <set>#include <map>#include <unordered_map>#include <numeric>#include <functional>#include <chrono>#define _overload3(_1,_2,_3,name,...) name#define _rep(i,n) repi(i,0,n)#define repi(i,a,b) for(int i=a;i<b;++i)#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)#define _rrep(i,a) rrepi(i,a,0)#define rrepi(i,a,b) for(int i=a-1;i>=b;--i)#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)#define all(x) (x).begin(),(x).end()#define PRINT(V) cout << V << "\n"#define SORT(V) sort((V).begin(),(V).end())#define RSORT(V) sort((V).rbegin(), (V).rend())using namespace std;using ll = long long;template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }inline void Yes(bool condition){ if(condition) PRINT("Yes"); else PRINT("No"); }template<class itr> void cins(itr first,itr last){for (auto i = first;i != last;i++){cin >> (*i);}}template<class itr> void array_output(itr start,itr goal){string ans = "",k = " ";for (auto i = start;i != goal;i++) ans += to_string(*i)+k;if (!ans.empty()) ans.pop_back();PRINT(ans);}ll gcd(ll a, ll b) {return a ? gcd(b%a,a) : b;}const ll INF = 1e18;const ll MOD = 1000000007;const ll MOD2 = 998244353;const ll MOD3 = 1e6;const ll EPS = 1e-10;int sgn(const double a){return (a < -EPS ? -1 : (a > EPS ? +1 : 0));}typedef pair<int,int> pi;typedef pair<ll,ll> P;typedef tuple<ll,ll,ll> tri;typedef pair<double,double> point;typedef complex<double> Point;typedef string::const_iterator State;const ll MAX = 105;constexpr ll nx[4] = {-1,0,1,0};constexpr ll ny[4] = {0,1,0,-1};constexpr ll flip[5] = {0,1,0,1,0};int main(){cin.tie(0);ios::sync_with_stdio(false);ll n,m,s,t;cin >> n >> m >> s >> t;s--,t--;vector<ll> p(n);cins(all(p));vector<vector<ll>> g(n);rep(i,m){ll a,b;cin >> a >> b;a--,b--;g[a].push_back(b);g[b].push_back(a);}priority_queue<P> q;q.push(P(p[s],s));vector<bool> done(n,false);done[s] = true;ll cnt = 0,now = p[s];while(!q.empty()){auto [num,v] = q.top();q.pop();if (chmin(now,num)){cnt++;}for (ll u:g[v]){if (done[u]) continue;done[u] = true;q.push(P(p[u],u));}}PRINT(cnt);}