OJ Board

if u have Tim Limit
my algo do this pretty fast :)
try this :


1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 0 0
1 100 100 1 ...

Hey try this input i think is the critical one

My Acc output this:

Try this input


5
2 3 3 4 6
3 1 2 3 7 5 6
1 4 5
0
1 4 7
2 2

2
1 2 5
1 1 6
1 2

7
4 2 5 3 13 4 8 5 18
2 3 7 6 14
1 6 6
2 3 5 5 9
3 6 2 7 9 4 6
1 7 2
0
1 7

0



Answer should be this


Case 1: Path = 2 2; 0 second delay
Case 2: Path = 1 2; 5 second delay
Case 3: Path = 1 2 3 6 7; 20 second delay ...

Hi help me pls i cannot find the WA
tell pls if i misunderstood the problem or gimme a critical Input pls

#include "stdafx.h"
#include<string>
#include<stdio.h>
#include<vector>
#include<string.h>
#include<utility>
#include<queue>

using namespace std;

vector<int> pset(100000);
int findSet(int i ...