Submission #1285540
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <queue> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> using namespace std; #define _int64 long long _int64 d[5000]; int a[5000][3]; int main() { _int64 ans1,ans2; int i,j,n,m; scanf("%d%d",&n,&m); for (i=0;i<m;i++) { scanf("%d%d%d",&a[i][0],&a[i][1],&a[i][2]); a[i][0]--; a[i][1]--; } for (i=0;i<n;i++) d[i]=-(1LL<<60); d[0]=0; for (i=0;i<n+n+n;i++) { for (j=0;j<m;j++) { if (d[a[j][0]]!=-(1LL<<60)) { if (d[a[j][0]]+a[j][2]>d[a[j][1]]) d[a[j][1]]=d[a[j][0]]+a[j][2]; } /* if (d[a[j][1]]!=-(1LL<<60)) { if (d[a[j][1]]+a[j][2]>d[a[j][0]]) d[a[j][0]]=d[a[j][1]]+a[j][2]; } */ } } ans1=d[n-1]; for (i=0;i<n;i++) { for (j=0;j<m;j++) { if (d[a[j][0]]!=-(1LL<<60)) { if (d[a[j][0]]+a[j][2]>d[a[j][1]]) d[a[j][1]]=d[a[j][0]]+a[j][2]; } /* if (d[a[j][1]]!=-(1LL<<60)) { if (d[a[j][1]]+a[j][2]>d[a[j][0]]) d[a[j][0]]=d[a[j][1]]+a[j][2]; } */ } } ans2=d[n-1]; if (ans1==ans2) printf("%lld\n",d[n-1]); else printf("inf\n"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | liympanda |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1634 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:35:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&n,&m); ^ ./Main.cpp:38:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d%d",&a[i][0],&a[i][1],&a[i][2]); ^
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 | 256 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |
subtask_1_14.txt | AC | 10 ms | 256 KB |
subtask_1_15.txt | AC | 14 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 | 8 ms | 256 KB |
subtask_1_19.txt | AC | 7 ms | 256 KB |
subtask_1_2.txt | AC | 5 ms | 256 KB |
subtask_1_20.txt | AC | 1 ms | 256 KB |
subtask_1_21.txt | AC | 5 ms | 256 KB |
subtask_1_22.txt | AC | 19 ms | 256 KB |
subtask_1_23.txt | AC | 1 ms | 256 KB |
subtask_1_24.txt | AC | 8 ms | 256 KB |
subtask_1_25.txt | AC | 4 ms | 256 KB |
subtask_1_26.txt | AC | 5 ms | 256 KB |
subtask_1_27.txt | AC | 11 ms | 256 KB |
subtask_1_3.txt | AC | 4 ms | 256 KB |
subtask_1_4.txt | AC | 5 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 | 5 ms | 256 KB |
subtask_1_8.txt | AC | 5 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |