criyle/codenet-compile-errors huggingface dataset:
Language: C

#include <stdio.h>

#define N_MAX 100
#difine INF   1000000

int n;
int k[N_MAX];
int direction[N_MAX][N_MAX];
int cost[N_MAX][N_MAX];
int distance[N_MAX];

void Dijkstra(){
  int i;
  dist[p] = c;
  for( i=0; i<size[p]; i++){
    if(dist[to[p][i]] > c + cost[p][i]) dfs(to[p][i], c + cost[p][i]);
  }
}

int main(){
  int i;
  int j;
  scanf("%d",&n);
  for( i=0; i<n; i++){
    int u;
    scanf("%d", &u);
    scanf("%d", &k[u]);
    for( j=0; j<k[u]; j++){
      scanf("%d", &direction[u][j]);
      scanf("%d", &cost[u][j]);
    }
  }
  
  for( i=0; i<n; i++){
    distance[i] = INF;
  }
  
  Dijkstra(0,0);
  
  for(i=0;i<n;i++){
    printf("%d %d\n", i, distance[i]);
  }
}




Compiler output:
main.c:4:2: error: invalid preprocessing directive #difine; did you mean #define?
    4 | #difine INF   1000000
      |  ^~~~~~
      |  define
main.c: In function 'Dijkstra':
main.c:14:3: error: 'dist' undeclared (first use in this function)
   14 |   dist[p] = c;
      |   ^~~~
main.c:14:3: note: each undeclared identifier is reported only once for each function it appears in
main.c:14:8: error: 'p' undeclared (first use in this function)
   14 |   dist[p] = c;
      |        ^
main.c:14:13: error: 'c' undeclared (first use in this function)
   14 |   dist[p] = c;
      |             ^
main.c:15:15: error: 'size' undeclared (first use in this function); did you mean 'size_t'?
   15 |   for( i=0; i<size[p]; i++){
      |               ^~~~
      |               size_t
main.c:16:13: error: 'to' undeclared (first use in this function)
   16 |     if(dist[to[p][i]] > c + cost[p][i]) dfs(to[p][i], c + cost[p][i]);
      |             ^~
main.c:16:41: error: implicit declaration of function 'dfs' [-Wimplicit-function-declaration]
   16 |     if(dist[to[p][i]] > c + cost[p][i]) dfs(to[p][i], c + cost[p][i]);
      |                                         ^~~
main.c: In function 'main':
main.c:35:19: error: 'INF' undeclared (first use in this function)
   35 |     distance[i] = INF;
      |                   ^~~
Language: C

#include <stdio.h>

#define N_MAX 100
#difine INF   1000000

int n;
int k[N_MAX];
int direction[N_MAX][N_MAX];
int cost[N_MAX][N_MAX];
int distance[N_MAX];

void Dijkstra(int p,int c){
  int i;
  dist[p] = c;
  for( i=0; i<size[p]; i++){
    if(distance[to[p][i]] > c + cost[p][i]) dfs(to[p][i], c + cost[p][i]);
  }
}

int main(){
  int i;
  int j;
  scanf("%d",&n);
  for( i=0; i<n; i++){
    int u;
    scanf("%d", &u);
    scanf("%d", &k[u]);
    for( j=0; j<k[u]; j++){
      scanf("%d", &direction[u][j]);
      scanf("%d", &cost[u][j]);
    }
  }
  
  for( i=0; i<n; i++){
    distance[i] = INF;
  }
  
  Dijkstra(0,0);
  
  for(i=0;i<n;i++){
    printf("%d %d\n", i, distance[i]);
  }
}




Compiler output:
main.c:4:2: error: invalid preprocessing directive #difine; did you mean #define?
    4 | #difine INF   1000000
      |  ^~~~~~
      |  define
main.c: In function 'Dijkstra':
main.c:14:3: error: 'dist' undeclared (first use in this function)
   14 |   dist[p] = c;
      |   ^~~~
main.c:14:3: note: each undeclared identifier is reported only once for each function it appears in
main.c:15:15: error: 'size' undeclared (first use in this function); did you mean 'size_t'?
   15 |   for( i=0; i<size[p]; i++){
      |               ^~~~
      |               size_t
main.c:16:17: error: 'to' undeclared (first use in this function)
   16 |     if(distance[to[p][i]] > c + cost[p][i]) dfs(to[p][i], c + cost[p][i]);
      |                 ^~
main.c:16:45: error: implicit declaration of function 'dfs' [-Wimplicit-function-declaration]
   16 |     if(distance[to[p][i]] > c + cost[p][i]) dfs(to[p][i], c + cost[p][i]);
      |                                             ^~~
main.c: In function 'main':
main.c:35:19: error: 'INF' undeclared (first use in this function)
   35 |     distance[i] = INF;
      |                   ^~~
Language: C

#include<stdio.h>
#include<stdlib.h>

#define rep( i ,end ) for( int i = 0 ; i < end ; ++i )
#define Nmax 100
#define INF ( INT_MAX / 10 )

int Node[ Nmax ][ Nmax ] ;

int min( int a ,int b )
{
	return a > b ? b : a ;
}

void Init( int ( *NODE )[ Nmax ] ,int N )
{
	rep( i ,N )
	{
		rep( j ,N )
		{
			NODE[ i ][ j ] = ( i == j ) ? 0 : INF ;
		}
	}
}



int main( void )
{
	int N ,V ,K ;
	int v ,cost ;
	scanf( "%d" ,&N ) ;

	Init( Node ,N ) ;

	rep( i ,N )
	{
		scanf( "%d %d" ,&V ,&K ) ;

		rep( j ,K )
		{
			scanf( "%d %d" ,&v ,&cost ) ;

			Node[ V ][ v ] = cost ;
		}
	}

	rep( u ,N )
	{
		rep( i ,N )
		{
			rep( j ,N )
			{
				Node[ i ][ j ] = min( Node[ i ][ j ] ,Node[ i ][ u ] + Node[ u ][ j ] ) ;
			}
		}
	}

	rep( u ,N )
	{
		printf( "%d %d\n" ,u ,Node[ 0 ][ u ] ) ;
	}

	return 0 ;
}


Compiler output:
main.c: In function 'Init':
main.c:6:15: error: 'INT_MAX' undeclared (first use in this function)
    6 | #define INF ( INT_MAX / 10 )
      |               ^~~~~~~
main.c:21:59: note: in expansion of macro 'INF'
   21 |                         NODE[ i ][ j ] = ( i == j ) ? 0 : INF ;
      |                                                           ^~~
main.c:3:1: note: 'INT_MAX' is defined in header '<limits.h>'; this is probably fixable by adding '#include <limits.h>'
    2 | #include<stdlib.h>
  +++ |+#include <limits.h>
    3 | 
main.c:6:15: note: each undeclared identifier is reported only once for each function it appears in
    6 | #define INF ( INT_MAX / 10 )
      |               ^~~~~~~
main.c:21:59: note: in expansion of macro 'INF'
   21 |                         NODE[ i ][ j ] = ( i == j ) ? 0 : INF ;
      |                                                           ^~~
Language: C

#include <stdio.h>

static const int MAX = 10;
static const int INFINITY = 1 << 21;
static const int WHITE = 0;
static const int GRAY  = 1;
static const int BLACK = 2;

static int n;
static int M[MAX][MAX];

static void dijkstra()
{
    int minv;
    int d[MAX];
    int color[MAX];

    for (int i = 0; i < n; i++) {
        d[i] = INFINITY;
        color[i] = WHITE;
    }

    d[0] = 0;
    color[0] = GRAY;
    while (1) {
        minv = INFINITY;
        int u = -1;
        for (int i = 0; i < n; i++) {
            if (minv > d[i] && color[i] != BLACK) {
                u = i;
                minv = d[i];
            }
        }

        if (u == -1)
            break;

        color[u] = BLACK;

        for (int v = 0; v < n; v++) {
            if (color[v] != BLACK && M[u][v] != INFINITY) {
                if (d[v] > d[u] + M[u][v]) {
                    d[v] = d[u] + M[u][v];
                    color[v] = GRAY;
                }
            }
        }
    }

    for (int i = 0; i < n; i++) {
        printf("%d %d\n", i, (d[i] == INFINITY) ? -1 : d[i]);
    }
}

int main()
{
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            M[i][j] = INFINITY;
        }
    }

    for (int i = 0; i < n; i++) {
        int u, k;
        scanf("%d %d", &u, &k);
        for (int j = 0; j < k; j++) {
            int v, c;
            scanf("%d %d", &v, &c);
            M[u][v] = c;
        }
    }

    dijkstra();
    return 0;
}


