OJ Board

Dijkstra is not very efficient.
I got AC after I switched to dynamic programming.

jhonny_yang,
the code here should give the correct answer as well, so generate all possible input and compare the output of my program with yours. Hope this can help.

[c]
#include <stdio.h>

int graph[64][64];
int result[64][64];
int visited[64];
int len[64];

int dijkstra(int s,int d);
void init()
{
int i,j;
for(i = 0;i<8;i++)
for(j = 0;j<8;j++)
{
if(i+2<8)
{
if(j-1>=0)
graph[8*i+j][8*(i+2)+(j-1)] = 1;
if(j+1<8)
graph[8*i+j][8*(i+2)+(j+1)] = 1;
}
if ...

Could someone tell me why '1 3 2 5 4'should give '1 3 4'?

My prog(WA) gives '1 3 5', is there anything i missed out in the problem description?

[c]

#include <stdio.h>
int w[1001];
int s[1001];
int pre[1001];
int lens[1001];

void output(int last)
{
if(pre[last]==-1)
printf("%d\n",last+1);
else{
output(pre[last]);
printf("%d\n",last+1);
}
}
int main(int argc, char *argv[]) {
int num=0,i,j,max = 1,last = 0;
while(scanf("%d %d",&w[num ...

[c] //output
printf("Election #%d\n",elec);
printf(" %d bad ballot(s)\n",nbad);
[/c]

You should not output "0 bad ballot(s)" if there is none. [/cpp]