Submission #1281871
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int N, M; cin>>N>>M; vector<int> a(M); vector<int> b(M); vector<long long> c(M); for (int i=0; i<M; i++) cin>>a[i]>>b[i]>>c[i], a[i]--, b[i]--; long long oo = 0x1000000000000000LL; vector<long long> d(N, -oo); d[0] = 0LL; long long d1, d2; for (int i=0; i<2*N; i++) { for (int j=0; j<M; j++) d[b[j]] = max(d[b[j]], d[a[j]] + c[j]); if (i==N-1) d1 = d[N-1]; if (i==2*N-1) d2 = d[N-1]; } if (d1 == d2) cout<<d1<<endl; else cout<<"inf"<<endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | kusano |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 725 Byte |
Status | AC |
Exec Time | 10 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 | 3 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 | 8 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 | 5 ms | 256 KB |
subtask_1_19.txt | AC | 9 ms | 256 KB |
subtask_1_2.txt | AC | 8 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 | 10 ms | 256 KB |
subtask_1_23.txt | AC | 1 ms | 256 KB |
subtask_1_24.txt | AC | 7 ms | 256 KB |
subtask_1_25.txt | AC | 3 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 | 6 ms | 256 KB |
subtask_1_4.txt | AC | 8 ms | 256 KB |
subtask_1_5.txt | AC | 4 ms | 256 KB |
subtask_1_6.txt | AC | 8 ms | 256 KB |
subtask_1_7.txt | AC | 7 ms | 256 KB |
subtask_1_8.txt | AC | 8 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |