結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー | kiyoshi0205 |
提出日時 | 2021-06-11 22:43:22 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,370 bytes |
コンパイル時間 | 3,248 ms |
コンパイル使用メモリ | 199,452 KB |
実行使用メモリ | 34,120 KB |
最終ジャッジ日時 | 2024-12-15 01:11:35 |
合計ジャッジ時間 | 14,318 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 62 ms
15,828 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 70 ms
16,588 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 59 ms
14,076 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 20 ms
6,144 KB |
testcase_16 | WA | - |
testcase_17 | AC | 33 ms
7,424 KB |
testcase_18 | AC | 170 ms
22,288 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 102 ms
14,720 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | AC | 5 ms
5,248 KB |
testcase_45 | AC | 5 ms
5,504 KB |
testcase_46 | AC | 5 ms
5,248 KB |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | AC | 6 ms
5,248 KB |
testcase_57 | WA | - |
testcase_58 | AC | 10 ms
6,656 KB |
testcase_59 | WA | - |
testcase_60 | AC | 6 ms
5,248 KB |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | WA | - |
testcase_66 | WA | - |
コンパイルメッセージ
main.cpp: In function 'int main()': main.cpp:123:16: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 123 | for(auto [d,to]:g[j]){ | ^ main.cpp:151:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 151 | for(auto [d,x]:g[ans.back()]){ | ^
ソースコード
#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>using namespace std;using ll=long long;using datas=pair<ll,ll>;using ddatas=pair<long double,long double>;using tdata=pair<ll,datas>;using vec=vector<ll>;using mat=vector<vec>;using pvec=vector<datas>;using pmat=vector<pvec>;#define For(i,a,b) for(i=a;i<(ll)b;++i)#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)#define rep(i,N) For(i,0,N)#define rep1(i,N) For(i,1,N)#define brep(i,N) bFor(i,N,0)#define brep1(i,N) bFor(i,N,1)#define all(v) (v).begin(),(v).end()#define allr(v) (v).rbegin(),(v).rend()#define vsort(v) sort(all(v))#define vrsort(v) sort(allr(v))#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())#define endl "\n"#define popcount __builtin_popcountll#define eb emplace_back#define print(x) cout<<x<<endl#define printyes print("Yes")#define printno print("No")#define printYES print("YES")#define printNO print("NO")#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)constexpr ll mod=1000000007;// constexpr ll mod=998244353;constexpr ll inf=1LL<<60;constexpr long double eps=1e-9;const long double PI=acosl(-1);template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}template<class T> ostream& operator<<(ostream& os,const vector<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> ostream& operator<<(ostream& os,const set<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> ostream& operator<<(ostream& os,const multiset<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T,class E> ostream& operator<<(ostream& os,const map<T,E>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> inline bool chmax(T& a,const T b){bool x=a<b;if(x)a=b;return x;}template<class T> inline bool chmin(T& a,const T b){bool x=a>b;if(x)a=b;return x;}#ifdef DEBUGvoid debugg(){cout<<endl;}template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)#else#define debug(...) (void(0))#endifinline void startupcpp(void) noexcept{cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}vector<ll> dijkstra(pmat& g,ll first){priority_queue<datas,pvec,greater<datas>> que;que.emplace(0,first);vector<ll> dist(g.size(),inf);while(!que.empty()){datas x=que.top();que.pop();if(!chmin(dist[x.second],x.first))continue;for(auto next:g[x.second]){next.first+=x.first;if(!chmin(dist[next.second],next.first+1))continue;que.emplace(next);}}return dist;}ll N,M,K,H,W,A,B,C,D;int main(){startupcpp();ll i,j;cin>>N>>A>>B>>K;--A;--B;vec x(N);rep(i,N){cin>>x[i];x[i]*=2;assert(x[i]>0);}cin>>M;pmat g(N),rg(N);rep(i,M){ll a,b,c;cin>>a>>b>>c;assert(c>0);c*=2;--a;--b;g[a].emplace_back(c+(x[a]+x[b])/2,b);rg[b].emplace_back(c+(x[a]+x[b])/2,a);}mat dp(K,vec(N,inf)),bf(K,vec(N,inf));dp[0][A]=x[A]/2;rep(i,K-1){rep(j,N){for(auto [d,to]:g[j]){if(chmin(dp[i+1][to],dp[i][j]+d)){assert(dp[i+1][to]<inf&&dp[i][j]<inf);bf[i+1][to]=j;}}}}auto dist=dijkstra(rg,B);vec anslist(N);rep(i,N)anslist[i]=dist[i]+dp[K-1][i];i=min_element(all(anslist))-anslist.begin();if(anslist[i]>=inf){print("Impossible");return 0;}assert(dist[i]<inf&&dp[K-1][i]<inf);print("Possible");assert((anslist[i]+x[B]/2)%2==0);print((anslist[i]+x[B]/2)/2);vec ans(K);ans[K-1]=i;rep1(j,K){// assert(dp[j][ans[j]]<inf);ans[j-1]=bf[j][ans[j]];}// assert(ans[0]==A);while(ans.back()!=B){for(auto [d,x]:g[ans.back()]){if(dist[ans.back()]==dist[x]+d){ans.emplace_back(x);break;}}}print(ans.size());for(auto& x:ans)++x;output(ans);}