Mastot

input/code.cpp: In function 'long long int minDistance(long long int*, bool*)':
input/code.cpp:14:12: warning: 'min_index' may be used uninitialized in this function [-Wmaybe-uninitialized]
     return min_index; 
            ^~~~~~~~~
input/code.cpp: In function 'void dijkstra(long long int (*)[200001], int, int)':
input/code.cpp:46:19: warning: 'min_index' may be used uninitialized in this function [-Wmaybe-uninitialized]
         sptSet[u] = true; 
         ~~~~~~~~~~^~~~~~

#include<bits/stdc++.h>
using namespace std;
#define V 200001

long long minDistance(long long dist[], bool sptSet[]) 
{ 
    // Initialize min value 
    long long min = LLONG_MAX, min_index; 
  
    for (int v = 0; v < V; v++) 
        if (sptSet[v] == false && dist[v] <= min) 
            min = dist[v], min_index = v; 
  
    return min_index; 
} 

void printSolution(int dist[]) 
{ 
    printf("Vertex \t\t Distance from Source\n"); 
    for (int i = 0; i < V; i++) 
        printf("%d \t\t %d\n", i, dist[i]); 
} 

void dijkstra(long long graph[V][V], int src, int dest) 
{ 
    long long dist[V]; // The output array.  dist[i] will hold the shortest 
    // distance from src to i 
  
    bool sptSet[V]; // sptSet[i] will be true if vertex i is included in shortest 
    // path tree or shortest distance from src to i is finalized 
  
    // Initialize all distances as INFINITE and stpSet[] as false 
    for (int i = 0; i < V; i++) 
        dist[i] = LLONG_MAX, sptSet[i] = false; 
  
    // Distance of source vertex from itself is always 0 
    dist[src] = 0; 
  
    // Find shortest path for all vertices 
    for (int count = 0; count < V - 1; count++) { 
        // Pick the minimum distance vertex from the set of vertices not 
        // yet processed. u is always equal to src in the first iteration. 
        long long u = minDistance(dist, sptSet); 
  
        // Mark the picked vertex as processed 
        sptSet[u] = true; 
  
        // Update dist value of the adjacent vertices of the picked vertex. 
        for (int v = 0; v < V; v++) 
  
            // Update dist[v] only if is not in sptSet, there is an edge from 
            // u to v, and total weight of path from src to  v through u is 
            // smaller than current value of dist[v] 
            if (!sptSet[v] && graph[u][v] && dist[u] != LLONG_MAX
                && dist[u] + graph[u][v] < dist[v]) 
                dist[v] = dist[u] + graph[u][v]; 
    } 
  
    // print the constructed distance array 
    cout << dist[dest]-1;
} 

int main() {
	// ios_base::sync_with_stdio(true);
	// cin.tie(NULL);
	int n;
	// string line;
	// getline(cin, line);
	// stringstream split_n(line);
	// split_n >> n;
	// getline(cin, line);
	// stringstream split_d(line);
	// getline(cin, line);
	// stringstream split_c(line);
	// ifstream in("dt_4_test.txt");
	// in >> n;
	cin >> n;
	int d[n];
	int c[n];
	long long graph[V][V] = {{}};
	for (int i = 0; i < n; i++) {
		cin >> d[i];
		// in >> d[i];
	}
	
	for (int i = 1; i < n; i++) {
		cin >> c[i];
		// in >> c[i];
	}
	
	// split_d >> d[0];
	// for (int i = 1; i < n; i++) {
		// split_d >> d[i];
		// split_c >> c[i];
	// }
	d[n] = 0;
	c[n] = 1;
	
	for (int i = 0; i <= n; i++) {
		for (int j = i+1; j <= min(i+d[i],n); j++) {
			graph[i][j] = c[j];
		}
	}
	
	// for (int i = 0; i <= n; i++) {
		// for (int j = 0; j <= n; j++) {
			// cout << graph[i][j] << " ";
		// }
		// cout << endl;
	// }
	
	dijkstra(graph, 0, n);
}
	

Test 1

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 2

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 3

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 4

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 5

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 6

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 7

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 8

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 9

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 10

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 11

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 12

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 13

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 14

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 15

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 16

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 17

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 18

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 19

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 20

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 21

Group: 2, 3

Verdict: RUNTIME ERROR

Test 22

Group: 2, 3

Verdict: RUNTIME ERROR

Test 23

Group: 2, 3

Verdict: RUNTIME ERROR

Test 24

Group: 2, 3

Verdict: RUNTIME ERROR

Test 25

Group: 2, 3

Verdict: RUNTIME ERROR

Test 26

Group: 2, 3

Verdict: RUNTIME ERROR

Test 27

Group: 2, 3

Verdict: RUNTIME ERROR

Test 28

Group: 2, 3

Verdict: RUNTIME ERROR

Test 29

Group: 2, 3

Verdict: RUNTIME ERROR

Test 30

Group: 2, 3

Verdict: RUNTIME ERROR

Test 31

Group: 2, 3

Verdict: RUNTIME ERROR

Test 32

Group: 2, 3

Verdict: RUNTIME ERROR

Test 33

Group: 2, 3

Verdict: RUNTIME ERROR

Test 34

Group: 3

Verdict: RUNTIME ERROR

Test 35

Group: 3

Verdict: RUNTIME ERROR

Test 36

Group: 3

Verdict: RUNTIME ERROR

Test 37

Group: 3

Verdict: RUNTIME ERROR

Test 38

Group: 3

Verdict: RUNTIME ERROR

Test 39

Group: 3

Verdict: RUNTIME ERROR

Test 40

Group: 3

Verdict: RUNTIME ERROR

Test 41

Group: 3

Verdict: RUNTIME ERROR

Test 42

Group: 3

Verdict: RUNTIME ERROR

Test 43

Group: 3

Verdict: RUNTIME ERROR

Test 44

Group: 3

Verdict: RUNTIME ERROR

Test 45

Group: 3

Verdict: RUNTIME ERROR

Test 46

Group: 3

Verdict: RUNTIME ERROR