結果
問題 | No.1545 [Cherry 2nd Tune N] Anthem |
ユーザー | t98slider |
提出日時 | 2021-06-11 23:56:55 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,643 bytes |
コンパイル時間 | 2,985 ms |
コンパイル使用メモリ | 186,708 KB |
実行使用メモリ | 1,221,592 KB |
最終ジャッジ日時 | 2024-12-15 03:55:07 |
合計ジャッジ時間 | 61,778 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,636 KB |
testcase_01 | AC | 2 ms
497,956 KB |
testcase_02 | AC | 2 ms
13,640 KB |
testcase_03 | AC | 2 ms
213,280 KB |
testcase_04 | AC | 253 ms
298,016 KB |
testcase_05 | TLE | - |
testcase_06 | TLE | - |
testcase_07 | AC | 1,848 ms
495,192 KB |
testcase_08 | TLE | - |
testcase_09 | AC | 976 ms
455,296 KB |
testcase_10 | AC | 121 ms
86,308 KB |
testcase_11 | TLE | - |
testcase_12 | TLE | - |
testcase_13 | AC | 1,743 ms
128,512 KB |
testcase_14 | AC | 1,609 ms
297,984 KB |
testcase_15 | AC | 71 ms
32,000 KB |
testcase_16 | TLE | - |
testcase_17 | AC | 112 ms
6,820 KB |
testcase_18 | AC | 1,639 ms
98,828 KB |
testcase_19 | TLE | - |
testcase_20 | AC | 786 ms
19,840 KB |
testcase_21 | MLE | - |
testcase_22 | AC | 283 ms
251,508 KB |
testcase_23 | AC | 1,270 ms
36,096 KB |
testcase_24 | AC | 91 ms
6,816 KB |
testcase_25 | AC | 143 ms
9,216 KB |
testcase_26 | AC | 4 ms
6,820 KB |
testcase_27 | AC | 64 ms
11,776 KB |
testcase_28 | AC | 214 ms
7,808 KB |
testcase_29 | AC | 155 ms
6,816 KB |
testcase_30 | AC | 140 ms
7,168 KB |
testcase_31 | AC | 164 ms
11,648 KB |
testcase_32 | AC | 56 ms
7,680 KB |
testcase_33 | AC | 212 ms
9,600 KB |
testcase_34 | AC | 157 ms
9,984 KB |
testcase_35 | AC | 609 ms
13,696 KB |
testcase_36 | AC | 435 ms
11,136 KB |
testcase_37 | AC | 25 ms
6,816 KB |
testcase_38 | AC | 226 ms
10,240 KB |
testcase_39 | AC | 36 ms
7,296 KB |
testcase_40 | AC | 87 ms
6,820 KB |
testcase_41 | AC | 15 ms
6,820 KB |
testcase_42 | AC | 147 ms
9,344 KB |
testcase_43 | AC | 173 ms
7,936 KB |
testcase_44 | AC | 6 ms
6,820 KB |
testcase_45 | AC | 8 ms
11,904 KB |
testcase_46 | AC | 22 ms
16,136 KB |
testcase_47 | AC | 41 ms
28,712 KB |
testcase_48 | AC | 75 ms
59,916 KB |
testcase_49 | AC | 67 ms
37,580 KB |
testcase_50 | AC | 97 ms
59,596 KB |
testcase_51 | AC | 42 ms
16,336 KB |
testcase_52 | AC | 140 ms
58,008 KB |
testcase_53 | AC | 60 ms
42,128 KB |
testcase_54 | AC | 9 ms
6,816 KB |
testcase_55 | AC | 102 ms
54,020 KB |
testcase_56 | AC | 7 ms
6,816 KB |
testcase_57 | AC | 75 ms
32,824 KB |
testcase_58 | AC | 64 ms
40,932 KB |
testcase_59 | AC | 13 ms
10,444 KB |
testcase_60 | AC | 22 ms
22,032 KB |
testcase_61 | AC | 25 ms
14,840 KB |
testcase_62 | AC | 71 ms
29,224 KB |
testcase_63 | AC | 31 ms
15,664 KB |
testcase_64 | TLE | - |
testcase_65 | AC | 54 ms
18,560 KB |
testcase_66 | MLE | - |
ソースコード
#include <bits/stdc++.h> #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define rep(i,n) for(int i=0;i<(int)(n);i++) #define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++) #define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++) #define codefor int test;scanf("%d",&test);while(test--) #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define yes(ans) if(ans)printf("yes\n");else printf("no\n") #define Yes(ans) if(ans)printf("Yes\n");else printf("No\n") #define YES(ans) if(ans)printf("YES\n");else printf("NO\n") #define popcount(v) __builtin_popcount(v) #define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__)) #define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__))) #define umap unordered_map #define uset unordered_set using namespace std; using ll = long long; const int MOD=1000000007; const int MOD2=998244353; const int INF=1<<30; const ll INF2=1LL<<60; //入力系 void scan(int& a){scanf("%d",&a);} void scan(long long& a){scanf("%lld",&a);} template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);} template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));} template<class T> void scan(T& a){cin>>a;} template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);} void in(){} template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);} //出力系 void print(const int& a){printf("%d",a);} void print(const long long& a){printf("%lld",a);} void print(const double& a){printf("%.15lf",a);} template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);} template<class T> void print(const T& a){cout<<a;} template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}} void out(){putchar('\n');} template<class T> void out(const T& t){print(t);putchar('\n');} template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);} //デバッグ系 template<class T> void dprint(const T& a){cerr<<a;} template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}} void debug(){cerr<<endl;} template<class T> void debug(const T& t){dprint(t);cerr<<endl;} template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);} ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; } ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;} ll updivide(ll a,ll b){return (a+b-1)/b;} template<class T> void chmax(T &a,const T b){if(b>a)a=b;} template<class T> void chmin(T &a,const T b){if(b<a)a=b;} int maxv; ll rec(int v,int t,int i,int k,vector<ll> &x,vector<vector<pair<int,int>>> &g,vector<vector<ll>> &dp){ if(i>=k-1&&v==t){ return dp[v][i]=x[v]; } if(i+1>=maxv)return dp[v][i]=(1LL<<59); if(dp[v][i]!=-1)return dp[v][i]; dp[v][i]=(1LL<<59); int u,w; rep(j,g[v].size()){ tie(u,w)=g[v][j]; chmin(dp[v][i],x[v]+w+rec(u,t,i+1,k,x,g,dp)); } return dp[v][i]; } ll target; vector<int> order; bool rec2(int v,int t,int i,int k,ll value,vector<ll> &x, vector<vector<pair<int,int>>> &g,vector<vector<ll>> &dp,vector<vector<bool>> &dp2){ if(i>=k-1&&v==t&&value==x[v]){ order.push_back(v+1); out(order.size()); out(order); return 1; } if(i+1>=maxv)return false; if(dp2[v][i])return false; int u,w; order.push_back(v+1); rep(j,g[v].size()){ tie(u,w)=g[v][j]; if(value-(x[v]+w)==dp[u][i+1]){ if(rec2(u,t,i+1,k,dp[u][i+1],x,g,dp,dp2))return true; } } order.pop_back(); dp[v][i]=true; return false; } int main(){ INT(n,s,t,k); s--,t--; vector<ll> x(n); vector<vector<pair<int,int>>> g(n); in(x); INT(m); int u,v,w; rep(i,m){ in(u,v,w); g[--u].emplace_back(--v,w); } if(k>=1000){ maxv=10*k; vector2d(ll,dp,n,maxv,-1); vector2d(bool,dp2,n,maxv,false); ll ans=rec(s,t,0,k,x,g,dp); if(ans>=(1LL<<59)){ out("Impossible"); return 0; } out("Possible"); out(ans); rec2(s,t,0,k,ans,x,g,dp,dp2); }else if(n>=1000){ maxv=10*k; for(int i=1;i<=100;i++){ if(i*k*n<=100000000){ maxv=i*k; }else break; } vector2d(ll,dp,n,maxv,-1); vector2d(bool,dp2,n,maxv,false); ll ans=rec(s,t,0,k,x,g,dp); if(ans>=(1LL<<59)){ out("Impossible"); return 0; } out("Possible"); out(ans); rec2(s,t,0,k,ans,x,g,dp,dp2); }else{ maxv=100*k; vector2d(ll,dp,n,maxv,-1); vector2d(bool,dp2,n,maxv,false); ll ans=rec(s,t,0,k,x,g,dp); if(ans>=(1LL<<59)){ out("Impossible"); return 0; } out("Possible"); out(ans); rec2(s,t,0,k,ans,x,g,dp,dp2); } }