Submission #1200651


Source Code Expand

#include<bits/stdc++.h>
#define int long long
#define P pair<int,int>//cost to
using namespace std;

int mincost[1000][28];//時間を28で割った余り
vector<P>rinsetu[1000];
signed main() {
	int a, b; scanf("%lld%lld", &a, &b);
	for (int c = 0; c < b; c++) {
		int d, e, f; scanf("%lld%lld%lld", &d, &e, &f);
		rinsetu[d].push_back(P(f, e));
		rinsetu[e].push_back(P(f, d));
	}
	memset(mincost, 0x3f, sizeof(mincost));
	mincost[0][0] = 0;
	priority_queue<P, vector<P>, greater<P>>Q;
	Q.push({ 0,0 });
	while (Q.size()) {
		P t = Q.top(); Q.pop();
		if (mincost[t.second][t.first % 28] < t.first)continue;
		if (t.second == a - 1)continue;
		for (P i : rinsetu[t.second]) {
			if (mincost[i.second][(t.first + i.first) % 28] > t.first + i.first) {
				mincost[i.second][(t.first + i.first) % 28] = t.first + i.first;
				Q.push({ t.first + i.first ,i.second });
			}
		}
	}
	int ans = LLONG_MAX;
	for (int i = 0; i < 28; i++) {
		if (i % 4 == 0 || i % 7 == 0)ans = min(ans, mincost[a - 1][i]);
	}
	cout << ans << endl;
}

Submission Info

Submission Time
Task E - 会場への道
User naoki2016
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1058 Byte
Status AC
Exec Time 15 ms
Memory 2168 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int a, b; scanf("%lld%lld", &a, &b);
                                     ^
./Main.cpp:11:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int d, e, f; scanf("%lld%lld%lld", &d, &e, &f);
                                                 ^

Judge Result

Set Name sub1 sub2
Score / Max Score 30 / 30 70 / 70
Status
AC × 15
AC × 26
Set Name Test Cases
sub1 sub1/input_0.txt, sub1/input_1.txt, sub1/input_2.txt, sub1/input_20.txt, sub1/input_21.txt, sub1/input_22.txt, sub1/input_23.txt, sub1/input_24.txt, sub1/input_3.txt, sub1/input_4.txt, sub1/input_5.txt, sub1/input_6.txt, sub1/input_7.txt, sub1/input_8.txt, sub1/input_9.txt
sub2 sub2/input_0.txt, sub2/input_1.txt, sub2/input_10.txt, sub2/input_11.txt, sub2/input_12.txt, sub2/input_13.txt, sub2/input_14.txt, sub2/input_15.txt, sub2/input_16.txt, sub2/input_17.txt, sub2/input_18.txt, sub2/input_19.txt, sub2/input_2.txt, sub2/input_20.txt, sub2/input_21.txt, sub2/input_22.txt, sub2/input_23.txt, sub2/input_24.txt, sub2/input_25.txt, sub2/input_3.txt, sub2/input_4.txt, sub2/input_5.txt, sub2/input_6.txt, sub2/input_7.txt, sub2/input_8.txt, sub2/input_9.txt
Case Name Status Exec Time Memory
sub1/input_0.txt AC 1 ms 512 KB
sub1/input_1.txt AC 1 ms 512 KB
sub1/input_2.txt AC 1 ms 512 KB
sub1/input_20.txt AC 3 ms 640 KB
sub1/input_21.txt AC 3 ms 512 KB
sub1/input_22.txt AC 2 ms 512 KB
sub1/input_23.txt AC 1 ms 512 KB
sub1/input_24.txt AC 2 ms 512 KB
sub1/input_3.txt AC 1 ms 512 KB
sub1/input_4.txt AC 1 ms 512 KB
sub1/input_5.txt AC 1 ms 512 KB
sub1/input_6.txt AC 1 ms 512 KB
sub1/input_7.txt AC 1 ms 512 KB
sub1/input_8.txt AC 1 ms 512 KB
sub1/input_9.txt AC 1 ms 512 KB
sub2/input_0.txt AC 1 ms 512 KB
sub2/input_1.txt AC 1 ms 512 KB
sub2/input_10.txt AC 2 ms 512 KB
sub2/input_11.txt AC 14 ms 2040 KB
sub2/input_12.txt AC 13 ms 2168 KB
sub2/input_13.txt AC 2 ms 512 KB
sub2/input_14.txt AC 9 ms 1280 KB
sub2/input_15.txt AC 14 ms 2040 KB
sub2/input_16.txt AC 15 ms 2168 KB
sub2/input_17.txt AC 14 ms 2040 KB
sub2/input_18.txt AC 14 ms 2040 KB
sub2/input_19.txt AC 13 ms 1664 KB
sub2/input_2.txt AC 1 ms 512 KB
sub2/input_20.txt AC 3 ms 640 KB
sub2/input_21.txt AC 3 ms 640 KB
sub2/input_22.txt AC 2 ms 512 KB
sub2/input_23.txt AC 1 ms 512 KB
sub2/input_24.txt AC 2 ms 512 KB
sub2/input_25.txt AC 2 ms 512 KB
sub2/input_3.txt AC 1 ms 512 KB
sub2/input_4.txt AC 1 ms 512 KB
sub2/input_5.txt AC 1 ms 512 KB
sub2/input_6.txt AC 1 ms 512 KB
sub2/input_7.txt AC 1 ms 512 KB
sub2/input_8.txt AC 1 ms 512 KB
sub2/input_9.txt AC 1 ms 512 KB