Submission #1369042

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__",", __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000

int main(){
  int n,m;
  cin>>n>>m;
  vector<vector<pair<int,int>>> vec(n);
  // i*28 + j : i番目の時刻j mod28
  rep(i,m){
    int a,b,c;
    cin>>a>>b>>c;
    if(a!=n-1) vec[a].pb(mp(b, c));
    if(b!=n-1) vec[b].pb(mp(a, c));
  }

  priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > que;
  //pair<dist, idx>
  vector<int> d(n*28, INF);
  d[0] = 0;
  que.push(mp(0,0));
  while(!que.empty()){
    auto p = que.top(); que.pop();
    if(d[p.second] < p.first) continue;
    long dis = p.first;
    for(auto &to : vec[p.second/28]){
      int u = to.first*28 + (dis + to.second)%28;
      int nd = dis + to.second;
      if(d[u] > nd){
        d[u] = nd;
        que.push(mp(d[u], u));
      }
    }
  }

  int ans = INF;
  rep(i,28) if(i%7==0 || i%4==0) ans = min(ans, d[(n-1)*28+i]);
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result