oj.uz

Submission #96785

# Submission time Handle Problem Language Result Execution time Memory
96785 2019-02-12T02:19:59 Z tieunhi Zamjene (COCI16_zamjene) C++14
84 / 140
 5733 ms 182008 KB 
#include <bits/stdc++.h>
#define FOR(i, u, v) for (int i = u; i <= v; i++)
#define FORD(i, v, u) for (int i = v; i >= u; i--)
#define ll long long
#define pill pair<int, ll>
#define PB push_back
#define mp make_pair
#define F first
#define S second
#define N 1000005
#define BASE 107
#define maxc 1000000007
#define mid (r + l)/2

using namespace std;

int n, numQ, a[N], b[N], sz[N], numCC, cc, root[N];
ll val[2][N], ansType4, base[N];
map<ll, int> ma;

int readInt ()
{
	bool minus = false;
	int result = 0;
	char ch;
	ch = getchar();
	while (true) {
		if (ch == '-') break;
		if (ch >= '0' && ch <= '9') break;
		ch = getchar();
	}
	if (ch == '-') minus = true; else result = ch-'0';
	while (true) {
		ch = getchar();
		if (ch < '0' || ch > '9') break;
		result = result*10 + (ch - '0');
	}
	if (minus)
		return -result;
	else
		return result;
}
void setup()
{
    n = readInt(); numQ = readInt(); cc = n;
    FOR(i, 1, n) a[i] = readInt(), b[i] = a[i];
}
void subcc(int u)
{
    ll Val = val[0][u] - val[1][u];
    if (Val == 0)
    {
        numCC--;
        return;
    }
    ansType4 -= 1ll*sz[u]*ma[-Val];
    ma[Val] -= sz[u];
}
void addcc(int u)
{
    ll Val = val[0][u] - val[1][u];
    if (Val == 0)
    {
        numCC++;
        return;
    }
    ansType4 += 1ll*sz[u]*ma[-Val];
    ma[Val] += sz[u];

}
void prepare()
{
    sort(b+1, b+n+1);
    base[0] = 1;
    FOR(i, 1, N-1) base[i] = base[i-1]*BASE;
    FOR(i, 1, n)
    {
        sz[i] = 1;
        val[0][i] = base[a[i]];
        val[1][i] = base[b[i]];
        addcc(i);
    }
}
int get_root(int u)
{
    return (root[u] == 0) ? u : root[u] = get_root(root[u]);
}
void inline add(ll &A, ll B) {A += B;}
void inline sub(ll &A, ll B) {A -= B;}

int main()
{
    ios_base::sync_with_stdio(0); cout.tie(0);
    //freopen("INP.TXT", "r", stdin);
    //freopen("OUT.TXT", "w", stdout);
    setup();
    prepare();
    while (numQ--)
    {
        int type, u, v; type = readInt();
        if (type <= 2) u = readInt(), v = readInt();
        if (type == 1)
        {
            int p = get_root(u);
            int q = get_root(v);
            if (p == q) continue;

            subcc(p); subcc(q);
            add(val[0][p], base[a[v]]);
            add(val[0][q], base[a[u]]);
            sub(val[0][p], base[a[u]]);
            sub(val[0][q], base[a[v]]);
            swap(a[u], a[v]);
            addcc(p); addcc(q);
        }
        else if (type == 2)
        {
            int p = get_root(u);
            int q = get_root(v);
            if (p == q) continue;

            subcc(p); subcc(q);
            root[q] = p; sz[p] += sz[q];
            add(val[0][p], val[0][q]);
            add(val[1][p], val[1][q]);
            cc--;
            addcc(p);
        }
        else if (type == 3)
        {
            if (cc == numCC) cout <<"DA\n";
            else cout <<"NE\n";
        }
        else cout <<ansType4<<'\n';
    }
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 14.0

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

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8184 KB Output is correct
2 Correct 8 ms 8304 KB Output is correct
3 Correct 9 ms 8312 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 8696 KB Output is correct
2 Correct 12 ms 8696 KB Output is correct
3 Correct 13 ms 8696 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 11896 KB Output is correct
2 Correct 90 ms 13432 KB Output is correct
3 Correct 186 ms 16672 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1147 ms 40108 KB Output is correct
2 Correct 5302 ms 130788 KB Output is correct
3 Correct 5733 ms 182008 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2203 ms 81272 KB Output is correct
2 Correct 4120 ms 102340 KB Output is correct
3 Correct 1487 ms 89996 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 846 ms 47172 KB Output is correct
2 Correct 3008 ms 86264 KB Output is correct
3 Correct 1900 ms 89920 KB Output is correct