👍 👍 👍 👍

👍 👍 👍

#include <bits/stdc++.h>

using namespace std;

#define TRACE 1
#define tcout TRACE && cout

#define int long long
#define endl '\n'
#define fst ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

const int N = 20, M = 60;

int n, m;

int idx;
int h[N];
int e[M];
int wt[M];
int ne[M];

void add_edge(int u, int v, int w)
{
	idx++;
	e[idx] = v;
	wt[idx] = w;
	ne[idx] = h[u];
	h[u] = idx;
}

signed main()
{
	cin >> n >> m;
	for(int i=1; i<=m; i++)
	{
		int u, v, w;
		cin >> u >> v >> w;
		add_edge(u, v, w);
	}
	for(int i=1; i<=n; i++)
	{
		cout << i << ": ";
		for(int j=h[i]; j; j=ne[j])
		{
			cout << "(" << e[j] << ", " << wt[j] << ") ";
		}
		cout << endl;
	}
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

#define TRACE 1
#define tcout TRACE && cout

#define int long long
#define endl '\n'
#define fst ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

const int N = 20;

struct Node
{
	int v, w;
	bool operator< (const Node& b)
	{
		return v < b.v;
	}
};

int n, m;
vector<Node> g[N];

signed main()
{
	cin >> n >> m;
	for(int i=1; i<=m; i++)
	{
		int u, v, w;
		cin >> u >> v >> w;
		g[u].push_back({v, w});
	}
	for(int i=1; i<=n; i++)
	{
		sort(g[i].begin(), g[i].end());
		cout << i << ":";
		for(auto e: g[i])
		{
			cout << "(" << e.v << ", " << e.w << ") ";
		}
		cout << endl;
	}
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

#define TRACE 1
#define tcout TRACE && cout

#define int long long
#define endl '\n'
#define fst ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

const int INF = 0x3f3f3f3f3f3f3f3f;

int n, m;
int g[20][20];

signed main()
{
	cin >> n >> m;
	for(int i=1; i<=n; i++)
	{
		for(int j=1; j<=n; j++)
		{
			if(i == j)
			{
				g[i][j] = 0;
			}
			else
			{
				g[i][j] = INF;
			}
		}
	}
	for(int i=1; i<=m; i++)
	{
		int u, v, w;
		cin >> u >> v >> w;
		g[u][v] = w;
	}
	for(int i=1; i<=n; i++)
	{
		for(int j=1; j<=n; j++)
		{
			if(g[i][j] == INF)
			{
				cout << "   N";
			}
			else
			{
				cout << setw(4) << g[i][j];
			}
		}
		cout << endl;
	} 
	return 0;
}

👍 +1

👍