Compiler output:
main.c:10:12: error: variably modified 'M' at file scope
   10 | static int M[MAX][MAX];
      |            ^
main.c:10:12: error: variably modified 'M' at file scope
Language: C

#include <stdio.h>

#define MAX = 10;
static const int INFINITY = 1 << 21;
static const int WHITE = 0;
static const int GRAY  = 1;
static const int BLACK = 2;

static int n;
static int M[MAX][MAX];

static void dijkstra()
{
    int minv;
    int d[MAX];
    int color[MAX];

    for (int i = 0; i < n; i++) {
        d[i] = INFINITY;
        color[i] = WHITE;
    }

    d[0] = 0;
    color[0] = GRAY;
    while (1) {
        minv = INFINITY;
        int u = -1;
        for (int i = 0; i < n; i++) {
            if (minv > d[i] && color[i] != BLACK) {
                u = i;
                minv = d[i];
            }
        }

        if (u == -1)
            break;

        color[u] = BLACK;

        for (int v = 0; v < n; v++) {
            if (color[v] != BLACK && M[u][v] != INFINITY) {
                if (d[v] > d[u] + M[u][v]) {
                    d[v] = d[u] + M[u][v];
                    color[v] = GRAY;
                }
            }
        }
    }

    for (int i = 0; i < n; i++) {
        printf("%d %d\n", i, (d[i] == INFINITY) ? -1 : d[i]);
    }
}

int main()
{
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            M[i][j] = INFINITY;
        }
    }

    for (int i = 0; i < n; i++) {
        int u, k;
        scanf("%d %d", &u, &k);
        for (int j = 0; j < k; j++) {
            int v, c;
            scanf("%d %d", &v, &c);
            M[u][v] = c;
        }
    }

    dijkstra();
    return 0;
}


Compiler output:
main.c:3:13: error: expected expression before '=' token
    3 | #define MAX = 10;
      |             ^
main.c:10:14: note: in expansion of macro 'MAX'
   10 | static int M[MAX][MAX];
      |              ^~~
main.c:10:22: error: expected identifier or '(' before ']' token
   10 | static int M[MAX][MAX];
      |                      ^
main.c: In function 'dijkstra':
main.c:3:13: error: expected expression before '=' token
    3 | #define MAX = 10;
      |             ^
main.c:15:11: note: in expansion of macro 'MAX'
   15 |     int d[MAX];
      |           ^~~
main.c:3:13: error: expected expression before '=' token
    3 | #define MAX = 10;
      |             ^
main.c:16:15: note: in expansion of macro 'MAX'
   16 |     int color[MAX];
      |               ^~~
main.c:19:9: error: 'd' undeclared (first use in this function)
   19 |         d[i] = INFINITY;
      |         ^
main.c:19:9: note: each undeclared identifier is reported only once for each function it appears in
main.c:20:9: error: 'color' undeclared (first use in this function)
   20 |         color[i] = WHITE;
      |         ^~~~~
main.c:41:38: error: 'M' undeclared (first use in this function)
   41 |             if (color[v] != BLACK && M[u][v] != INFINITY) {
      |                                      ^
main.c: In function 'main':
main.c:60:13: error: 'M' undeclared (first use in this function)
   60 |             M[i][j] = INFINITY;
      |             ^
Language: C

#include<iostream>
#include<cstdio>
#include<climits>
using namespace std;
 
#define N 1000000
int n;
 
int g[N][N];
 
int weight[N];
bool us[N];
 
//prim
void prim(){
 
  int v;
  
  weight[0]=0;
   
  while(true){
    v=-1;
    
    for(int i=0;i<n;i++){
      if(us[i]!=true && (v==-1 ||weight[i]<weight[v]))v=i;
    }
 
    if(v==-1)break;
    us[v]=true;
  
 
    for(int i=0;i<n;i++){
      if(weight[i]>(g[v][i]+weight[v])){
 
        weight[i]=(g[v][i]+weight[v]);
        //      cout <<"fsafa"<<endl;
      }
    }
  }
  
}
 
 
int main(){
 
  int u,k1,c,v;
 
  for(int i=0;i<N;i++){
    for(int j=0;j<N;j++){
      g[i][j]=9953535;
    }
  }
 
  //load n
  cin >>n;
 
  //load data
  for(int i=0;i<n;i++){
    weight[i]=INT_MAX;
    us[i]=false;
    scanf("%d %d",&u,&k1);
    for(int j=0;j<k1;j++){
      scanf("%d %d",&v,&c);
      g[u][v]=c;
      //    cout <<g[i][j]<<" ";
    }
    //    cout <<endl;
  }
 
 
 
 
  //print
  prim();
 
  for(int i=0;i<n;i++){
    cout <<i<<" "<<weight[i]<<endl;
  }
  return 0;
 
}

Compiler output:
main.c:1:9: fatal error: iostream: No such file or directory
    1 | #include<iostream>
      |         ^~~~~~~~~~
compilation terminated.
Language: C

import java.util.Scanner;

class Main{
    final static int LEN = 105;
    public static void main(String args[]){
	int[][] graph = new int[LEN][LEN];
	int[] minCost = new int[LEN];
	int count=0;
	int v;
	boolean[] used = new boolean[LEN];

	Scanner in = new Scanner(System.in);

	//read
	int n = in.nextInt();
	int nodeNumber;
	int k;
	for(int i=0; i<n; i++){
	    for(int j=0; j<n; j++){
		graph[i][j]=20000;
	    }
	}
	for(int i=0; i<n; i++){
	    nodeNumber = in.nextInt();
	    k = in.nextInt();
	    for(int j=0; j<k; j++){
		graph[nodeNumber][in.nextInt()]=in.nextInt();
	    }
	}

	//make prim
	for(int i=0; i<n; i++){
	    minCost[i]=999999;
	    used[i]=false;
	}

	minCost[0]=0;

	while(true){
	    v = -1;
	    for(int i=0; i<n; i++){
		if(!used[i] && (v==-1 || minCost[i] < minCost[v]))v=i;
	    }

	    if(v==-1)break;
	    used[v]=true;
	    count+=minCost[v];

	    for(int i=0; i<n; i++){
		minCost[i]=Math.min(minCost[i], graph[v][i]+minCost[v]);
	    }
	}

	//print
	for(int i=0; i<n; i++)System.out.println(i+" "+minCost[i]);
    }
}

Compiler output:
main.c:1:1: error: unknown type name 'import'
    1 | import java.util.Scanner;
      | ^~~~~~
main.c:1:12: error: expected '=', ',', ';', 'asm' or '__attribute__' before '.' token
    1 | import java.util.Scanner;
      |            ^
main.c:3:1: error: unknown type name 'class'
    3 | class Main{
      | ^~~~~
main.c:3:11: error: expected '=', ',', ';', 'asm' or '__attribute__' before '{' token
    3 | class Main{
      |           ^
Language: C

#include<iostream>
#include<climits>
using namespace std;

typedef struct{
  int A[1000];
  int ans;
  bool c;
}node;
node T[1000];
int Q[10000000];
int head=0;
int tail=1;
int n;

void function(int num){
  while(true){
    if(head==tail)break;
    num=Q[head++];
    T[num].c=true;
    for(int i=0;i<n;i++){
      if(T[num].A[i]!=0){
	//	cout<<T[num].ans<<endl;
	if(T[i].ans>T[num].ans+T[num].A[i]){
	  T[i].ans=T[num].ans+T[num].A[i];
	  T[num].A[i]=0;
	Q[tail++]=i;
	}
      }
    }
    //    cout<<"Q "<<Q[head]<<endl;
    //  cout<<head<<" "<<tail<<endl;
  }

}

int main(){
  int num;
  int son;
  int z,w;
  cin>>n;
  for(int i=0;i<n;i++){
    cin>>num;
    cin>>son;
    T[num].ans=INT_MAX;
    for(int j=0;j<son;j++){
      cin>>z>>w;
      T[num].A[z]=w;
      }
  }
  /*  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      cout<<i<<" "<<j<<" "<<T[i].A[j]<<endl;
    }
    }*/
  Q[0]=0;
 T[0].ans=0;
  function(0);
  T[0].ans=0;

  /* 
for(int i=2;i<=n;i++){
    if(T[i].ans==0){
      T[i].ans=-1;
    }
    }
*/

  for(int i=0;i<n;i++){
      cout<<i<<" "<<T[i].ans<<endl;
  }
  return 0;
}

Compiler output:
main.c:1:9: fatal error: iostream: No such file or directory
    1 | #include<iostream>
      |         ^~~~~~~~~~
compilation terminated.
Language: C++

#include<cstdio>
#include<queue>
#include<utility>
#include<vector>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 250;
const int MAXM = 1000;
int n, m;
int vis[MAXN];
struct Edge{
	int to, weight, next;
}edge[MAXM];
int head[MAXN];
int cnt;
int d[MAXN];
void addEdge(int from, int to, int weight){
	edge[cnt].to = to;
	edge[cnt].weight = weight;
	edge[cnt].next = head[from];
	head[from] = cnt++;
}
void SPFA(int start){
	queue<int> q;
	memset(d, INF, sizeof(d));
	memset(vis, 0, sizeof(vis));
	q.push(start);
	d[start] = 0;
	while (!q.empty()){
		int from = q.front(); q.pop();
		vis[from] = 0;
		for (int i = head[from]; i != -1; i = edge[i].next){
			int to = edge[i].to;
			int weight = edge[i].weight;
			if (d[to] > d[from] + weight){
				d[to] = d[from] + weight;
				if (!vis[to]){
					vis[to] = 1;
					q.push(to);
				}
			}
		}
	}
}
int main(){
	int from, to, weight, k;
	while (scanf("%d", &n) != EOF){
		m = 0;
		memset(head, -1, sizeof(head));
		for (int i = 0; i < n; i++){
			scanf("%d%d", &from, &k);
			m += k;
			for (int i = 0; i < k; i++){
				scanf("%d%d", &to, &weight);
				addEdge(from, to, weight);
			}
		}
		SPFA(0);
		for (int i = 0; i < n; i++) printf("%d %d\n", i, d[i]);
	}
	return 0;
}


Compiler output:
a.cc: In function 'void SPFA(int)':
a.cc:25:9: error: 'memset' was not declared in this scope
   25 |         memset(d, INF, sizeof(d));
      |         ^~~~~~
a.cc:4:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    3 | #include<utility>
  +++ |+#include <cstring>
    4 | #include<vector>
a.cc: In function 'int main()':
a.cc:49:17: error: 'memset' was not declared in this scope
   49 |                 memset(head, -1, sizeof(head));
      |                 ^~~~~~
a.cc:49:17: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
Language: C++

#include"iostream"
#include"algorithm"
#include"cstdio"
#include"cstring"
#include"string"
#include"vector"
#include"queue"
#include"map"
#include"set"
#include"stack"
#include"cmath"
using namespace std;
#define INF 0xfffffff
#define maxn 10002
struct Node
{
    int e;
    int w;
    friend bool operator < (Node A, Node B)
    {
        return  A.w > B.w;
    }
};
bool vis[maxn];
int m, n;
vector< vector<Node> > G;
int Dij(int S,int E)
{
    Node P, Pn;
    P.e = S;
    P.w = 0;
	priority_queue<Node> Q;
	Q.push(P);
	while( !Q.empty() )
    {
        P = Q.top();
        Q.pop();
		if( vis[P.e] )
            continue;
		vis[P.e] = true;
		if( P.e == E )
            return P.w;
		int len = G[P.e].size();
		for(int i=0; i< len; i++)
        {
            Pn.e = G[P.e][i].e;
            Pn.w = G[P.e][i].w + P.w;
			if( !vis[Pn.e] )
                Q.push(Pn);
        }
    }
    return -1;
}
int main()
{
		Node P;
		cin >> m;
        G.resize(10000+1);
		for(int i=0; i<m; i++)
        {
			int k;
			memset(vis,false,sizeof(vis));
			scanf("%d%d",&n,&k);
			for(int j=0;j<k;j++)
			{
            int  b, c;
            cin >> b >> c;
            P.e = b;
            P.w = c;
            G[n].push_back(P);
            P.e = n;
            G[b].push_back(P);
			}
			}
			for(inti=0;i<m;i++)
			{
			int ans = Dij(0,n);
			printf("%d %d\n",n,ans);
        }
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:75:29: error: 'inti' was not declared in this scope; did you mean 'int'?
   75 |                         for(inti=0;i<m;i++)
      |                             ^~~~
      |                             int
a.cc:75:36: error: 'i' was not declared in this scope
   75 |                         for(inti=0;i<m;i++)
      |                                    ^
Language: C++

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	static int N;
	static int W[][], distance[], state[];
	static final int INF = 1000000000;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();

		W = new int[N][N];
		distance = new int[N];
		state = new int[N];

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				W[i][j] = INF;
			}
		}

		for (int i = 0; i < N; i++) {
			sc.nextInt(); // u を読み飛ばし
			int k = sc.nextInt();
			for (int j = 0; j < k; j++) {
				int v = sc.nextInt();
				int c = sc.nextInt();
				W[i][v] = c;
			}
		}
		dijkstra(0);
		for (int i = 0; i < N; i++) {
			System.out.println(i + " " + distance[i]);
		}
	}

	private static int min(int a, int b) {
		if (a < b)
			return a;
		return b;
	}

	private static void dijkstra(int start) {
		// Arrasys.fill は配列の初期化がデキル便利メソッド．ただし1次元配列のみ
		Arrays.fill(distance, INF);
		Arrays.fill(state, 0);
		distance[start] = 0;

		int p = 0; // 確定頂点番号を保存する変数
		for (int step = 0; step < N; step++) {
			int minimum = INF;
			for (int x = 0; x < N; x++) {
				if (state[x] == 0 && distance[x] < minimum) {
					p = x;
					minimum = distance[x];
				}
			}
			if (minimum == INF) {
				System.err.println("Disconnected Graph!\n");
				System.exit(-1);
			}
			state[p] = 1;
			for (int x = 0; x < N; x++)
				distance[x] = min(distance[x], distance[p] + W[p][x]);
		}

	}
}



Compiler output:
a.cc:1:1: error: 'import' does not name a type
    1 | import java.util.Arrays;
      | ^~~~~~
a.cc:1:1: note: C++20 'import' only available with '-fmodules-ts'
a.cc:2:1: error: 'import' does not name a type
    2 | import java.util.Scanner;
      | ^~~~~~
a.cc:2:1: note: C++20 'import' only available with '-fmodules-ts'
a.cc:4:1: error: expected unqualified-id before 'public'
    4 | public class Main {
      | ^~~~~~
Language: C++

#include <queue>
#include <cstdio>
#include <vector>
using namespace std;
int V, E, s, t, p, q, d[100]; vector<int> G[100];
int main() {
	scanf("%d%d", &V, &E);
	for(int i = 0; i < V; i++) {
		scanf("%d%d", &s, &t);
		for(int j = 0; j < t; j++) {
			scanf("%d%d", &p, &q);
			G[i].push_back(make_pair(p, q));
		}
	}
	for(int i = 1; i < V; i++) d[i] = 999999999;
	priority_queue<pair<int, int> > que; que.push(make_pair(0, 0));
	while(!que.empty()) {
		int v = que.top().second; que.pop();
		for(int i = 0; i < G[v].size(); i++) {
			int u = G[v][i].first, w = G[v][i].second;
			if(d[u] > d[v] + w) {
				d[u] = d[v] + w;
				que.push(make_pair(-d[u], u));
			}
		}
	}
	for(int i = 0; i < V; i++) printf("%d %d\n", i, d[i]);
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:12:39: error: no matching function for call to 'std::vector<int>::push_back(std::pair<int, int>)'
   12 |                         G[i].push_back(make_pair(p, q));
      |                         ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/vector:66,
                 from /usr/include/c++/14/queue:63,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_vector.h:1283:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = int; _Alloc = std::allocator<int>; value_type = int]'
 1283 |       push_back(const value_type& __x)
      |       ^~~~~~~~~
/usr/include/c++/14/bits/stl_vector.h:1283:35: note:   no known conversion for argument 1 from 'std::pair<int, int>' to 'const std::vector<int>::value_type&' {aka 'const int&'}
 1283 |       push_back(const value_type& __x)
      |                 ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/14/bits/stl_vector.h:1300:7: note: candidate: 'void std::vector<_Tp, _Alloc>::push_back(value_type&&) [with _Tp = int; _Alloc = std::allocator<int>; value_type = int]'
 1300 |       push_back(value_type&& __x)
      |       ^~~~~~~~~
/usr/include/c++/14/bits/stl_vector.h:1300:30: note:   no known conversion for argument 1 from 'std::pair<int, int>' to 'std::vector<int>::value_type&&' {aka 'int&&'}
 1300 |       push_back(value_type&& __x)
      |                 ~~~~~~~~~~~~~^~~
a.cc:20:41: error: request for member 'first' in 'G[v].std::vector<int>::operator[](((std::vector<int>::size_type)i))', which is of non-class type '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'}
   20 |                         int u = G[v][i].first, w = G[v][i].second;
      |                                         ^~~~~
