Module: 카운트. 시작


Problem

6/9

인접 목록: 시작(C++)

Problem

유방향 그래프 이미지가 주어지면 모든 정점에 대한 인접 목록을 인쇄합니다.
 
 

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include <iostream>
#include <vector>

using namespace std;
	
int main() {
	int n, m, s, f;
	const int V = 4;
	vector< vector < pair <int, int>>>  adj(V+1);
	adj[1].push_back({ 2,5 });
	// остальные ребра добавьте сами       
for (size_t i = 1; i <= V; i++)
	{
		cout << i << ": ";
		for (auto x : adj[i])
				cout << "-> " << x.first << "("<<x.second<<")";
			cout << "\n";
	}
	return 0;
}

     

Program check result

To check the solution of the problem, you need to register or log in!