提出 #35596046

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,n) for (ll i=a;i<(ll)n;i++)

const int N=27; // [0,N)

pair<ll,int> f[N][N][N]; // sum, max visit code in path

ll read(){ll r;scanf("%lld",&r);return r;}
const ll INF=0x3f3f3f3f3f3f3f3f;
char t[10];
ll cost[N*N*N+10];
int enc(int a,int b,int c){return c+N*(b+N*a);}
int main(){
  int n=read();
  rep(i,0,n){
    char*s=t+2;
    rep(j,0,2)t[j]=0; // 0 1 2 3 4
    scanf("%s",s);  //     x x x
    int sz=strlen(s);
    rep(j,0,sz)s[j]-='a'-1;
    cost[enc(t[sz-1],t[sz],t[sz+1])]=read();
  }
  rep(i,0,N)rep(j,0,N)rep(k,0,N)f[i][j][k]={-INF,-1};
  ll ans=-INF;
  vector<pair<pair<ll,int>,tuple<int,int,int> > > smabc;
  smabc.push_back({{0,-1},{0,0,0}});
  rep(i,0,smabc.size()){
    auto [sm,abc]=smabc[i];
    auto [s,m]=sm;
    auto [a,b,c]=abc;
    if(f[a][b][c].first > s)continue;
    assert(f[a][b][c].second ==m);
    if(enc(a,b,c)!=0)ans=max(ans,s); // 非起始点
    if(m == enc(a,b,c)){ // || s > 18278* (ll)3000000000){
      printf("Infinity\n");
      return 0;
    }
    rep(ch,1,N){ // a,b,c -> b,c,ch
      ll nc = s+cost[enc(b,c,ch)]; // newcost
      if(c) nc +=cost[enc(0,0,ch)];
      if(b) nc +=cost[enc(0,c,ch)];
      if(f[b][c][ch].first < nc){
        f[b][c][ch] = {nc,max(m,enc(a,b,c))};
        smabc.push_back({f[b][c][ch],{b,c,ch}});
      }
    }
  }
  printf("%lld\n",ans);
  return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘ll read()’:
./Main.cpp:10:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   10 | ll read(){ll r;scanf("%lld",&r);return r;}
      |                ~~~~~^~~~~~~~~~~
./Main.cpp: In function ‘int main()’:
./Main.cpp:20:10: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   20 |     scanf("%s",s);  //     x x x
      |     ~~~~~^~~~~~~~

ジャッジ結果