Submission #1442074


Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef pair<int,int> P;
vector<P> v[110];
bool vis[110][110];
priority_queue<P,vector<P>,greater<P> >Q;
int n,m;
void DKT(int x){
	bool t[110];
	for(int i=0;i<n;i++)t[i]=false;
	Q.push(make_pair(0,x+100000));
	while(!Q.empty()){
		int y=Q.top().first,z=Q.top().second,r=z/200;
		Q.pop();z%=200;
		//頂点zがコストyでいける
		if(t[z]==true)continue;
		if(r!=500)vis[r][z]=true,vis[z][r]=true;
		t[z]=true;
		for(int i=0;i<v[z].size();i++){
			Q.push(make_pair(y+v[z][i].first,v[z][i].second+z*200));
		}
	}
}

int main(){
	cin>>n>>m;
	for(int i=0;i<m;i++){
		int a,b,c;cin>>a>>b>>c;a--,b--;
		v[a].push_back(make_pair(c,b));
		v[b].push_back(make_pair(c,a));
	}
	for(int i=0;i<n;i++)for(int j=0;j<n;j++)vis[i][j]=0;
	for(int i=0;i<n;i++)DKT(i);
	int ans=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<v[i].size();j++){
			if(i<v[i][j].second)continue;
			if(vis[i][v[i][j].second]==false)ans++;
		}
	}cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - Candidates of No Shortest Paths
User ynymxiaolongbao
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1073 Byte
Status WA
Exec Time 21 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 27
WA × 3
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 1 ms 256 KB
subtask_1_03.txt AC 2 ms 256 KB
subtask_1_04.txt AC 2 ms 256 KB
subtask_1_05.txt WA 11 ms 256 KB
subtask_1_06.txt AC 1 ms 256 KB
subtask_1_07.txt AC 1 ms 256 KB
subtask_1_08.txt AC 2 ms 256 KB
subtask_1_09.txt AC 2 ms 256 KB
subtask_1_10.txt AC 2 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 2 ms 256 KB
subtask_1_14.txt AC 4 ms 256 KB
subtask_1_15.txt AC 2 ms 256 KB
subtask_1_16.txt AC 1 ms 256 KB
subtask_1_17.txt AC 2 ms 256 KB
subtask_1_18.txt WA 5 ms 256 KB
subtask_1_19.txt AC 11 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 5 ms 256 KB
subtask_1_24.txt AC 16 ms 256 KB
subtask_1_25.txt WA 13 ms 256 KB
subtask_1_26.txt AC 8 ms 256 KB
subtask_1_27.txt AC 21 ms 384 KB
subtask_1_28.txt AC 16 ms 256 KB