Submission #1647455
Source Code Expand
#include<bits/stdc++.h> #define rep(i,n) for(int i=0; i<n;i++) using namespace std; using ll = long long; #define int ll int INF = -LONG_MAX/100; signed main(){ using pii = pair<int,int>; using piii = pair<pii,int>; vector<piii>edge; int n,m; cin>>n>>m; rep(i,m){ piii hoge; cin>>hoge.first.first>>hoge.first.second>>hoge.second; edge.push_back(hoge); } vector<int>d(n,INF); d[0]=0; for(int v=0; v<n*3;v++){ bool update=false; rep(i,edge.size()){ int from=edge[i].first.first-1; int to=edge[i].first.second-1; int cost=edge[i].second; if(d[from]==INF)continue; if(d[to]<d[from]+cost){ d[to]=d[from]+cost; if(to==n-1)update=true; } } if(update&&v>2*n)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 | 400 |
Code Size | 926 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 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 | 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 | 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 | 7 ms | 384 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |
subtask_1_14.txt | AC | 6 ms | 256 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 | 9 ms | 384 KB |
subtask_1_19.txt | AC | 8 ms | 384 KB |
subtask_1_2.txt | AC | 6 ms | 256 KB |
subtask_1_20.txt | AC | 1 ms | 256 KB |
subtask_1_21.txt | AC | 6 ms | 256 KB |
subtask_1_22.txt | AC | 18 ms | 384 KB |
subtask_1_23.txt | AC | 1 ms | 256 KB |
subtask_1_24.txt | AC | 8 ms | 384 KB |
subtask_1_25.txt | AC | 5 ms | 256 KB |
subtask_1_26.txt | AC | 6 ms | 256 KB |
subtask_1_27.txt | AC | 9 ms | 256 KB |
subtask_1_3.txt | AC | 4 ms | 256 KB |
subtask_1_4.txt | AC | 6 ms | 256 KB |
subtask_1_5.txt | AC | 3 ms | 256 KB |
subtask_1_6.txt | AC | 6 ms | 256 KB |
subtask_1_7.txt | AC | 5 ms | 256 KB |
subtask_1_8.txt | AC | 6 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |