代码搜索:queue

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

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

cc 2406632_ac_452ms_3684k.cc

#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/7450613

c 2406623_ac_262ms_3664k.c

#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/7450677

c 3191243_re.c

#include int team, no[1001]; int teamid[1000000]; int inqueue[1001], pos[1001]; int flag; int queue[200001], front, back; int next[200001], prev[200001]; void output() { int i;
www.eeworm.com/read/452050/7450678

c 3191493_wa.c

#include int team, no[1001]; int teamid[1000000]; int inqueue[1001], pos[1001]; int flag; int queue[200001], front, back; int next[200001], prev[200001]; int main() { int i, j,
www.eeworm.com/read/452050/7450679

c 3191149_re.c

#include int team, no[1001]; int teamid[1000000]; int inqueue[1001], pos[1001]; int flag; int queue[200001], front, back; int next[200001], prev[200001]; int main() { int i, j,
www.eeworm.com/read/452050/7450680

c 3191625_ac_93ms_936k.c

#include int team, no; int teamid[1000000]; int inqueue[1001], pos[1001]; int flag; int queue[200001], front, back; int next[200001], prev[200001]; int main() { int i, j, t, p,
www.eeworm.com/read/452050/7450982

java 3475332_ac_2329ms_5676k.java

import java.util.*; public class Main { private Scanner in; private int n, k; private boolean [][] tree; private boolean [] visited; private boolean [] win; private int [] queue; priv
www.eeworm.com/read/452050/7451362

cc 2359362_ac_121ms_15872k.cc

#include #include int n, m; short int din[2001], dout[2001]; short int map[2001][2001], Map[2001][2001]; struct node { int ans; int x, y; }Edge[20001]; int out[2001]
www.eeworm.com/read/452050/7451363

cc 2359345_mle.cc

#include #include int n, m; short int din[5001], dout[5001]; short int map[5001][5001], Map[5001][5001]; struct node { int ans; int x, y; }Edge[50001]; int out[5001]
www.eeworm.com/read/452050/7451364

cc 2359353_re.cc

#include #include int n, m; short int din[1001], dout[1001]; short int map[1001][1001], Map[1001][1001]; struct node { int ans; int x, y; }Edge[10001]; int out[1001]