Submission #1603112
Source Code Expand
#include<bits/stdc++.h> using namespace std; using ll = long long; #define rep(i,n) for(ll i=0; i<n;i++) using pii = pair<ll,ll>; #define int ll ll INF=LLONG_MAX/10; signed main(){ ll n,m; cin>>n>>m; vector<vector<pii>>edge(n,vector<pii>()); rep(i,m){ ll a,b,c; cin>>a>>b>>c; edge[--a].push_back(pii(--b,c)); } vector<ll>d(n,0); vector<bool>visit(n,false); visit[0]=true; rep(v,n)rep(i,edge[v].size()){ bool update=false; ll next=edge[v][i].first; if(visit[next]==false or (d[next]<d[v]+edge[v][i].second)){ d[next]=d[v]+edge[v][i].second; update=true; if(visit[next])return puts("inf")*0; else visit[next]=true; } if(!update)break; } 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 | 829 Byte |
Status | WA |
Exec Time | 3 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||||
Status |
|
|
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 | WA | 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 | 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 | 2 ms | 256 KB |
subtask_1_13.txt | WA | 1 ms | 256 KB |
subtask_1_14.txt | AC | 2 ms | 256 KB |
subtask_1_15.txt | AC | 3 ms | 384 KB |
subtask_1_16.txt | WA | 1 ms | 256 KB |
subtask_1_17.txt | WA | 1 ms | 256 KB |
subtask_1_18.txt | WA | 2 ms | 256 KB |
subtask_1_19.txt | WA | 2 ms | 384 KB |
subtask_1_2.txt | AC | 2 ms | 256 KB |
subtask_1_20.txt | WA | 1 ms | 256 KB |
subtask_1_21.txt | WA | 2 ms | 256 KB |
subtask_1_22.txt | WA | 3 ms | 384 KB |
subtask_1_23.txt | WA | 1 ms | 256 KB |
subtask_1_24.txt | WA | 2 ms | 256 KB |
subtask_1_25.txt | WA | 2 ms | 256 KB |
subtask_1_26.txt | AC | 2 ms | 256 KB |
subtask_1_27.txt | AC | 2 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 | 2 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 |