Submission #2408200


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <algorithm>
#include <limits>
#define repi(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)

using ll = long long;

constexpr int MAX_M = 2000, MAX_N = 1000;
constexpr ll INF = 1e18;

ll N, M;
ll a[MAX_M], b[MAX_M], c[MAX_M];
ll d[MAX_N];

int main()
{
	scanf("%lld%lld", &N, &M);
	rep(i, M)
		scanf("%lld%lld%lld", a + i, b + i, c + i), --a[i], --b[i];

	std::fill(d, d + N, -INF);
	d[0] = 0;

	bool upd = true;
	int cnt = 0;

	while (upd)
	{
		upd = false;

		++cnt;

		rep(i, M)
		{
			if (d[a[i]] != -INF && d[b[i]] < d[a[i]] + c[i])
			{
				d[b[i]] = d[a[i]] + c[i], upd = true;
			
				if (cnt > N)
				{
					d[b[i]] = -INF;
				}
			}
		}

		if (cnt > N)
			break;
	}

	if (d[N - 1] == -INF)
		puts("inf");
	else
		printf("%lld\n", d[N - 1]);

	return 0;
}

Submission Info

Submission Time
Task D - Score Attack
User As_sqr
Language C++14 (GCC 5.4.1)
Score 0
Code Size 893 Byte
Status WA
Exec Time 4 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld", &N, &M);
                           ^
./Main.cpp:21:61: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", a + i, b + i, c + i), --a[i], --b[i];
                                                             ^

Judge Result

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