a.cc:21:42: error: 'w' was not declared in this scope
   21 |                         if(d[u] > d[v] + w) {
      |                                          ^
Language: C++

// ref: p302

using System;

public class SingleSourceShortestPath
{
	const int MAX = 100;
	const int INFTY = Int32.MaxValue;
	const int WHITE = 0;
	const int GRAY = 1;
	const int BLACK = 2;

	static int vertexNum; // ????????° = V
	static int[,] M = new int[MAX,MAX]; // ????????????????¨????????????£??\??????

	static void dijkstra() {
		int minv;
		int[] d = new int[MAX]; // ?§????s????????????v?????§??????????????????????¨????
		int[] color = new int[MAX]; // ?¨??????¶???????????§??¨???

		// ?????????
		for (int i = 0; i < vertexNum; i++) {
			d[i] = INFTY;
			color[i] = WHITE; 
		}

		// ????????????????????????
		d[0] = 0;
		color[0] = GRAY;

		while (true) {
			minv = INFTY;
			int u = -1;
			for (int i = 0; i < vertexNum; i++) {
				// ???????¨???????????????????????????´???
				if (minv > d[i] && color[i] != BLACK) {
					u = i;
					minv = d[i]; //????°???????????????´??°
				}
			}
			// ???????????¢?´¢?????????????????????
			if (u == -1)
				break;
			// ?¨????????????????????????´
			color[u] = BLACK;

			for (int v = 0; v < vertexNum; v++) {
				//???????¨?????????????????????????u??¨v?????????????????????
				if (color[v] != BLACK && M[u,v] != INFTY) {
					if (d[v] > d[u] + M[u,v]) {
						d[v] = d[u] + M[u,v];
						color[v] = GRAY;
					}
				}
			}
		}
		// ????????¨?????????????????????
		for (int i = 0; i < vertexNum; i++) {
			Console.WriteLine ("{0} {1}", i, (d[i] == INFTY ? -1 : d[i]));
		}
	}
	public static void Main(String[] args) {
		// ????????°
		vertexNum = int.Parse(Console.ReadLine ());
		// ??????????????????
		for (int i = 0; i < vertexNum; i++) {
			for (int j = 0; j < vertexNum; j++) {
				M[i,j] = INFTY;
			}
		}

		int k, c, u, v;
		for (int i = 0; i < vertexNum; i++) {
			string[] readLine = Console.ReadLine().Split(' ');
			int s = 0;
			u = int.Parse(readLine[s]);	// ????????????
			s++;
			k = int.Parse(readLine[s]); 	// ????¬???°
			for (int j = 0; j < k; j++) {
				s++;
				v = int.Parse(readLine[s]);	// ??£??\?????????????????????
				s++;
				c = int.Parse(readLine[s]); // u??¨v????????????????????????
				M[u, v] = c;
			}
		}
		dijkstra ();
	}
}

Compiler output:
a.cc:3:7: error: expected nested-name-specifier before 'System'
    3 | using System;
      |       ^~~~~~
a.cc:5:1: error: expected unqualified-id before 'public'
    5 | public class SingleSourceShortestPath
      | ^~~~~~
Language: C++

#include<iostream>
using namespace std;
static const int MAX =100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY =1;
static const int BLACK=2;
int n, N[MAX][MAX];

int prim(){
  int u,minv;
  int d[MAX],p[MAX],color[MAX];

  for(int i = 0;i<n;i++){
    d[i]=INFTY;
    p[i]=-1;
    color[i]=WHITE;
  }
  d[0]=0;

  while(1){
    minv=INFTY;
    u=-1;
    for(int i=0;i<n;i++){
      if(minv>d[i]&&color[i]!=BLACK){
      u=i;
      minv=d[i];
    }
  }
  if(u==-1)break;
  color[u]=BLACK;
  for(int v =0;v<n;v++){
    if(color[v]!=BLACK&& M[u][v]!=INFTY){
      if(d[v]>M[u][v]){
      d[v]=M[u][v];
      p[v]=u;
      color[v]=GRAY;
    }
  }
  }
  }
  int sum=0;
  for(int i=0;i<n;i++){
    if(p[i]!=-1) sum+=M[i][p[i]];
  }
  return sum;
}

int main(){
  cin >>n;

  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      int e; cin >>e;
      M[i][j] =(e==-1) ? INFTY : e;
    }
  }

  cout << prim() << endl;

  return 0;
}

Compiler output:
a.cc: In function 'int prim()':
a.cc:33:26: error: 'M' was not declared in this scope
   33 |     if(color[v]!=BLACK&& M[u][v]!=INFTY){
      |                          ^
a.cc:44:23: error: 'M' was not declared in this scope
   44 |     if(p[i]!=-1) sum+=M[i][p[i]];
      |                       ^
a.cc: In function 'int main()':
a.cc:55:7: error: 'M' was not declared in this scope
   55 |       M[i][j] =(e==-1) ? INFTY : e;
      |       ^
Language: C++



#include<iostream>
using namespace std;
static const int MAX =100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY =1;
static const int BLACK=2;

int n, M[MAX][MAX];

void dijkstra(){
  int minv;
  int d[MAX],color[MAX];

  for(int i = 0;i<n;i++){
    d[i]=INFTY;
    color[i]=WHITE;
  }
  d[0]=0;
  color[0]=GRAY;
  while(1){
    minv=INFTY;
    int u=-1;
    for(int i=0;i<n;i++){
      if(minv>d[i]&&color[i]!=BLACK){
      u=i;
      minv=d[i];
    }
  }
  if(u==-1)break;
  color[u]=BLACK;
  for(int v =0;v<n;v++){
    if(color[v]!=BLACK&& M[u][v]!=INFTY){
      if(d[v]>d[u]+M[u][v]){
      d[v]=d[u][v]+M[u][v];

      color[v]=GRAY;
      }
    }
  }
  }
  for(int i=0;i<n;i++){
    cout << i <<" "<<(d[i] == INFTY ? -1 : d[i]) << endl;
  }
}

int main(){
  cin >>n;

  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){

      M[i][j] = INFTY ;
    }
  }

  int k,c,u,v;
  for(int i=0;i<n;i++){
    xin >> u >> k;
    for(int j=0;j<k;j++){
      xin >> v >>c;
      M[u][v]=c;
    }
  }
  dijkstra();

  return 0;
}

Compiler output:
a.cc: In function 'void dijkstra()':
a.cc:37:16: error: invalid types 'int[int]' for array subscript
   37 |       d[v]=d[u][v]+M[u][v];
      |                ^
a.cc: In function 'int main()':
a.cc:61:5: error: 'xin' was not declared in this scope
   61 |     xin >> u >> k;
      |     ^~~
Language: C++

#include<iostream>
using namespace std;
static const int MAX =100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY =1;
static const int BLACK=2;

int n, M[MAX][MAX];

void dijkstra(){
  int minv;
  int d[MAX],color[MAX];

  for(int i = 0;i<n;i++){
    d[i]=INFTY;
    color[i]=WHITE;
  }
  d[0]=0;
  color[0]=GRAY;
  while(1){
    minv=INFTY;
    int u=-1;
    for(int i=0;i<n;i++){
      if(minv>d[i]&&color[i]!=BLACK){
      u=i;
      minv=d[i];
    }
  }
  if(u==-1)break;
  color[u]=BLACK;
  for(int v =0;v<n;v++){
    if(color[v]!=BLACK&& M[u][v]!=INFTY){
      if(d[v]>d[u]+M[u][v]){
      d[v]=d[u][v]+M[u][v];

      color[v]=GRAY;
      }
    }
  }
  }
  for(int i=0;i<n;i++){
    cout << i <<" "<<(d[i] == INFTY ? -1 : d[i]) << endl;
  }
}

int main(){
  cin >>n;

  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){

      M[i][j] = INFTY ;
    }
  }

  int k,c,u,v;
  for(int i=0;i<n;i++){
    xin >> u >> k;
    for(int j=0;j<k;j++){
      xin >> v >>c;
      M[u][v]=c;
    }
  }
  dijkstra();

  return 0;
}

Compiler output:
a.cc: In function 'void dijkstra()':
a.cc:35:16: error: invalid types 'int[int]' for array subscript
   35 |       d[v]=d[u][v]+M[u][v];
      |                ^
a.cc: In function 'int main()':
a.cc:59:5: error: 'xin' was not declared in this scope
   59 |     xin >> u >> k;
      |     ^~~
Language: C++

#include<iostream>
using namespace std;
static const int MAX =100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY =1;
static const int BLACK=2;

int n, M[MAX][MAX];

