#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;
template<class X, class Y>
inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int MAXN = 1000006;
int lab[MAXN];
set<int> S[MAXN];
vector<int> adj[MAXN], idx;
map<int, int> cnt[MAXN];
int p[MAXN], q[MAXN], cntBadComp, nArr, numQuery;
ll result;
int root(int u) {
return (lab[u] < 0) ? u : (lab[u] = root(lab[u]));
}
int getSize(int u) {
return -lab[root(u)];
}
bool isBadComp(int u) {
u = root(u);
for (auto it : S[u]) {
if(cnt[u][it] != 0)
return true;
}
return false;
}
bool checkFor(int u, int v) {
int sz = getSize(v), rv(root(v));
if(v <= u && v + sz > u || !isBadComp(v))
return false;
for (auto it : S[rv]) {
if(cnt[rv][it] != -cnt[u][it])
return false;
}
for (auto it : S[u]) {
if(cnt[u][it] != -cnt[rv][it])
return false;
}
return true;
}
ll calc(int u) {
u = root(u);
if(!isBadComp(u))
return 0;
ll res(0);
int v1(1);
while(v1 <= nArr) {
res += 1LL * getSize(v1) * (checkFor(u, v1));
v1 += getSize(v1);
}
return res;
}
void swapPos(int u, int v) {
int ru(root(u)), rv(root(v));
if(ru == rv) {
swap(p[u], p[v]);
return;
}
int szu(getSize(ru)), szv(getSize(rv));
result -= 1LL * szu * calc(ru) + 1LL * szv * calc(rv) - 1LL * szu * szv * checkFor(ru, rv);
--cnt[ru][p[u]], --cnt[rv][p[v]];
cntBadComp -= isBadComp(ru) + isBadComp(rv);
swap(p[u], p[v]);
++cnt[ru][p[u]], ++cnt[rv][p[v]];
S[ru].insert(p[u]), S[rv].insert(p[v]);
result += 1LL * szu * calc(ru) + 1LL * szv * calc(rv) - 1LL * szu * szv * checkFor(ru, rv);
cntBadComp += isBadComp(ru) + isBadComp(rv);
}
bool join(int u, int v) {
u = root(u), v = root(v);
if(u == v)
return (false);
if(lab[u] > lab[v])
swap(u, v);
result -= -1LL * lab[u] * calc(u) + -1LL * lab[v] * calc(v) - 1LL * lab[u] * lab[v] * checkFor(u, v);
//cout << u << ' ' << isBadComp(u) << ' ' << v << ' ' << isBadComp(v) << '\n';
cntBadComp -= isBadComp(u) + isBadComp(v);
lab[u] += lab[v];
lab[v] = u;
for (int it = 0; it < sz(adj[v]); ++it) {
int c(adj[v][it]);
adj[u].push_back(c);
++cnt[u][p[c]], --cnt[u][q[c]];
S[u].insert(p[c]);
S[u].insert(q[c]);
}
cntBadComp += isBadComp(u);
result += -1LL * lab[u] * calc(u);
adj[v].clear();
S[v].clear(), cnt[v].clear();
return (true);
}
void process() {
cin >> nArr >> numQuery;
for (int i = 1; i <= nArr; ++i) {
cin >> p[i];
idx.push_back(p[i]);
lab[i] = -1;
}
sort(idx.begin(), idx.end());
idx.erase(unique(idx.begin(), idx.end()), idx.end());
for (int i = 1; i <= nArr; ++i)
p[i] = q[i] = upper_bound(idx.begin(), idx.end(), p[i]) - idx.begin();
sort(q + 1, q + nArr + 1);
for (int i = 1; i <= nArr; ++i) {
cntBadComp += (p[i] != q[i]);
adj[i].push_back(i);
++cnt[i][p[i]], --cnt[i][q[i]];
S[i].insert(p[i]);
S[i].insert(q[i]);
result += calc(i);
}
for (int t = 0; t < numQuery; ++t) {
int type, A, B;
cin >> type;
if(type <= 2)
cin >> A >> B;
if(type == 1) {
swapPos(A, B);
} else
if(type == 2) {
join(A, B);
} else
if(type == 3) {
cout << (cntBadComp == 0 ? "DA" : "NE") << '\n';
} else {
cout << result << '\n';
}
}
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
process();
return 0;
}
Compilation message
zamjene.cpp: In function 'bool checkFor(int, int)':
zamjene.cpp:50:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
50 | if(v <= u && v + sz > u || !isBadComp(v))
| ~~~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
51 ms |
117708 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
51 ms |
117764 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
53 ms |
117792 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
53 ms |
117732 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
91 ms |
118000 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2604 ms |
121496 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6029 ms |
121612 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6072 ms |
127116 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6066 ms |
136456 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6056 ms |
135944 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
