Submission #1279728
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------
int N,M;
vector<pair<int,int>> E[1010];
ll from[1010];
ll to[1010];
ll res[5030];
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>N>>M;
FOR(i,M) {
cin>>x>>y>>r;
E[x-1].push_back({y-1,r});
}
FOR(i,N) from[i]=-1LL<<60;
from[0]=0;
memmove(to,from,sizeof(from));
FOR(i,5020) {
FOR(x,N) FORR(r,E[x]) to[r.first]=max(to[r.first],to[x]+r.second);
res[i]=to[N-1];
memmove(from,to,sizeof(to));
}
if(res[4000]<res[5000]) cout<<"inf"<<endl;
else cout<<res[5000]<<endl;
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n';
FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
solve(); return 0;
}
Submission Info
Submission Time |
|
Task |
D - Score Attack |
User |
kmjp |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1199 Byte |
Status |
AC |
Exec Time |
22 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 |
2 ms |
384 KB |
sample_02.txt |
AC |
2 ms |
384 KB |
sample_03.txt |
AC |
2 ms |
384 KB |
subtask_1_1.txt |
AC |
10 ms |
384 KB |
subtask_1_10.txt |
AC |
3 ms |
384 KB |
subtask_1_11.txt |
AC |
7 ms |
384 KB |
subtask_1_12.txt |
AC |
16 ms |
384 KB |
subtask_1_13.txt |
AC |
8 ms |
384 KB |
subtask_1_14.txt |
AC |
14 ms |
384 KB |
subtask_1_15.txt |
AC |
22 ms |
384 KB |
subtask_1_16.txt |
AC |
2 ms |
384 KB |
subtask_1_17.txt |
AC |
3 ms |
384 KB |
subtask_1_18.txt |
AC |
13 ms |
384 KB |
subtask_1_19.txt |
AC |
17 ms |
384 KB |
subtask_1_2.txt |
AC |
19 ms |
384 KB |
subtask_1_20.txt |
AC |
9 ms |
384 KB |
subtask_1_21.txt |
AC |
13 ms |
384 KB |
subtask_1_22.txt |
AC |
22 ms |
384 KB |
subtask_1_23.txt |
AC |
2 ms |
384 KB |
subtask_1_24.txt |
AC |
16 ms |
384 KB |
subtask_1_25.txt |
AC |
10 ms |
384 KB |
subtask_1_26.txt |
AC |
14 ms |
384 KB |
subtask_1_27.txt |
AC |
14 ms |
384 KB |
subtask_1_3.txt |
AC |
15 ms |
384 KB |
subtask_1_4.txt |
AC |
19 ms |
384 KB |
subtask_1_5.txt |
AC |
12 ms |
384 KB |
subtask_1_6.txt |
AC |
19 ms |
384 KB |
subtask_1_7.txt |
AC |
18 ms |
384 KB |
subtask_1_8.txt |
AC |
19 ms |
384 KB |
subtask_1_9.txt |
AC |
2 ms |
384 KB |