Submission #2126214
Source Code Expand
#include "bits/stdc++.h" using namespace std; typedef long long ll; #define INF (1<<30) #define INFLL (1ll<<60) typedef pair<int, int> P; typedef pair<ll, P> E; #define cost first #define from second.first #define to second.second #define MOD (1000000007ll) #define l_ength size void mul_mod(ll& a, ll b){ a *= b; a %= MOD; } int main(void){ int n,m,a,b,i,cnt=0; ll c,d[1234]; vector<E> g; E e; bool flag = true,done[1234],neg[1234]; fill(d,d+1234,INFLL); fill(neg,neg+1234,false); cin >> n >> m; d[1] = 0ll; done[1] = true; for(i=0; i<m; ++i){ cin >> a >> b >> c; g.push_back(E(-c,P(a,b))); } while(true){ for(i=0; i<m; ++i){ e = g[i]; if(d[e.from] < INFLL && d[e.to] > d[e.from] + e.cost){ d[e.to] = d[e.from] + e.cost; } } cnt++; if(cnt == n){ break; } } cnt = 0; while(true){ for(i=0; i<m; ++i){ e = g[i]; if(d[e.from] < INFLL && d[e.to] > d[e.from] + e.cost){ d[e.to] = d[e.from] + e.cost; neg[e.to] = true; } } cnt++; if(cnt == n){ break; } } if(neg[n]){ cout << "inf" << endl; }else{ cout << (-d[n]) << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | ransewhale |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1183 Byte |
Status | AC |
Exec Time | 13 ms |
Memory | 256 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 | 256 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 | 256 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |
subtask_1_17.txt | AC | 1 ms | 256 KB |
subtask_1_18.txt | AC | 7 ms | 256 KB |
subtask_1_19.txt | AC | 5 ms | 256 KB |
subtask_1_2.txt | AC | 4 ms | 256 KB |
subtask_1_20.txt | AC | 1 ms | 256 KB |
subtask_1_21.txt | AC | 4 ms | 256 KB |
subtask_1_22.txt | AC | 13 ms | 256 KB |
subtask_1_23.txt | AC | 1 ms | 256 KB |
subtask_1_24.txt | AC | 6 ms | 256 KB |
subtask_1_25.txt | AC | 4 ms | 256 KB |
subtask_1_26.txt | AC | 4 ms | 256 KB |
subtask_1_27.txt | AC | 7 ms | 256 KB |
subtask_1_3.txt | AC | 3 ms | 256 KB |
subtask_1_4.txt | AC | 4 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 | 4 ms | 256 KB |
subtask_1_8.txt | AC | 4 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |