Submission #781901
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const int INF=12345678;
int main()
{
int n,m;
cin >>n >>m;
int d[400][400];
fill(d[0],d[400],INF);
rep(i,n) d[i][i]=0;
rep(i,m)
{
int a,b,c;
scanf(" %d %d %d", &a, &b, &c);
--a;
--b;
d[a][b]=d[b][a]=c;
}
rep(k,n)rep(i,n)rep(j,n) d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
int Q;
cin >>Q;
rep(q,Q)
{
int x,y,z;
scanf(" %d %d %d", &x, &y, &z);
--x;
--y;
d[x][y]=d[y][x]=min(d[x][y],z);
//dを更新
rep(i,n)rep(j,n) d[i][j]=min({d[i][j],d[i][x]+d[x][y]+d[y][j],d[i][y]+d[y][x]+d[x][j]});
ll ans=0;
rep(i,n)rep(j,i) ans+=d[j][i];
cout << ans << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
C - アットコーダー王国の交通事情 |
User |
imulan |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
1114 Byte |
Status |
AC |
Exec Time |
604 ms |
Memory |
1440 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:27:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf(" %d %d %d", &a, &b, &c);
^
./Main.cpp:40:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf(" %d %d %d", &x, &y, &z);
^
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
10 / 10 |
90 / 90 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt |
Subtask1 |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt |
All |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
27 ms |
1424 KB |
subtask0_sample_02.txt |
AC |
27 ms |
1308 KB |
subtask1_01.txt |
AC |
27 ms |
1368 KB |
subtask1_02.txt |
AC |
585 ms |
1432 KB |
subtask1_03.txt |
AC |
604 ms |
1312 KB |
subtask1_04.txt |
AC |
590 ms |
1428 KB |
subtask1_05.txt |
AC |
586 ms |
1440 KB |
subtask1_06.txt |
AC |
588 ms |
1436 KB |
subtask1_07.txt |
AC |
586 ms |
1316 KB |
subtask1_08.txt |
AC |
585 ms |
1432 KB |
subtask1_09.txt |
AC |
587 ms |
1316 KB |
subtask1_10.txt |
AC |
589 ms |
1308 KB |
subtask1_11.txt |
AC |
589 ms |
1436 KB |
subtask1_12.txt |
AC |
597 ms |
1308 KB |
subtask1_13.txt |
AC |
585 ms |
1376 KB |
subtask1_14.txt |
AC |
586 ms |
1304 KB |
subtask1_15.txt |
AC |
587 ms |
1436 KB |
subtask1_16.txt |
AC |
589 ms |
1432 KB |
subtask1_17.txt |
AC |
586 ms |
1368 KB |
subtask1_18.txt |
AC |
585 ms |
1432 KB |
subtask1_19.txt |
AC |
586 ms |
1380 KB |
subtask1_20.txt |
AC |
597 ms |
1428 KB |
subtask1_21.txt |
AC |
590 ms |
1316 KB |
subtask1_22.txt |
AC |
588 ms |
1312 KB |
subtask1_23.txt |
AC |
588 ms |
1312 KB |
subtask1_24.txt |
AC |
33 ms |
1308 KB |
subtask1_25.txt |
AC |
38 ms |
1304 KB |
subtask1_26.txt |
AC |
39 ms |
1432 KB |
subtask1_27.txt |
AC |
35 ms |
1432 KB |
subtask1_28.txt |
AC |
37 ms |
1304 KB |
subtask1_29.txt |
AC |
26 ms |
1312 KB |