void dijkstra(){
  int minv;
  int d[MAX],color[MAX];

  for(int i = 0;i<n;i++){
    d[i]=INFTY;
    color[i]=WHITE;
  }
  d[0]=0;
  color[0]=GRAY;
  while(1){
    minv=INFTY;
    int u=-1;
    for(int i=0;i<n;i++){
      if(minv>d[i]&&color[i]!=BLACK){
      u=i;
      minv=d[i];
    }
  }
  if(u==-1)break;
  color[u]=BLACK;
  for(int v =0;v<n;v++){
    if(color[v]!=BLACK&& M[u][v]!=INFTY){
      if(d[v]>d[u]+M[u][v]){
      d[v]=d[u][v]+M[u][v];

      color[v]=GRAY;
      }
    }
  }
  }
  for(int i=0;i<n;i++){
    cout << i <<" "<<(d[i] == INFTY ? -1 : d[i]) << endl;
  }
}

int main(){
  cin >>n;

  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){

      M[i][j] = INFTY ;
    }
  }

  int k,c,u,v;
  for(int i=0;i<n;i++){
    cin >> u >> k;
    for(int j=0;j<k;j++){
      cin >> v >>c;
      M[u][v]=c;
    }
  }
  dijkstra();

  return 0;
}

Compiler output:
a.cc: In function 'void dijkstra()':
a.cc:35:16: error: invalid types 'int[int]' for array subscript
   35 |       d[v]=d[u][v]+M[u][v];
      |                ^
Language: C++

#include<iostream>
using namespace std;
static const int MAX =100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY =1;
static const int BLACK=2;

int n, M[MAX][MAX];

void dijkstra(){
  int minv;
  int d[MAX],color[MAX];

  for(int i = 0;i<n;i++){
    d[i]=INFTY;
    color[i]=WHITE;
  }
  d[0]=0;
  color[0]=GRAY;
  while(1){
    minv=INFTY;
    int u=-1;
    for(int i=0;i<n;i++){
      if(minv>d[i]&&color[i]!=BLACK){
      u=i;
      minv=d[i];
    }
  }
  if(u==-1)break;
  color[u]=BLACK;
  for(int v =0;v<n;v++){
    if(color[v]!=BLACK&& M[u][v]!=INFTY){
      if(d[v]>d[u]+M[u][v]){
      d[v]=d[u][v]+M[u][v];

      color[v]=GRAY;
      }
    }
  }
  }
  for(int i=0;i<n;i++){
    cout << i <<" "<<(d[i] == INFTY ? -1 : d[i]) << endl;
  }
}

int main(){
  cin >>n;

  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){

      M[i][j] = INFTY;
    }
  }

  int k,c,u,v;
  for(int i=0;i<n;i++){
    cin >> u >> k;
    for(int j=0;j<k;j++){
      cin >> v >>c;
      M[u][v]=c;
    }
  }
  dijkstra();

  return 0;
}

Compiler output:
a.cc: In function 'void dijkstra()':
a.cc:35:16: error: invalid types 'int[int]' for array subscript
   35 |       d[v]=d[u][v]+M[u][v];
      |                ^
Language: C++

#include<iostream>
using namespace std;
static const int MAX =100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY =1;
static const int BLACK=2;

int n, M[MAX][MAX];

void dijkstra(){
  int minv;
  int d[MAX],color[MAX];

  for(int i = 0;i<n;i++){
    d[i]=INFTY;
    color[i]=WHITE;
  }
  d[0]=0;
  color[0]=GRAY;
  while(1){
    minv=INFTY;
    int u=-1;
    for(int i=0;i<n;i++){
      if(minv>d[i]&&color[i]!=BLACK){
      u=i;
      minv=d[i];
    }
  }
  if(u==-1)break;
  color[u]=BLACK;
  for(int v =0;v<n;v++){
    if(color[v]!=BLACK&& M[u][v]!=INFTY){
      if(d[v]>d[u]+M[u][v]){
      d[v]=d[u][v]+M[u][v];
      color[v]=GRAY;
      }
    }
  }
  }
  for(int i=0;i<n;i++){
    cout << i << " " << ( d[i] == INFTY ? -1 : d[i] ) << endl;
  }
}

int main(){
  cin >> n;

  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      M[i][j] = INFTY;
    }
  }

  int k,c,u,v;
  for(int i=0;i<n;i++){
    cin >> u >> k;
    for(int j=0;j<k;j++){
      cin >> v >>c;
      M[u][v]=c;
    }
  }

  dijkstra();

  return 0;
}

Compiler output:
a.cc: In function 'void dijkstra()':
a.cc:35:16: error: invalid types 'int[int]' for array subscript
   35 |       d[v]=d[u][v]+M[u][v];
      |                ^
Language: C++

#include <iostream>
using namespace std;
#include <algorithm>
#define INF 1000000

int flg[100];

bool check(int p){

	if (flg[p] == 1) return false;
	return true;
}

int main(void){

	int n;

	cin >> n;
	int u, k;
	int date[100][100]; //date[??????????????????][?????´?????????]
	int dis[100]; //0????????????????????????????????¢

	memset(date, INF, sizeof(date));
	memset(dis, INF, sizeof(dis));
	memset(flg, 0, sizeof(flg));
	date[0][0] = 0;
	dis[0] = 0;
	for (int i = 0; i < n; i++){

		cin >> u >> k;
		for (int j = 0; j < k; j++){

			int v, c;
			cin >> v >> c;
			date[u][v] = c;
		}
	}

	while(1){
		int mini = INF;
		int p = -1;
		for (int i = 0; i < n; i++){
			if (check(i) && mini > dis[i]){
				p = i;
				mini = dis[i];
			}
		}
		if (p == -1) break;
		flg[p] = 1;
		for (int i = 0; i < n; i++){
			if (check(i) && dis[i] > dis[p] + date[p][i]){
				dis[i] = dis[p] + date[p][i];
			}
		}
	}

	for (int i = 0; i < n; i++){
		cout << i << ' ' << dis[i] << endl;
	}
}

Compiler output:
a.cc: In function 'int main()':
a.cc:23:9: error: 'memset' was not declared in this scope
   23 |         memset(date, INF, sizeof(date));
      |         ^~~~~~
a.cc:4:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    3 | #include <algorithm>
  +++ |+#include <cstring>
    4 | #define INF 1000000
Language: C++

#include <iostream>
using namespace std;
#include <algorithm>
#include <string>
#define INF 1000000

int flg[100];

bool check(int p){

	if (flg[p] == 1) return false;
	return true;
}

int main(void){

	int n;

	cin >> n;
	int u, k;
	int date[100][100]; //date[??????????????????][?????´?????????]
	int dis[100]; //0????????????????????????????????¢

	memset(date, INF, sizeof(date));
	memset(dis, INF, sizeof(dis));
	memset(flg, 0, sizeof(flg));
	date[0][0] = 0;
	dis[0] = 0;
	for (int i = 0; i < n; i++){

		cin >> u >> k;
		for (int j = 0; j < k; j++){

			int v, c;
			cin >> v >> c;
			date[u][v] = c;
		}
	}

	while(1){
		int mini = INF;
		int p = -1;
		for (int i = 0; i < n; i++){
			if (check(i) && mini > dis[i]){
				p = i;
				mini = dis[i];
			}
		}
		if (p == -1) break;
		flg[p] = 1;
		for (int i = 0; i < n; i++){
			if (check(i) && dis[i] > dis[p] + date[p][i]){
				dis[i] = dis[p] + date[p][i];
			}
		}
	}

	for (int i = 0; i < n; i++){
		cout << i << ' ' << dis[i] << endl;
	}
}

