oj.uz

Submission #230566

# Submission time Handle Problem Language Result Execution time Memory
230566 2020-05-10T12:12:47 Z ne4eHbKa Praktični (COCI18_prakticni) C++17
130 / 130
 130 ms 13516 KB 
//{ <defines>
#include <bits/stdc++.h>
using namespace std;

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define ip2(x) (1 << (x))
#define lp2(x) (1ll << (x))
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 998244353;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = lp2(63 - __builtin_clzll(b)); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 1e5 + 5;

int n, m, f;
int x[N], y[N], w[N], xr[N], c[N], nm[N], p[N];
vi g[N];
bool mk[N];

int get(int i) {re p[i] == i ? i : p[i] = get(p[i]);}
void unite(int i, int j) {p[get(i)] = get(j);}

void rec(int v = 0, int pr = -1, int X = 0) {
    xr[v] = X;
    for(int i : g[v]) {
        int u = x[i] == v ? y[i] : x[i];
        if(u == pr) continue;
        rec(u, v, X ^ w[i]);
    }
}

void solve() {
    cin >> n >> m;
    fo(n) p[i] = i;
    fo(n) g[i].clear();
    fo(m) {
        cin >> x[i] >> y[i] >> w[i];
        --x[i], --y[i];
        mk[i] = false;
        if(get(x[i]) != get(y[i])) {
            mk[i] = true;
            unite(x[i], y[i]);
            g[x[i]].pb(i);
            g[y[i]].pb(i);
        }
    }
    rec();
    int f = 0;
    fo(m) if(!mk[i]) {
        c[f] = w[i] ^ xr[x[i]] ^ xr[y[i]];
        nm[f++] = i;
    }
    ve<vi> ans;
    for(int pw = 1 << 29; pw; pw >>= 1) {
        int e = -1;
        fo(f) if(c[i] & pw) e = c[i];
        if(e < 0) continue;
        ans.eb();
        ans.back().pb(e);
        vi u;
        fo(f) if(c[i] & pw) c[i] ^= e, u.pb(nm[i] + 1);
        ans.back().pb(sz(u));
        for(int i : u) ans.back().pb(i);
    }
    cout << sz(ans) << endl;
    for(vi &t : ans) {
        for(int i : t) cout << i << ' ';
        cout << '\n';
    }
}

int main() {
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
        cerr << test << " {\n";
        solve();
        cerr << "}\n\n";
    }
#else
    //freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 5624 KB Output is correct
2 Correct 42 ms 6144 KB Output is correct
3 Correct 11 ms 3328 KB Output is correct
4 Correct 12 ms 3456 KB Output is correct
5 Correct 100 ms 10488 KB Output is correct
6 Correct 89 ms 10104 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 3968 KB Output is correct
2 Correct 19 ms 4076 KB Output is correct
3 Correct 25 ms 4736 KB Output is correct
4 Correct 28 ms 4992 KB Output is correct
5 Correct 73 ms 7672 KB Output is correct
6 Correct 40 ms 6144 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 6884 KB Output is correct
2 Correct 61 ms 7672 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 8312 KB Output is correct
2 Correct 100 ms 11332 KB Output is correct
3 Correct 8 ms 2816 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 7416 KB Output is correct
2 Correct 73 ms 7928 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 9240 KB Output is correct
2 Correct 48 ms 6392 KB Output is correct

Subtask #7
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 9080 KB Output is correct
2 Correct 90 ms 10420 KB Output is correct
3 Correct 71 ms 7672 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 11640 KB Output is correct
2 Correct 130 ms 13516 KB Output is correct
3 Correct 122 ms 12260 KB Output is correct

Subtask #9
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 5248 KB Output is correct
2 Correct 40 ms 5752 KB Output is correct
3 Correct 80 ms 9208 KB Output is correct

Subtask #10
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 9720 KB Output is correct
2 Correct 55 ms 6904 KB Output is correct
3 Correct 112 ms 11504 KB Output is correct