Submission #5570943
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }
using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};
const int mod = 1000000007;
//const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod
class UnionFind
{
public:
vector<int> par;
vector<int> sz;
UnionFind(int N){
par = vector<int>(N);
REP(i, N) par[i] = i;
sz = vector<int>(N, 1);
}
int find(int x){
if(par[x] == x) return x;
else return par[x] = find(par[x]);
}
void unite(int x, int y){
x = find(x);
y = find(y);
if(x == y) return;
if(sz[x] < sz[y]) swap(x, y);
par[y] = x;
sz[x] += sz[y];
}
bool is_union(int x, int y){
x = find(x);
y = find(y);
return x == y;
}
int union_size(int x){
return sz[find(x)];
}
};
signed main(){
int N, Q; cin >> N >> Q;
vec A(Q), B(Q), C(Q);
priority_queue<PiP, vector<PiP>, greater<PiP>> que;
REP(i, Q){
cin >> A[i] >> B[i] >> C[i];
que.push(PiP(C[i], Pii(A[i], B[i])));
que.push(PiP(C[i] + 1, Pii(B[i], (A[i] + 1) % N)));
}
UnionFind UF(N);
int ans = 0;
while(UF.union_size(0) < N){
PiP tmp = que.top(); que.pop();
int c = tmp.f, a = tmp.s.f, b = tmp.s.s;
//cout << c << "," << a << "," << b << endl;
if(!UF.is_union(a, b)){
ans += c;
UF.unite(a, b);
que.push(PiP(c + 2, Pii((a + 1) % N, (b + 1) % N)));
}
}
Out(ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
G - Zigzag MST |
User |
sumitacchan |
Language |
C++14 (GCC 5.4.1) |
Score |
1300 |
Code Size |
3529 Byte |
Status |
AC |
Exec Time |
192 ms |
Memory |
19436 KB |
Judge Result
Set Name |
sample |
all |
Score / Max Score |
0 / 0 |
1300 / 1300 |
Status |
|
|
Set Name |
Test Cases |
sample |
sample-01.txt, sample-02.txt, sample-03.txt |
all |
sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
1 ms |
256 KB |
01-02.txt |
AC |
60 ms |
18156 KB |
01-03.txt |
AC |
93 ms |
19308 KB |
01-04.txt |
AC |
11 ms |
3328 KB |
01-05.txt |
AC |
11 ms |
3328 KB |
01-06.txt |
AC |
14 ms |
3328 KB |
01-07.txt |
AC |
15 ms |
3456 KB |
01-08.txt |
AC |
22 ms |
3456 KB |
01-09.txt |
AC |
33 ms |
4216 KB |
01-10.txt |
AC |
74 ms |
10988 KB |
01-11.txt |
AC |
87 ms |
18540 KB |
01-12.txt |
AC |
111 ms |
19176 KB |
01-13.txt |
AC |
113 ms |
19180 KB |
01-14.txt |
AC |
112 ms |
18924 KB |
01-15.txt |
AC |
112 ms |
18668 KB |
01-16.txt |
AC |
111 ms |
19176 KB |
01-17.txt |
AC |
113 ms |
18668 KB |
01-18.txt |
AC |
113 ms |
18792 KB |
01-19.txt |
AC |
12 ms |
3456 KB |
01-20.txt |
AC |
34 ms |
3584 KB |
01-21.txt |
AC |
87 ms |
7536 KB |
01-22.txt |
AC |
192 ms |
19176 KB |
01-23.txt |
AC |
190 ms |
18792 KB |
01-24.txt |
AC |
17 ms |
4344 KB |
01-25.txt |
AC |
131 ms |
18796 KB |
01-26.txt |
AC |
11 ms |
3328 KB |
01-27.txt |
AC |
31 ms |
4216 KB |
01-28.txt |
AC |
119 ms |
12140 KB |
01-29.txt |
AC |
168 ms |
19436 KB |
01-30.txt |
AC |
178 ms |
19432 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |
sample-03.txt |
AC |
1 ms |
256 KB |