Submission #1245048
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;
const int MAX_N = 110;
int dist[MAX_N][MAX_N];
//答えが1つ大きくなる問題.
int a[1010], b[1010], c[1010];
int main(void){
int N, M; cin >> N >> M;
rep(i, M){
cin >> a[i] >> b[i] >> c[i];
a[i]--; b[i]--;
}
rep(i, MAX_N)rep(j, MAX_N) dist[i][j] = INF;
rep(i, N)dist[i][i] = 0;
rep(i, M)dist[a[i]][b[i]] = c[i], dist[b[i]][a[i]] = c[i];
rep(k, N)rep(i, N)rep(j, N) dist[i][j] = chmin(dist[i][j], dist[i][k] + dist[k][j]);
set<pair<int, int>> se;
rep(k, M)rep(i, N)rep(j, N){ // i->a[i]->b[i]->j
if(dist[i][a[k]] + c[k] + dist[b[k]][j] == dist[i][j]){ //a[k]-b[k]
se.insert(mp(min(a[k], b[k]), max(a[k], b[k])));
}
}
printf("%d\n", M - se.size());
return 0;
}
Submission Info
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:45:33: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘std::set<std::pair<int, int> >::size_type {aka long unsigned int}’ [-Wformat=]
printf("%d\n", M - se.size());
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt |
All |
sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.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_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_28.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
subtask_1_01.txt |
AC |
1 ms |
256 KB |
subtask_1_02.txt |
AC |
2 ms |
256 KB |
subtask_1_03.txt |
AC |
4 ms |
256 KB |
subtask_1_04.txt |
AC |
7 ms |
256 KB |
subtask_1_05.txt |
AC |
12 ms |
256 KB |
subtask_1_06.txt |
AC |
1 ms |
256 KB |
subtask_1_07.txt |
AC |
2 ms |
256 KB |
subtask_1_08.txt |
AC |
5 ms |
256 KB |
subtask_1_09.txt |
AC |
6 ms |
256 KB |
subtask_1_10.txt |
AC |
5 ms |
256 KB |
subtask_1_11.txt |
AC |
1 ms |
256 KB |
subtask_1_12.txt |
AC |
2 ms |
256 KB |
subtask_1_13.txt |
AC |
4 ms |
256 KB |
subtask_1_14.txt |
AC |
6 ms |
256 KB |
subtask_1_15.txt |
AC |
4 ms |
256 KB |
subtask_1_16.txt |
AC |
2 ms |
384 KB |
subtask_1_17.txt |
AC |
2 ms |
256 KB |
subtask_1_18.txt |
AC |
3 ms |
256 KB |
subtask_1_19.txt |
AC |
5 ms |
256 KB |
subtask_1_20.txt |
AC |
2 ms |
256 KB |
subtask_1_21.txt |
AC |
1 ms |
256 KB |
subtask_1_22.txt |
AC |
2 ms |
256 KB |
subtask_1_23.txt |
AC |
3 ms |
256 KB |
subtask_1_24.txt |
AC |
15 ms |
256 KB |
subtask_1_25.txt |
AC |
8 ms |
256 KB |
subtask_1_26.txt |
AC |
7 ms |
256 KB |
subtask_1_27.txt |
AC |
20 ms |
256 KB |
subtask_1_28.txt |
AC |
20 ms |
256 KB |