代码搜索:queue

找到约 10,000 项符合「queue」的源代码

代码结果 10,000
www.eeworm.com/read/452050/7448767

cpp 2699179_ac_1125ms_10240k.cpp

#include #include #define INF 2100000000 #define MAX 100000 using namespace std; int l, a, b; struct Node { char change[21]; int cost; }oper[33]; char st[21], ed
www.eeworm.com/read/452050/7448769

cpp 2699081_wa.cpp

#include #include #define INF 2100000000 #define MAX 1000000 using namespace std; int l, a, b; struct Node { char change[21]; int cost; }oper[33]; char st[21], e
www.eeworm.com/read/452050/7448819

cc 3168759_ac_511ms_844k.cc

#include #include struct node { int u, v, w; }edge[40001]; int map[201][201]; int N, P, T; int min, mid, max; int ans, C; void input() { int i; min = 21000
www.eeworm.com/read/452050/7449080

cpp 3433635_ac_94ms_1156k.cpp

#include #include #include #define INIT (Edge *)malloc(sizeof(Edge)) int n; int visited[10001]; typedef struct node { int adj; int w; struct node *next
www.eeworm.com/read/452050/7449096

c 2322591_wa.c

#include #include int n, m, ans; int map[501][501]; int bfs() { int i, mark = 0; int f, r, p, cnt = 0; int pre[501], visited[501]; int queue[510], C, F[510];
www.eeworm.com/read/452050/7449153

c 2352371_ac_779ms_740k.c

#include #include #include #define INIT (Edge *)malloc(sizeof(Edge)) int n, T; int m, no; int stack[10001]; typedef struct node { int adj; struct node *ne
www.eeworm.com/read/452050/7450302

c 2111238_ac_0ms_20k.c

# include # include int n, m, l, M; int p[101]; int f, r; int time; int queue[10000][2]; void solve() { int i; time = 0; while(p[l]>M) { if(queue[f][0]==p
www.eeworm.com/read/452050/7450368

c 2268969_ac_0ms_220k.c

#include #include #define MaxV 201 int n, m; long ans, map[MaxV][MaxV]; int input() { int i; int st, ed; long w; if(scanf("%d%d",&n,&m)!=2) return 0; ans
www.eeworm.com/read/452050/7450610

cpp 2406326_tle.cpp

#include #include #include #define INIT (Edge *)malloc(sizeof(Edge)) int n, m; int visited[40001]; typedef struct node { int adj; int w; struct node *nex
www.eeworm.com/read/452050/7450611

cpp 2406629_ac_264ms_3668k.cpp

#include #include #include #define INIT (Edge *)malloc(sizeof(Edge)) int n, m; int visited[40001]; typedef struct node { int adj; int w; struct node *nex