Submission #1280266
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
if(x > y) x = y;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD = 1e9+7;
const LL INF = 1e18;
int main(){
LL N, M;
cin >> N >> M;
vector<vector<PLL>> G(N);
REP(i,M){
LL a, b, c;
cin >> a >> b >> c;
--a;
--b;
G[a].EB(b, c);
}
VL dist(N, -INF);
dist[0] = 0;
REP(i,N+1){
REP(j,N){
for(PLL& e: G[j]){
maxi(dist[e.FF], dist[j] + e.SS);
}
}
}
VL dist2 = dist;
REP(i,N*2+1){
REP(j,N){
for(PLL& e: G[j]){
maxi(dist2[e.FF], dist2[j] + e.SS);
}
}
}
if(dist[N-1] < dist2[N-1])
cout << "inf" << endl;
else
cout << dist[N-1] << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Score Attack |
User |
okaduki |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1685 Byte |
Status |
AC |
Exec Time |
20 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 |
9 ms |
384 KB |
subtask_1_13.txt |
AC |
5 ms |
256 KB |
subtask_1_14.txt |
AC |
9 ms |
256 KB |
subtask_1_15.txt |
AC |
20 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 |
7 ms |
256 KB |
subtask_1_19.txt |
AC |
16 ms |
384 KB |
subtask_1_2.txt |
AC |
7 ms |
256 KB |
subtask_1_20.txt |
AC |
6 ms |
256 KB |
subtask_1_21.txt |
AC |
8 ms |
256 KB |
subtask_1_22.txt |
AC |
19 ms |
384 KB |
subtask_1_23.txt |
AC |
1 ms |
256 KB |
subtask_1_24.txt |
AC |
12 ms |
384 KB |
subtask_1_25.txt |
AC |
4 ms |
256 KB |
subtask_1_26.txt |
AC |
8 ms |
256 KB |
subtask_1_27.txt |
AC |
8 ms |
256 KB |
subtask_1_3.txt |
AC |
5 ms |
256 KB |
subtask_1_4.txt |
AC |
7 ms |
256 KB |
subtask_1_5.txt |
AC |
4 ms |
256 KB |
subtask_1_6.txt |
AC |
10 ms |
256 KB |
subtask_1_7.txt |
AC |
6 ms |
256 KB |
subtask_1_8.txt |
AC |
7 ms |
256 KB |
subtask_1_9.txt |
AC |
1 ms |
256 KB |