#include<iostream>
#include<cstring>
using namespace std;
const int N = 1010 , M = 20010 ;
int n , m , s , t;
int g[N][N] , dist[N];
bool vis[N];
void dijkstra(int s){
memset(dist , 0x3f , sizeof(dis...
| English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
|---|---|---|---|---|---|---|---|
| 《HihoCoder 1081dijkstra最短路算法模板》 | 790字 | 2.0分钟 | 100% | 165 CPM | 57 次 | 0 | 良好，向更快挑战！ |
|
Suggestion:
可能对按键不够熟悉，或者对输入法不够熟练所导致，不要急慢慢来，先打对把准确率提高，然后逐渐的加快速度，最后才能打准打快。
|
|||||||
| Inspirational quotes: 只看后浪催前浪，当悟新人胜旧人。 ——释文向 | |||||||
| What do you think of this article? Give it a rating and let it serve as a guiding light for others | |||||||
Registration with the Ministry of Industry and Information Technology: Min ICP No. 19000005