Submission #1841925


Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;

typedef long long ll;
ll n, m, z, t1[2005],t2[2005],t3[2005], d[1005];
vector<int> a[1005], b[1005];
int main()
{
	ll i,j, k, x, y;
	cin >> n >> m;
	for (i = 0; i < m; i++) {
		scanf ("%lld %lld %lld", &t1[i], &t2[i], &t3[i]);
		a[t1[i]].push_back(t2[i]);
		b[t1[i]].push_back(-t3[i]);
	}
	for (i = 2; i <= n; i++) d[i] = 9e15;
	for (i = 0; i < n; i++) {
		for (j = 1; j <= n; j++) {
			for (k =0; k < a[j].size(); k++) {
				x = a[j][k];
				y = b[j][k];
				if (d[x] > d[j] + y) {
					d[x] = d[j] + y;
					if (i == n - 1 && x == n) {
						cout << "inf";
						return 0;
					}
				}
			}
		}
	}
	cout << -d[n];
    return 0;
}

Submission Info

Submission Time
Task D - Score Attack
User sean617
Language C++14 (GCC 5.4.1)
Score 400
Code Size 746 Byte
Status AC
Exec Time 13 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%lld %lld %lld", &t1[i], &t2[i], &t3[i]);
                                                   ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 30
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 384 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 2 ms 384 KB
subtask_1_12.txt AC 6 ms 384 KB
subtask_1_13.txt AC 3 ms 256 KB
subtask_1_14.txt AC 5 ms 384 KB
subtask_1_15.txt AC 13 ms 384 KB
subtask_1_16.txt AC 1 ms 256 KB
subtask_1_17.txt AC 1 ms 384 KB
subtask_1_18.txt AC 4 ms 384 KB
subtask_1_19.txt AC 7 ms 384 KB
subtask_1_2.txt AC 4 ms 384 KB
subtask_1_20.txt AC 3 ms 256 KB
subtask_1_21.txt AC 4 ms 384 KB
subtask_1_22.txt AC 8 ms 384 KB
subtask_1_23.txt AC 1 ms 256 KB
subtask_1_24.txt AC 5 ms 384 KB
subtask_1_25.txt AC 2 ms 384 KB
subtask_1_26.txt AC 4 ms 384 KB
subtask_1_27.txt AC 6 ms 384 KB
subtask_1_3.txt AC 3 ms 384 KB
subtask_1_4.txt AC 4 ms 384 KB
subtask_1_5.txt AC 2 ms 384 KB
subtask_1_6.txt AC 4 ms 384 KB
subtask_1_7.txt AC 4 ms 384 KB
subtask_1_8.txt AC 4 ms 384 KB
subtask_1_9.txt AC 1 ms 256 KB