Search found 2 matches

Go to advanced search

by windbells
Mon Jan 22, 2007 4:19 am
Forum: Volume 111 (11100-11199)
Topic: 11160 - Going Together
Replies: 10
Views: 6860

Thanks!
by windbells
Sun Jan 21, 2007 6:33 pm
Forum: Volume 111 (11100-11199)
Topic: 11160 - Going Together
Replies: 10
Views: 6860

Can you test my program plz?
It gets WA since the contest, but I don't know why, I just use Bfs to solve it. Thanks!

#include <stdio.h>
#include <string.h>

const int Max = 1000000;
const int dir[4][2] = {{0,1},{0,-1},{1,0},{-1,0}};

char flag[Max], map[10][12];
int dp[Max], queue[Max], n, tail ...

Go to advanced search