Submission #1604532


Source Code Expand

#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n;i++)
using ll = long long;
#define int ll
using namespace std;
using pii = pair<int,int>;
using piii = pair<pair<int,int>,int>;
ll INF =LLONG_MAX/10;
signed main(){
    int n,m; cin>>n>>m;
    vector<piii>edge;
    rep(i,m){
        int a,b,c; cin>>a>>b>>c;
        edge.push_back(piii(pii(--a,--b),c));
    }
    bool update=false;
    vector<int>d(n,-INF);
    vector<bool>visit(n,false);
    visit[0]=true;
    d[0]=0;
    int v=0;
    while(true){
        v++;
        update=false;
        rep(i,edge.size()){
            piii e=edge[i];
            int to=e.first.second;
            int from=e.first.first;
            int cost=e.second;
            if(d[to]==INF)continue;
            if(d[to]<d[from]+cost){
                d[to]=d[from]+cost;
                update=true;
            }
        }
        if(!update)break;
        if(v>n+1){return puts("inf")*0;}
    }
    cout<<d[--n]<<endl;
}

Submission Info

Submission Time
Task D - Score Attack
User yebityon
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1001 Byte
Status WA
Exec Time 7 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 27
WA × 3
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 1 ms 256 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 2 ms 256 KB
subtask_1_12.txt AC 4 ms 384 KB
subtask_1_13.txt AC 1 ms 256 KB
subtask_1_14.txt AC 4 ms 256 KB
subtask_1_15.txt AC 7 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 2 ms 384 KB
subtask_1_19.txt AC 2 ms 384 KB
subtask_1_2.txt AC 2 ms 256 KB
subtask_1_20.txt AC 1 ms 256 KB
subtask_1_21.txt AC 2 ms 256 KB
subtask_1_22.txt AC 3 ms 384 KB
subtask_1_23.txt WA 1 ms 256 KB
subtask_1_24.txt AC 2 ms 384 KB
subtask_1_25.txt WA 2 ms 256 KB
subtask_1_26.txt AC 2 ms 256 KB
subtask_1_27.txt WA 4 ms 256 KB
subtask_1_3.txt AC 2 ms 256 KB
subtask_1_4.txt AC 2 ms 256 KB
subtask_1_5.txt AC 2 ms 256 KB
subtask_1_6.txt AC 4 ms 256 KB
subtask_1_7.txt AC 2 ms 256 KB
subtask_1_8.txt AC 2 ms 256 KB
subtask_1_9.txt AC 1 ms 256 KB