A11497 | Jamie and Interesting Graph
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Jamie has recently found undirected weighted graphs with the following properties very interesting:
- The graph is connected and contains exactly $n$ vertices and $m$ edges.
- All edge weights are integers and are in range $[1,10^{9}]$ inclusive.
- The length of shortest path from $1$ to $n$ is a prime number.
- The sum of edges' weights in the minimum spanning tree (MST) of the graph is a prime number.
- The graph contains no loops or multi-edges.
If you are not familiar with some terms from the statement you can find definitions of them in notes section.
Help Jamie construct any graph with given number of vertices and edges that is interesting!
- The graph is connected and contains exactly $n$ vertices and $m$ edges.
- All edge weights are integers and are in range $[1,10^{9}]$ inclusive.
- The length of shortest path from $1$ to $n$ is a prime number.
- The sum of edges' weights in the minimum spanning tree (MST) of the graph is a prime number.
- The graph contains no loops or multi-edges.
If you are not familiar with some terms from the statement you can find definitions of them in notes section.
Help Jamie construct any graph with given number of vertices and edges that is interesting!
输入格式
First line of input contains 2 integers $n$ , $m$  — the required number of vertices and edges.
输出格式
In the first line output 2 integers $sp$ , $mstw$ $(1<=sp,mstw<=10^{14})$ — the length of the shortest path and the sum of edges' weights in the minimum spanning tree.
In the next $m$ lines output the edges of the graph. In each line output 3 integers $u$ , $v$ , $w$ $(1<=u,v<=n,1<=w<=10^{9})$ describing the edge connecting $u$ and $v$ and having weight $w$ .
In the next $m$ lines output the edges of the graph. In each line output 3 integers $u$ , $v$ , $w$ $(1<=u,v<=n,1<=w<=10^{9})$ describing the edge connecting $u$ and $v$ and having weight $w$ .
输入输出样例
输入 #1
4 4
输出 #1
7 7 1 2 3 2 3 2 3 4 2 2 4 4
输入 #2
5 4
输出 #2
7 13 1 2 2 1 3 4 1 4 3 4 5 4
The graph of sample 1:  Shortest path sequence: ${1,2,3,4}$ . MST edges are marked with an asterisk (\*).
Definition of terms used in the problem statement:
A shortest path in an undirected graph is a sequence of vertices $(v_{1},v_{2},...\ ,v_{k})$ such that $v_{i}$ is adjacent to $v_{i+1}$ $1<=i<k$ and the sum of weight  is minimized where $w(i,j)$ is the edge weight between $i$ and $j$ . ([https://en.wikipedia.org/wiki/Shortest\_path\_problem](https://en.wikipedia.org/wiki/Shortest_path_problem))
A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. ([https://en.wikipedia.org/wiki/Prime\_number](https://en.wikipedia.org/wiki/Prime_number))
A minimum spanning tree (MST) is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. ([https://en.wikipedia.org/wiki/Minimum\_spanning\_tree](https://en.wikipedia.org/wiki/Minimum_spanning_tree))
[https://en.wikipedia.org/wiki/Multiple\_edges](https://en.wikipedia.org/wiki/Multiple_edges)
Definition of terms used in the problem statement:
A shortest path in an undirected graph is a sequence of vertices $(v_{1},v_{2},...\ ,v_{k})$ such that $v_{i}$ is adjacent to $v_{i+1}$ $1<=i<k$ and the sum of weight  is minimized where $w(i,j)$ is the edge weight between $i$ and $j$ . ([https://en.wikipedia.org/wiki/Shortest\_path\_problem](https://en.wikipedia.org/wiki/Shortest_path_problem))
A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. ([https://en.wikipedia.org/wiki/Prime\_number](https://en.wikipedia.org/wiki/Prime_number))
A minimum spanning tree (MST) is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. ([https://en.wikipedia.org/wiki/Minimum\_spanning\_tree](https://en.wikipedia.org/wiki/Minimum_spanning_tree))
[https://en.wikipedia.org/wiki/Multiple\_edges](https://en.wikipedia.org/wiki/Multiple_edges)
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted