这题正常的Dinic大概跑多久？

RT，我没有优化的dinic不吸氧跑了160ms，大概是什么水平？比赛时有没有必要用优化的dinic？求大神解答

贴上我丑陋的代码：

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
const int MAXN=10000+7,MAXM=100000+7,INF=0x3f3f3f3f;
struct Edge{
    int to,cap,flow,nxt;
}e[MAXM<<1];
int head[MAXN],edge_num=1,dep[MAXN];
int n,m,S,E;
inline void add_edge(int u,int v,int w){
    e[++edge_num].to=v; e[edge_num].cap=e[edge_num].flow=w;
    e[edge_num].nxt=head[u]; head[u]=edge_num;
}
bool bfs(){
    memset(dep,0,sizeof(dep));
    queue<int> q;
    q.push(S); dep[S]=1;
    while(!q.empty()){
        int u=q.front(); q.pop();
        for(int i=head[u];i;i=e[i].nxt){
            int v=e[i].to;
            if(!dep[v]&&e[i].flow){
                q.push(v); dep[v]=dep[u]+1;
                if(v==E) return 1;
            }
        }
    }
    return 0;
}
int dfs(int u,int minf){
    if(!minf||u==E) return minf;
    int res=0;
    for(int i=head[u];i;i=e[i].nxt){
        int v=e[i].to;
        if(e[i].flow&&dep[v]==dep[u]+1){
            int x=dfs(v,min(minf,e[i].flow));
            if(!x) dep[v]=0;
            e[i].flow-=x; e[i^1].flow+=x;
            minf-=x; res+=x;
        }
    }
    return res;
}
int Dinic(){
    int res=0;
    while(bfs()) res+=dfs(S,INF);
    return res;
}
int main(){
    scanf("%d %d %d %d",&n,&m,&S,&E);
    for(int i=1;i<=m;++i){
        int u,v,w; scanf("%d %d %d",&u,&v,&w);
        add_edge(u,v,w); add_edge(v,u,0);
    }
    printf("%d\n",Dinic());
    return 0;
}