Submission #616739

---

Source Code Expand

#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 25305, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;

int n, m, sv, tv;

vi to[MX], co[MX];
vi eto[MX], eco[MX];

vi dist;

bool f(int c) {
  vi ds(n,INF);
  ds[sv] = 0;
  priority_queue<P,vp,greater<P>> q;
  q.push(P(0,sv));
  while (sz(q)) {
    P p = q.top(); q.pop();
    int d = p.fi;
    int v = p.se;
    if (ds[v] < d) continue;
    rep(i,sz(to[v])) {
      int u = to[v][i];
      int nd = d+co[v][i];
      int eu = eto[v][i];
      int ed = d+eco[v][i]+dist[eu];
      if (ed <= c && nd < ds[u]) {
        ds[u] = nd;
        q.push(P(nd,u));
      }
    }
  }
  return ds[tv] <= c;
}

int main() {
  scanf("%d%d%d%d",&n,&m,&sv,&tv);
  rep(mi,m) {
    int l;
    scanf("%d",&l);
    vi v(l);
    rep(i,l) scanf("%d",&v[i]);
    vi c(l-1);
    rep(i,l-1) scanf("%d",&c[i]);
    int sum = 0;
    int tot = 0;
    rep(i,l-1) tot += c[i];
    rep(i,l-1) {
      int a = v[i], b = v[i+1];
      to[a].pb(b); co[a].pb(c[i]);
      to[b].pb(a); co[b].pb(c[i]);
      eto[a].pb(v.back()); eco[a].pb(tot-sum);
      sum += c[i];
      eto[b].pb(v[0]); eco[b].pb(sum);
    }
  }
  dist = vi(n,INF);
  dist[tv] = 0;
  priority_queue<P,vp,greater<P>> q;
  q.push(P(0,tv));
  while (sz(q)) {
    P p = q.top(); q.pop();
    int d = p.fi;
    int v = p.se;
    if (dist[v] < d) continue;
    rep(i,sz(to[v])) {
      int u = to[v][i];
      int nd = d+co[v][i];
      if (nd < dist[u]) {
        dist[u] = nd;
        q.push(P(nd,u));
      }
    }
  }
  // priv(dist);
  // cout<<f(6)<<endl; return 0;
  int l = 0, r = INF;
  while (l+1<r) {
    int c = (l+r)>>1;
    if (f(c)) r = c; else l = c;
  }
  cout<<r<<endl;
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:80:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d",&n,&m,&sv,&tv);
                                  ^
./Main.cpp:83:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&l);
                   ^
./Main.cpp:85:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     rep(i,l) scanf("%d",&v[i]);
                               ^
./Main.cpp:87:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     rep(i,l-1) scanf("%d",&c[i]);
                                 ^

Judge Result