Compiler output:
a.cc: In function 'int main()':
a.cc:24:9: error: 'memset' was not declared in this scope
   24 |         memset(date, INF, sizeof(date));
      |         ^~~~~~
a.cc:4:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    3 | #include <algorithm>
  +++ |+#include <cstring>
    4 | #include <string>
Language: C++

#include <iostream>
#include <limits>
#define N 100
#define INF INT_MAX

using namespace std;

int n,M[N][N],d[N];

void dijkstra(int s){
  bool visited[n];
  for(int i=0;i<n;i++){
    visited[i]=false;
    d[i]=INF;
  }
  d[s]=0;
  while(1){
    int mincost=INF;
    int u;
    //find minimum d from non-visited nodes
    for(int i=0;i<n;i++){
      if(!visited[i] && d[i]<mincost){
        mincost=d[i];
        u=i;
      }
    }
    if(mincost==INF) break;

    visited[u]=true;
    //update d
    for(int v=0;v<n;v++){
      if(!visited[v] && M[u][v]!=INF){
        if(d[u]+M[u][v]<d[v]){
          d[v]=d[u]+M[u][v];
        }
      }
    }
  }
}

int main(){
  cin >> n;
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++) M[i][j]=INF;
  }
  for(int i=0;i<n;i++){
    int u,k; cin >> u >> k;
    for(int i=0;i<k;i++){
      int v,c; cin >> v >> c;
      M[u][v]=c;
    }
  }
  dijkstra(0);
  for(int i=0;i<n;i++)
    cout << i << " " << d[i] << endl;
}

Compiler output:
a.cc: In function 'void dijkstra(int)':
a.cc:4:13: error: 'INT_MAX' was not declared in this scope
    4 | #define INF INT_MAX
      |             ^~~~~~~
a.cc:14:10: note: in expansion of macro 'INF'
   14 |     d[i]=INF;
      |          ^~~
a.cc:3:1: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    2 | #include <limits>
  +++ |+#include <climits>
    3 | #define N 100
a.cc:4:13: error: 'INT_MAX' was not declared in this scope
    4 | #define INF INT_MAX
      |             ^~~~~~~
a.cc:18:17: note: in expansion of macro 'INF'
   18 |     int mincost=INF;
      |                 ^~~
a.cc:4:13: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    4 | #define INF INT_MAX
      |             ^~~~~~~
a.cc:18:17: note: in expansion of macro 'INF'
   18 |     int mincost=INF;
      |                 ^~~
a.cc: In function 'int main()':
a.cc:4:13: error: 'INT_MAX' was not declared in this scope
    4 | #define INF INT_MAX
      |             ^~~~~~~
a.cc:44:34: note: in expansion of macro 'INF'
   44 |     for(int j=0;j<n;j++) M[i][j]=INF;
      |                                  ^~~
a.cc:4:13: note: 'INT_MAX' is defined in header '<climits>'; this is probably fixable by adding '#include <climits>'
    4 | #define INF INT_MAX
      |             ^~~~~~~
a.cc:44:34: note: in expansion of macro 'INF'
   44 |     for(int j=0;j<n;j++) M[i][j]=INF;
      |                                  ^~~
Language: C++

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

const int INF = INT_MAX;
typedef pair<int, int> P;
typedef int long long

struct edge {int to, cost;};

/*
[input]
const vector<vector<edge>> &graph : ??\?????°??????
int s : ?§????
int g : ??????
n*/
int dijkstra(const vector<vector<edge>> &graph, int s, int g ) {
  // ????????????????±?????????????????????????
  vector<int> d(graph.size(), INF);
  // ????§?????????????????????????0????????????
  d[s] = 0;
  // ??????????????????now
  set<P> now;
  // ????§?????????????now????????\
  now.insert(P(0, s));
  
  // now????????????????????§
  while(!now.empty()) {
    // ?????¨?????????????????????pos???????´?
    int pos = now.begin()->second;
    // ?????¨??????????????????????????????????±???????????????????????????????
    if (pos == g) {
      for(int i = 0; i <= g; i++) {
        cout << i << " " << d[i] << endl;
      }
      return INF;
    }
    // now????????¢?´¢?????????????¶????
    now.erase(now.begin());
    // ?????¨??????????????¨???????????¢?´¢
    for(auto ed: graph[pos]) {
      // ??\?¶??????????????????????????????????????????¨??????????????§????????????
      // ??¨??\?¶?????????§?????¨????????????????????????????????§???????????°
      if(d[ed.to] > d[pos] + ed.cost) {
        // now????????\?¶?????????????????±????????????????????????????
        now.erase(P(d[ed.to], ed.to));
        d[ed.to] = d[pos] + ed.cost;
        now.insert(P(d[ed.to], ed.to));
      }
    }
  }
  return INF;
}
  
unsigned main() {
  int num;
  cin >> num;
  vector<vector<edge>> graph(num, vector<edge>());
  int f, n, k, v, c;
  for(int i = 0; i < num; i++) {
    cin >> f >> k;
	if(k == 0) continue;
    for(int j = 0; j < k; j++) {
      cin >> v >> c;
      graph[f].push_back(edge{v, c});
      graph[v].push_back(edge{f, c});
    }
  }
  dijkstra(graph, 0, num - 1);
  return 0;
}

Compiler output:
a.cc:6:9: error: multiple types in one declaration
    6 | typedef int long long
      |         ^~~
a.cc:8:27: error: declaration does not declare anything [-fpermissive]
    8 | struct edge {int to, cost;};
      |                           ^
cc1plus: error: '::main' must return 'int'
Language: C++

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

const int INF = INT_MAX;
typedef pair<int, int> P;
typedef int long long

struct edge {int to, cost;};

/*
[input]
const vector<vector<edge>> &graph : ??\?????°??????
int s : ?§????
int g : ??????
n*/
int dijkstra(const vector<vector<edge>> &graph, int s, int g ) {
  // ????????????????±?????????????????????????
  vector<int> d(graph.size(), INF);
  // ????§?????????????????????????0????????????
  d[s] = 0;
  // ??????????????????now
  set<P> now;
  // ????§?????????????now????????\
  now.insert(P(0, s));
  
  // now????????????????????§
  while(!now.empty()) {
    // ?????¨?????????????????????pos???????´?
    int pos = now.begin()->second;
    // ?????¨??????????????????????????????????±???????????????????????????????
    if (pos == g) {
      for(int i = 0; i <= g; i++) {
        cout << i << " " << d[i] << endl;
      }
      return INF;
    }
    // now????????¢?´¢?????????????¶????
    now.erase(now.begin());
    // ?????¨??????????????¨???????????¢?´¢
    for(auto ed: graph[pos]) {
      // ??\?¶??????????????????????????????????????????¨??????????????§????????????
      // ??¨??\?¶?????????§?????¨????????????????????????????????§???????????°
      if(d[ed.to] > d[pos] + ed.cost) {
        // now????????\?¶?????????????????±????????????????????????????
        now.erase(P(d[ed.to], ed.to));
        d[ed.to] = d[pos] + ed.cost;
        now.insert(P(d[ed.to], ed.to));
      }
    }
  }
  return INF;
}
  
