結果
問題 |
No.3291 K-step Navigation
|
ユーザー |
|
提出日時 | 2025-10-03 22:52:58 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,183 bytes |
コンパイル時間 | 1,463 ms |
コンパイル使用メモリ | 169,688 KB |
実行使用メモリ | 14,964 KB |
最終ジャッジ日時 | 2025-10-03 22:53:02 |
合計ジャッジ時間 | 3,716 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 42 WA * 8 |
コンパイルメッセージ
main.cpp:27:41: warning: bad option ‘-fschedule-insnS2’ to pragma ‘optimize’ [-Wpragmas] 27 | #pragma GCC optimize("-fschedule-insnS2") | ^ main.cpp:44:52: warning: bad option ‘-fdelete-null-Pointer-checks’ to pragma ‘optimize’ [-Wpragmas] 44 | #pragma GCC optimize("-fdelete-null-Pointer-checks") | ^ main.cpp:65:10: warning: bad option ‘-fschedule-insnS2’ to attribute ‘optimize’ [-Wattributes] 65 | int main() | ^ main.cpp:65:10: warning: bad option ‘-fdelete-null-Pointer-checks’ to attribute ‘optimize’ [-Wattributes]
ソースコード
#pragma GCC optimize("O3") #pragma GCC optimize(2) #pragma GCC optimize(3) #pragma GCC optimize("Ofast") #pragma GCC optimize("inline") #pragma GCC optimize("-fgcse") #pragma GCC optimize("-fgcse-lm") #pragma GCC optimize("-fipa-sra") #pragma GCC optimize("-ftree-pre") #pragma GCC optimize("-ftree-vrp") #pragma GCC optimize("-fpeephole2") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-fsched-spec") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("-falign-jumps") #pragma GCC optimize("-falign-loops") #pragma GCC optimize("-falign-labels") #pragma GCC optimize("-fdevirtualize") #pragma GCC optimize("-fcaller-saves") #pragma GCC optimize("-fcrossjumping") #pragma GCC optimize("-fthread-jumps") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-freorder-blocks") #pragma GCC optimize("-fschedule-insns") #pragma GCC optimize("inline-functions") #pragma GCC optimize("-ftree-tail-merge") #pragma GCC optimize("-fschedule-insnS2") #pragma GCC optimize("-fstrict-aliasing") #pragma GCC optimize("-falign-functions") #pragma GCC optimize("-fcse-follow-jumps") #pragma GCC optimize("-fsched-interblock") #pragma GCC optimize("-fpartial-inlining") #pragma GCC optimize("no-stack-protector") #pragma GCC optimize("-freorder-functions") #pragma GCC optimize("-findirect-inlining") #pragma GCC optimize("-fhoist-adjacent-loads") #pragma GCC optimize("-frerun-cse-after-loop") #pragma GCC optimize("inline-small-functions") #pragma GCC optimize("-finline-small-functions") #pragma GCC optimize("-ftree-switch-conversion") #pragma GCC optimize("-foptimize-sibling-calls") #pragma GCC optimize("-fexpensive-optimizations") #pragma GCC optimize("inline-functions-called-once") #pragma GCC optimize("-fdelete-null-Pointer-checks") #pragma GCC optimize("Ofast") #include <iostream> #include <algorithm> #include <vector> #include <string> #include <set> #include <unordered_set> #include <cstring> #include <queue> #include <bitset> #include <map> #include <stack> using namespace std; long long int n,m,k,s,t,u,v; bool e[5001][5001]; long long int dp[5001][2][2]; int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> n >> m >> k >> s >> t; for(int i=0;i<m;i++) { cin >> u >> v; e[u][v] = true; e[v][u] = true; } memset(dp,-1,sizeof(dp)); dp[s][0][0] = 0; queue <pair<int,pair<int,int>>> que; que.push(make_pair(s,make_pair(0,0))); while(!que.empty()) { int now = que.front().first; int p = que.front().second.first; int f = que.front().second.second; que.pop(); for(int next=1;next<=n;next++) { if(next==now) continue; if(e[now][next]) { if(dp[next][(1-p)][f]==-1) { dp[next][(1-p)][f] = dp[now][p][f] + 1; que.push(make_pair(next,make_pair(1-p,f))); } } else { if(f==0) { if(dp[next][(1-p)][1]==-1) { dp[next][(1-p)][1] = dp[now][p][f] + 1; que.push(make_pair(next,make_pair(1-p,1))); } } } } } long long int res = 2e18; if(dp[t][k%2][0]!=-1) res = min(res,dp[t][k%2][0]); if(dp[t][k%2][1]!=-1) res = min(res,dp[t][k%2][1]); if(res <= k) cout << "Yes" << '\n'; else cout << "No" << '\n'; return 0; }