結果

問題 No.1545 [Cherry 2nd Tune N] Anthem
ユーザー kiyoshi0205kiyoshi0205
提出日時 2021-06-11 22:44:40
言語 C++14
(gcc 10.2.0 + boost 1.73.0)
結果
AC  
実行時間 175 ms / 3,000 ms
コード長 4,371 Byte
コンパイル時間 2,529 ms
使用メモリ 34,028 KB
最終ジャッジ日時 2021-06-11 22:44:58
合計ジャッジ時間 17,379 ms
ジャッジサーバーID
(参考情報)
judge6 / judge10
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 1 ms
3,440 KB
testcase_01 AC 2 ms
3,404 KB
testcase_02 AC 2 ms
3,348 KB
testcase_03 AC 2 ms
3,304 KB
testcase_04 AC 56 ms
15,656 KB
testcase_05 AC 159 ms
26,536 KB
testcase_06 AC 63 ms
13,676 KB
testcase_07 AC 65 ms
16,472 KB
testcase_08 AC 104 ms
15,808 KB
testcase_09 AC 51 ms
10,096 KB
testcase_10 AC 56 ms
13,984 KB
testcase_11 AC 88 ms
16,900 KB
testcase_12 AC 150 ms
24,588 KB
testcase_13 AC 46 ms
10,760 KB
testcase_14 AC 60 ms
14,996 KB
testcase_15 AC 17 ms
6,080 KB
testcase_16 AC 78 ms
19,108 KB
testcase_17 AC 28 ms
7,380 KB
testcase_18 AC 175 ms
22,232 KB
testcase_19 AC 82 ms
14,384 KB
testcase_20 AC 26 ms
7,144 KB
testcase_21 AC 141 ms
24,488 KB
testcase_22 AC 112 ms
20,828 KB
testcase_23 AC 105 ms
14,684 KB
testcase_24 AC 4 ms
3,816 KB
testcase_25 AC 3 ms
3,688 KB
testcase_26 AC 1 ms
3,380 KB
testcase_27 AC 2 ms
3,572 KB
testcase_28 AC 4 ms
3,860 KB
testcase_29 AC 4 ms
3,900 KB
testcase_30 AC 3 ms
3,576 KB
testcase_31 AC 3 ms
3,732 KB
testcase_32 AC 1 ms
3,424 KB
testcase_33 AC 4 ms
3,796 KB
testcase_34 AC 3 ms
3,688 KB
testcase_35 AC 5 ms
4,144 KB
testcase_36 AC 5 ms
4,000 KB
testcase_37 AC 2 ms
3,544 KB
testcase_38 AC 3 ms
3,752 KB
testcase_39 AC 2 ms
3,508 KB
testcase_40 AC 2 ms
3,636 KB
testcase_41 AC 2 ms
3,456 KB
testcase_42 AC 2 ms
3,664 KB
testcase_43 AC 3 ms
3,832 KB
testcase_44 AC 4 ms
4,528 KB
testcase_45 AC 3 ms
5,196 KB
testcase_46 AC 3 ms
4,372 KB
testcase_47 AC 6 ms
5,504 KB
testcase_48 AC 11 ms
9,072 KB
testcase_49 AC 7 ms
6,564 KB
testcase_50 AC 12 ms
9,368 KB
testcase_51 AC 2 ms
3,500 KB
testcase_52 AC 12 ms
9,132 KB
testcase_53 AC 8 ms
6,432 KB
testcase_54 AC 2 ms
3,660 KB
testcase_55 AC 10 ms
8,044 KB
testcase_56 AC 4 ms
4,652 KB
testcase_57 AC 7 ms
6,736 KB
testcase_58 AC 8 ms
6,428 KB
testcase_59 AC 3 ms
4,084 KB
testcase_60 AC 4 ms
4,548 KB
testcase_61 AC 3 ms
4,348 KB
testcase_62 AC 6 ms
6,008 KB
testcase_63 AC 4 ms
4,576 KB
testcase_64 AC 85 ms
23,436 KB
testcase_65 AC 2 ms
3,632 KB
testcase_66 AC 74 ms
34,028 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: 関数 ‘int main()’ 内:
main.cpp:123:16: 警告: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’
  123 |       for(auto [d,to]:g[j]){
      |                ^
main.cpp:151:14: 警告: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’
  151 |     for(auto [d,x]:g[ans.back()]){
      |              ^

ソースコード

diff #

#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 DEBUG
void 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))
#endif

inline 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;
  brep1(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);
}
0