signed main() {
  int num;
  cin >> num;
  vector<vector<edge>> graph(num, vector<edge>());
  int f, n, k, v, c;
  for(int i = 0; i < num; i++) {
    cin >> f >> k;
	if(k == 0) continue;
    for(int j = 0; j < k; j++) {
      cin >> v >> c;
      graph[f].push_back(edge{v, c});
      graph[v].push_back(edge{f, c});
    }
  }
  dijkstra(graph, 0, num - 1);
  return 0;
}

Compiler output:
a.cc:6:9: error: multiple types in one declaration
    6 | typedef int long long
      |         ^~~
a.cc:8:27: error: declaration does not declare anything [-fpermissive]
    8 | struct edge {int to, cost;};
      |                           ^
Language: C++

#include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

void dijkstra() {
   int minv;
   int color[MAX], d[MAX];
   
   for(int i = 0; i < n; i++) {
   	  d[i] = INFTY; 
	  color[i] = WHITE;
   } 
   
   d[0] = 0;
   color[0] = GRAY;
   
   while( 1 ) {
      minv = INFTY;
      int u = -1;
      for(int i = 0; i < n; i++) {
      	  if(minv > d[i] && color[i] != BLACK) {
  	      	  minv = d[i];
  	      	  u = i;
  	      }
      }
      if(u = -1) break;
      color[u] = BLACK;
      for(int i =  0; i < n; i++) {
      	  if(color[v] != BLACK && M[u][v] != INFTY) {
  	      	if(d[v] > d[u] + M[u][v]) {
	      	  	d[v] = d[u] + M[u][v];
	      	  	color[v] = GRAY;
      	    }
         }
      }
   }
   
   for(int i = 0; i < n; i++) {
   	   cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl; 
   }
}

int main() {
	cin >> n;
	int u, k;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < n; j++) {
			M[i][i] = INFTY;
		}
	}
	
	for(int i = 0; i < n; i++) {
		cin >> u >> k;
		for(int j = 0; j < k; j++) {
			cin >> v >> c;
			M[u][v] = c;
		}
	}
	
	dijkstra();
	
	return 0;
} 

Compiler output:
a.cc: In function 'void dijkstra()':
a.cc:35:20: error: 'v' was not declared in this scope
   35 |           if(color[v] != BLACK && M[u][v] != INFTY) {
      |                    ^
a.cc: In function 'int main()':
a.cc:61:32: error: 'v' was not declared in this scope
   61 |                         cin >> v >> c;
      |                                ^
a.cc:61:37: error: 'c' was not declared in this scope
   61 |                         cin >> v >> c;
      |                                     ^
Language: C++

#include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

void dijkstra() {
   int minv;
   int color[MAX], d[MAX];
   
   for(int i = 0; i < n; i++) {
   	  d[i] = INFTY; 
	  color[i] = WHITE;
   } 
   
   d[0] = 0;
   color[0] = GRAY;
   
   while( 1 ) {
      minv = INFTY;
      int u = -1;
      for(int i = 0; i < n; i++) {
      	  if(minv > d[i] && color[i] != BLACK) {
  	      	  minv = d[i];
  	      	  u = i;
  	      }
      }
      if(u = -1) break;
      color[u] = BLACK;
      for(int v =  0; v < n; i++) {
      	  if(color[v] != BLACK && M[u][v] != INFTY) {
  	      	if(d[v] > d[u] + M[u][v]) {
	      	  	d[v] = d[u] + M[u][v];
	      	  	color[v] = GRAY;
      	    }
         }
      }
   }
   
   for(int i = 0; i < n; i++) {
   	   cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl; 
   }
}

int main() {
	cin >> n;
	int u, k c;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < n; j++) {
			M[i][i] = INFTY;
		}
	}
	
	for(int i = 0; i < n; i++) {
		cin >> u >> k;
		for(int j = 0; j < k; j++) {
			cin >> v >> c;
			M[u][v] = c;
		}
	}
	
	dijkstra();
	
	return 0;
} 

Compiler output:
a.cc: In function 'void dijkstra()':
a.cc:34:30: error: 'i' was not declared in this scope
   34 |       for(int v =  0; v < n; i++) {
      |                              ^
a.cc: In function 'int main()':
a.cc:51:18: error: expected initializer before 'c'
   51 |         int u, k c;
      |                  ^
a.cc:59:29: error: 'k' was not declared in this scope
   59 |                 cin >> u >> k;
      |                             ^
a.cc:61:32: error: 'v' was not declared in this scope
   61 |                         cin >> v >> c;
      |                                ^
a.cc:61:37: error: 'c' was not declared in this scope
   61 |                         cin >> v >> c;
      |                                     ^
Language: C++

#include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1 << 21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

void dijkstra() {
   int minv;
   int color[MAX], d[MAX];
   
   for(int i = 0; i < n; i++) {
   	  d[i] = INFTY; 
	  color[i] = WHITE;
   } 
   
   d[0] = 0;
   color[0] = GRAY;
   
   while( 1 ) {
      minv = INFTY;
      int u == -1;
      for(int i = 0; i < n; i++) {
      	  if(minv > d[i] && color[i] != BLACK) {
  	      	  minv = d[i];
  	      	  u = i;
  	      }
      }
      if(u = -1) break;
      color[u] = BLACK;
      for(int v =  0; v < n; v++) {
      	  if(color[v] != BLACK && M[u][v] != INFTY) {
  	      	if(d[v] > d[u] + M[u][v]) {
	      	  	d[v] = d[u] + M[u][v];
	      	  	color[v] = GRAY;
      	    }
         }
      }
   }
   
   for(int i = 0; i < n; i++) {
   	   cout << i << " " << (d[i] == INFTY ? -1 : d[i]) << endl; 
   }
}

int main() {
	cin >> n;
	int u, k, c, v;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < n; j++) {
			M[i][i] = INFTY;
		}
	}
	
	for(int i = 0; i < n; i++) {
		cin >> u >> k;
		for(int j = 0; j < k; j++) {
			cin >> v >> c;
			M[u][v] = c;
		}
	}
	
	dijkstra();
	
	return 0;
} 

Compiler output:
a.cc: In function 'void dijkstra()':
a.cc:25:13: error: expected initializer before '==' token
   25 |       int u == -1;
      |             ^~
a.cc:29:19: error: 'u' was not declared in this scope
   29 |                   u = i;
      |                   ^
a.cc:32:10: error: 'u' was not declared in this scope
   32 |       if(u = -1) break;
      |          ^
a.cc:33:13: error: 'u' was not declared in this scope
   33 |       color[u] = BLACK;
      |             ^