oj.uz

Submission #139893

# Submission time Handle Problem Language Result Execution time Memory
139893 2019-08-01T15:39:05 Z stefdasca Zamjene (COCI16_zamjene) C++14
84 / 140
 5296 ms 141460 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007

using namespace std;

typedef long long ll;


int add(int a, int b)
{
    ll x = a+b;
    if(x >= mod)
        x -= mod;
    if(x < 0)
        x += mod;
    return x;
}
ll mul(ll a, ll b)
{
    return (a*b) % mod;
}
int n, q;
int v[1000002];
int st[1000002];
int tt[1000002], sz[1000002];
ll hsh[1000002], sthsh[1000002], pw[1000002];

map<ll, int> diff_nodes;
ll tot_pairs;

void add_nodes(int sgn, ll diff, int m)
{
    if(diff != 0)
        tot_pairs += sgn * m * diff_nodes[-diff];
    diff_nodes[diff] += sgn * m;
}
int Find(int a)
{
    if(tt[a] == a)
        return a;
    return tt[a] = Find(tt[a]);
}
void Union(int a, int b)
{
    add_nodes(-1, hsh[a] - sthsh[a], sz[a]);
    add_nodes(-1, hsh[b] - sthsh[b], sz[b]);
    if(sz[a] > sz[b])
    {
        tt[b] = a, sz[a] += sz[b];
        hsh[a] = hsh[a]+hsh[b];
        sthsh[a] = sthsh[a]+sthsh[b];
        add_nodes(1, hsh[a] - sthsh[a], sz[a]);
    }
    else
    {
        tt[a] = b, sz[b] += sz[a];
        hsh[b] = hsh[a]+hsh[b];
        sthsh[b] = sthsh[a]+sthsh[b];
        add_nodes(1, hsh[b] - sthsh[b], sz[b]);
    }

}
void add(int sgn, int u, int pos, int value)
{
  sthsh[u] += sgn * pw[pos];
  hsh[u] += sgn * pw[value];
  sz[u] += sgn;
}
void swp(int a, int b)
{
    int u = Find(a);
    int vv = Find(b);
    add_nodes(-1, hsh[u] - sthsh[u], sz[u]);
    add_nodes(-1, hsh[vv] - sthsh[vv], sz[vv]);
    add(-1, Find(a), a, v[a]);
    add(-1, Find(b), b, v[b]);

    swap(v[a], v[b]);

    add(1, Find(a), a, v[a]);
    add(1, Find(b), b, v[b]);
    add_nodes(1, hsh[u] - sthsh[u], sz[u]);
    add_nodes(1, hsh[vv] - sthsh[vv], sz[vv]);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> q;
    pw[0] = 1;
    for(int i = 1; i <= 1000000; ++i)
        pw[i] = mul(pw[i-1], 1000003);
    for(int i = 1; i <= n; ++i)
    {
        cin >> v[i];
        st[i] = v[i];
        tt[i] = i;
        sz[i] = 1;
    }
    sort(st + 1, st + n + 1);
    for(int i = 1; i <= n; ++i)
    {
        hsh[i] = pw[v[i]];
        sthsh[i] = pw[st[i]];
        add_nodes(1, hsh[i] - sthsh[i], sz[i]);
    }
    for(int i = 1; i <= q; ++i)
    {
        int tip;
        cin >> tip;
        if(tip == 1)
        {
            int a, b;
            cin >> a >> b;
            if(Find(a) == Find(b))
            {
                swap(v[a], v[b]);
                continue;
            }
            swp(a, b);
        }
        if(tip == 2)
        {
            int a, b;
            cin >> a >> b;
            if(Find(a) != Find(b))
                Union(Find(a), Find(b));
        }
        if(tip == 3)
        {
            if(diff_nodes[0] == n)
                cout << "DA\n";
            else
                cout << "NE\n";
        }
        if(tip == 4)
        {
            cout << tot_pairs << '\n';
        }
    }
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8312 KB Output is correct
2 Correct 15 ms 8312 KB Output is correct
3 Correct 14 ms 8184 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8284 KB Output is correct
2 Correct 14 ms 8184 KB Output is correct
3 Correct 14 ms 8184 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 8184 KB Output is correct
2 Correct 15 ms 8300 KB Output is correct
3 Correct 15 ms 8444 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8184 KB Output is correct
2 Correct 14 ms 8312 KB Output is correct
3 Correct 15 ms 8440 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8184 KB Output is correct
2 Correct 15 ms 8312 KB Output is correct
3 Correct 15 ms 8304 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 8696 KB Output is correct
2 Correct 20 ms 8696 KB Output is correct
3 Correct 23 ms 8824 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 12408 KB Output is correct
2 Correct 127 ms 14584 KB Output is correct
3 Incorrect 215 ms 17784 KB Output isn't correct

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1506 ms 40528 KB Output is correct
2 Incorrect 5296 ms 141460 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2718 ms 81824 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1204 ms 47688 KB Output is correct
2 Incorrect 3207 ms 97872 KB Output isn't correct
3 Halted 0 ms 0 KB -