Submission #1279699


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;

template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

int N,M;
vpint G[1111];
vint rG[1111];

bool re[1111];
int ma[1111];
signed main(){
    cin>>N>>M;
    rep(i,M){
        int a,b,c;
        scanf("%lld%lld%lld",&a,&b,&c);
        a--;b--;
        G[a].pb({b,c});
        rG[b].pb(a);
    }

    queue<int>que;
    que.push(N-1);
    re[N-1]=true;
    while(que.size()){
        int v=que.front();
        que.pop();
        for(auto u:rG[v]){
            if(re[u])continue;
            re[u]=true;
            que.push(u);
        }
    }

    fill_n(ma,N,-(LLONG_MAX/10));
    ma[0]=0;
    rep(i,2*N){
        bool update=false;
        rep(v,N){
            for(auto &e:G[v]){
                int u,c;
            tie(u,c)=e;
                if(!re[v]||!re[u])continue;
                if(ma[u]<ma[v]+c){
                    ma[u]=ma[v]+c;
                    update=true;
                }
            }
        }
        if(update&&i>=N){
            cout<<"inf"<<endl;
            return 0;
        }
    }
    cout<<ma[N-1]<<endl;
    return 0;
}

Submission Info

Submission Time
Task D - Score Attack
User latte0119
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1499 Byte
Status AC
Exec Time 12 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld%lld",&a,&b,&c);
                                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_1.txt AC 2 ms 384 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 2 ms 384 KB
subtask_1_12.txt AC 7 ms 384 KB
subtask_1_13.txt AC 4 ms 256 KB
subtask_1_14.txt AC 5 ms 384 KB
subtask_1_15.txt AC 10 ms 384 KB
subtask_1_16.txt AC 1 ms 256 KB
subtask_1_17.txt AC 1 ms 256 KB
subtask_1_18.txt AC 5 ms 384 KB
subtask_1_19.txt AC 10 ms 384 KB
subtask_1_2.txt AC 7 ms 384 KB
subtask_1_20.txt AC 4 ms 256 KB
subtask_1_21.txt AC 6 ms 384 KB
subtask_1_22.txt AC 12 ms 384 KB
subtask_1_23.txt AC 1 ms 256 KB
subtask_1_24.txt AC 7 ms 384 KB
subtask_1_25.txt AC 3 ms 384 KB
subtask_1_26.txt AC 4 ms 384 KB
subtask_1_27.txt AC 4 ms 384 KB
subtask_1_3.txt AC 4 ms 384 KB
subtask_1_4.txt AC 7 ms 384 KB
subtask_1_5.txt AC 2 ms 384 KB
subtask_1_6.txt AC 5 ms 384 KB
subtask_1_7.txt AC 6 ms 384 KB
subtask_1_8.txt AC 7 ms 384 KB
subtask_1_9.txt AC 1 ms 256 KB