Submission #1243433
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;
vector<pair<int, int> > G[MAX_N];
vector<int> dijkstra(int start, int goal){//スタートとゴールを逆に
vector<long long> dist(MAX_N, INF);
vector<int> pre(MAX_N, -1);//pre[i] := iの前の頂点
dist[start] = 0;//dist[i] := start->iまでの最短距離
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > que;
que.push(make_pair(0, start));
while(!que.empty()){
int cost, u, t;//今までにかかった時間 現在の頂点
cost = que.top().first, u = que.top().second;
que.pop();
if(dist[u] < cost) continue;
for (auto tmp : G[u]){
int v = tmp.first, time = tmp.second;//隣接する頂点 その頂点まで行く時間
if(dist[v] > dist[u] + time){//u->v
dist[v] = dist[u] + time;
pre[v] = u;
que.push(make_pair(dist[v], v));
}else if(dist[v] == dist[u] + time){//辞書順最小
pre[v] = min(pre[v], u);
}
}
}
//経路復元
vector<int> path;
int s = start, t = goal;
for (; t != s; t = pre[t]) path.push_back(t);
path.push_back(s);
return path; //start-> * -> goal startからgoalまでの最短経路(辞書順最小)
}
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, M)G[a[i]].pb(mp(b[i], c[i])), G[b[i]].pb(mp(a[i], c[i]));
set<pair<int, int>> se;
rep(s, N)rep(t, N){
if(s == t)continue;
auto d = dijkstra(s, t);
rep(i, d.size() - 1){
se.insert(mp(min(d[i], d[i + 1]), max(d[i], d[i + 1])));
}
}
printf("%d\n", M - (int)se.size());
return 0;
}
Submission Info
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
7 ms |
256 KB |
subtask_1_03.txt |
AC |
24 ms |
256 KB |
subtask_1_04.txt |
AC |
34 ms |
256 KB |
subtask_1_05.txt |
WA |
101 ms |
256 KB |
subtask_1_06.txt |
AC |
4 ms |
256 KB |
subtask_1_07.txt |
AC |
10 ms |
256 KB |
subtask_1_08.txt |
AC |
32 ms |
256 KB |
subtask_1_09.txt |
AC |
36 ms |
256 KB |
subtask_1_10.txt |
AC |
36 ms |
256 KB |
subtask_1_11.txt |
AC |
3 ms |
256 KB |
subtask_1_12.txt |
AC |
13 ms |
256 KB |
subtask_1_13.txt |
AC |
41 ms |
256 KB |
subtask_1_14.txt |
AC |
55 ms |
256 KB |
subtask_1_15.txt |
AC |
42 ms |
256 KB |
subtask_1_16.txt |
AC |
1 ms |
256 KB |
subtask_1_17.txt |
AC |
3 ms |
256 KB |
subtask_1_18.txt |
WA |
8 ms |
256 KB |
subtask_1_19.txt |
AC |
19 ms |
256 KB |
subtask_1_20.txt |
AC |
3 ms |
256 KB |
subtask_1_21.txt |
AC |
2 ms |
256 KB |
subtask_1_22.txt |
AC |
13 ms |
256 KB |
subtask_1_23.txt |
AC |
10 ms |
256 KB |
subtask_1_24.txt |
AC |
104 ms |
256 KB |
subtask_1_25.txt |
WA |
37 ms |
256 KB |
subtask_1_26.txt |
AC |
49 ms |
256 KB |
subtask_1_27.txt |
AC |
155 ms |
256 KB |
subtask_1_28.txt |
AC |
68 ms |
256 KB |