Submission #1493663
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = int(l);i < int(r);i++)
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;
int N,M;
const int K = 28;
const int MAX_N = 1000;
vector< pair<ll,int> > G [MAX_N];
ll minCost [MAX_N * K];
const ll INF = 1e18;
int main()
{
scanf("%d%d",&N,&M);
FOR(i,0,M){
int u,v;
ll c;
scanf("%d%d%lld",&u,&v,&c);
G [u].push_back(make_pair(c,v));
G [v].push_back(make_pair(c,u));
}
fill(minCost,minCost + MAX_N * K,INF);
priority_queue< pair<ll,int>,vector< pair<ll,int> >,greater< pair<ll,int> > > pq;
minCost [0] = 0;
pq.push(make_pair(0ll,0));
while(pq.empty() == false){
ll cost = pq.top().first;
int curr = pq.top().second;
pq.pop();
if(curr == N - 1) continue;
for(const auto& it : G [curr % N]){
ll nxtCost = it.first + cost;
if(chmin(minCost [(nxtCost % K) * N + it.second],nxtCost)){
pq.push(make_pair(nxtCost,(nxtCost % K) * N + it.second));
}
}
}
ll ans = INF;
FOR(i,0,K) if(i % 4 == 0 || i % 7 == 0){
chmin(ans,minCost [i * N + (N - 1)]);
}
printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time
2017-08-07 13:12:27+0900
Task
E - 会場への道
User
gigime
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1302 Byte
Status
WA
Exec Time
19 ms
Memory
2168 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:18:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&N,&M);
^
./Main.cpp:22:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%lld",&u,&v,&c);
^
Judge Result
Set Name
sub1
sub2
Score / Max Score
0 / 30
0 / 70
Status
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
640 KB
sub1/input_22.txt
AC
3 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
WA
1 ms
512 KB
sub1/input_7.txt
AC
1 ms
512 KB
sub1/input_8.txt
WA
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
17 ms
2040 KB
sub2/input_12.txt
AC
17 ms
2168 KB
sub2/input_13.txt
AC
2 ms
512 KB
sub2/input_14.txt
AC
11 ms
1280 KB
sub2/input_15.txt
AC
17 ms
2040 KB
sub2/input_16.txt
AC
19 ms
2168 KB
sub2/input_17.txt
AC
17 ms
2040 KB
sub2/input_18.txt
AC
17 ms
2168 KB
sub2/input_19.txt
AC
15 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
3 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
WA
1 ms
512 KB
sub2/input_7.txt
AC
1 ms
512 KB
sub2/input_8.txt
WA
1 ms
512 KB
sub2/input_9.txt
AC
1 ms
512 KB