Submission #50610582

---

Source Code Expand

#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn = 2e5 + 10;
static char buf[1000000],*p1=buf,*p2=buf;
#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++
inline int read(){int x=0,f=1;char c=getchar();while(c<'0' || c>'9'){if(c=='-') f=-1;c=getchar();}while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+c-48;c=getchar();}return x*f;}
inline void write(long long x){static char buf[20];static int len=-1;if(x<0)putchar('-'),x=-x;do buf[++len]=x%10,x/=10;while(x);while(len>=0)putchar(buf[len--]+48);}
#define put() putchar(' ')
#define endl puts("")
struct node
{
    int nxt,to,w,l,d,k;
}e[maxn];
int head[maxn],tot;
void add_edge(int u,int v,int w,int l,int d,int k)
{
    e[++tot] = {head[u],v,w,l,d,k};
    head[u] = tot;
}
int n,m;
long long ans[maxn];
bool vis[maxn];

int main()
{
    n = read();
    m = read();
    for(int i = 1;i <= m;++i)
    {
        int l,d,k,w,u,v;
        l = read();
        d = read();
        k = read();
        w = read();
        u = read();
        v = read();
        add_edge(v,u,w,l,d,k);
    }
    queue<int> q;
    for(int i = head[n];i;i = e[i].nxt)
    {
        int w = e[i].w,l = e[i].l,d = e[i].d,k = e[i].k;
        ans[e[i].to] = l + 1ll * (k - 1) * d;
        q.push(e[i].to);
        vis[e[i].to] = 1;
    }
    while(!q.empty())
    {
        int u = q.front();
        vis[u] = 0;
        q.pop();
        for(int i = head[u];i;i = e[i].nxt)
        {
            int v = e[i].to;
            if(ans[u] < e[i].w || ans[v] > ans[u] || v == n)
            {
                continue;
            }
            long long t = ans[u] - e[i].w;
            t -= e[i].l;
            t /= e[i].d;
            t = min(t,e[i].k - 1ll);
            if(ans[v] < e[i].l + 1ll * t * e[i].d)
            {
                ans[v] = e[i].l + 1ll *  t * e[i].d;
                q.push(v);
                vis[v] = 1;
            }
        }
    }
    for(int i = 1;i < n;++i)
    {
        if(ans[i] != 0)write(ans[i]),endl;
        else puts("Unreachable");
    }
    return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:47:13: warning: unused variable ‘w’ [-Wunused-variable]
   47 |         int w = e[i].w,l = e[i].l,d = e[i].d,k = e[i].k;
      |             ^

Judge Result