CodeForces - 916C(构造)

Jamie and Interesting Graph

题目传送门
题意：给你n，m，表示n个顶点和m条边，让你构造一个图，要求1.1->n最短路为prime、2.mst边权和为prime、3.没有重边、4.边大小[1,1e9。(题目给定m>n-1)
思路：先利用n-1条边构造出最短路和MST，使得最短路=sum_MST=prime)，再连接剩下的边

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
#include <functional>
#define inf 10000000
using namespace std;
typedef long long ll;
const int MAXN=5e6+10;
const int MAX=1e6+10;
const double eps=1e-6;



int main(){
    #ifdef ONLINE_JUDGE
    #else
    freopen("in.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #endif

    int n,m;
    cin>>n>>m;
    int prime=1e5+3;
    int cnt=m-(n-1);
    cout<<prime<<" "<<prime<<endl;
    cout<<1<<" "<<2<<" "<<prime-n+2<<endl;
    for(int i=2;i<n;i++)
        cout<<i<<" "<<i+1<<" "<<1<<endl;
    for(int i=1;i<=n-1;i++){
        for(int j=i+2;j<=n;j++){
            if(!cnt)    return 0;
            cout<<i<<" "<<j<<" "<<(prime*2)<<endl;
            cnt--;
        }
    }

    return 0;
}