Submission #993890

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <sstream>

#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <deque>
#include <string>

#include <algorithm>
#include <numeric>

#include <cstdio>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>

#define pb push_back
#define pbk pop_back
#define mp make_pair
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define foreach(i, a) for (__typeof((a).begin()) i = (a).begin(); i != (a).end(); ++i)
#define len(a) ((int) (a).size())

#ifdef CUTEBMAING
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif

using namespace std;

typedef long long int64;
typedef long double ld;
typedef unsigned long long lint;

const int inf = (1 << 30) - 1;
const int64 linf = (1ll << 62) - 1;
const int N = 1e6 + 100;

int n, q;
int a[N], b[N], c[N];
int parent[N];

inline int findSet(int v) {
    if (parent[v] != v) {
        return parent[v] = findSet(parent[v]);
    }
    return v;
}

int main() {
#ifdef XCODE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cin >> n >> q;
    for (int i = 0; i < q; i++) {
        scanf("%d%d%d", &a[i], &b[i], &c[i]);
    }
    for (int i = 0; i < n; i++) {
        parent[i] = i;
    }
    set<tuple<int, int, int, int>> st;
    for (int i = 0; i < q; i++) {
        st.insert(make_tuple(c[i], a[i], b[i], 0));
    }
    int64 ans = 0;
    while (len(st) > 0) {
        int c, u, v, cnt; tie(c, u, v, cnt) = *st.begin();
        st.erase(st.begin());
        if (findSet(u) == findSet(v)) {
            if (cnt >= 2) {
                continue;
            } else {
                st.insert(make_tuple(c + 1, v, (u + 1) % n, cnt + 1));
                continue;
            }
        }
        ans += c;
        parent[findSet(u)] = findSet(v);
        st.insert(make_tuple(c + 1, v, (u + 1) % n, 0));
    }
    for (int i = 0; i < n; i++) {
        assert(findSet(0) == findSet(i));
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:65:45: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &a[i], &b[i], &c[i]);
                                             ^

Judge Result