/*
-
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
gp_hash_table<ll,int> cnt;
const int m=1e6+1,N=1e6+1;
const ll mod=8473968574039; //just a random large number
vector<int> par(N),siz(N,1),p,q;
vector<ll> pwr,hsh(N);
int n,qq;
ll ans4;
int ans3;
ll mul(ll a,ll b)
{
return a*b%mod;
}
ll add(ll a,ll b)
{
a+=b;
if(a>=mod)
a-=mod;
return a;
}
ll sub(ll a,ll b)
{
a-=b;
if(a<0)
a+=mod;
return a;
}
int find(int tr)
{
if(par[tr]==tr)
return tr;
return par[tr]=find(par[tr]);
}
void query(int a,int b,int t)
{
int pa=p[a],pb=p[b];
swap(p[a],p[b]);
a=find(a);
b=find(b);
if(a==b)
return;
cnt[hsh[a]]-=siz[a];
if(hsh[a]!=0)
ans4-=(ll)2*siz[a]*cnt[sub(0,hsh[a])],ans3--;
if(hsh[b]!=0)
ans4-=(ll)2*siz[b]*cnt[sub(0,hsh[b])],ans3--;
cnt[hsh[b]]-=siz[b];
if(t==1)
{
hsh[a]=sub(hsh[a],pwr[pa]);
hsh[a]=add(hsh[a],pwr[pb]);
hsh[b]=sub(hsh[b],pwr[pb]);
hsh[b]=add(hsh[b],pwr[pa]);
}
else
{
hsh[a]=add(hsh[a],hsh[b]);
siz[a]+=siz[b];
par[b]=a;
if(hsh[b]!=0)
cnt[hsh[b]]+=siz[b],ans4+=(ll)2*siz[b]*cnt[sub(0,hsh[b])],ans3++;
}
if(hsh[a]!=0)
cnt[hsh[a]]+=siz[a],ans4+=(ll)2*siz[a]*cnt[sub(0,hsh[a])],ans3++;
}
int main()
{
pwr.pb(1);
for(int i=0;i<N;i++)
par[i]=i,pwr.pb(mul(pwr.back(),m));
scanf("%i %i",&n,&qq);
p.resize(n);
for(int i=0;i<n;i++)
scanf("%i",&p[i]);
q=p;
sort(all(q));
for(int i=0;i<n;i++)
hsh[i]=add(hsh[i],pwr[p[i]]),hsh[i]=sub(hsh[i],pwr[q[i]]),cnt[hsh[i]]++;
for(int i=0;i<n;i++)
if(hsh[i]!=0)
ans4+=cnt[sub(0,hsh[i])],ans3++;
while(qq--)
{
int t,a,b;
scanf("%i",&t);
if(t==1)
scanf("%i %i",&a,&b),query(a-1,b-1,t);
if(t==2)
scanf("%i %i",&a,&b),query(a-1,b-1,t);
if(t==3)
printf(ans3==0?"DA\n":"NE\n");
if(t==4)
printf("%lld\n",ans4/2);
}
return 0;
}
Compilation message
zamjene.cpp: In function 'int main()':
zamjene.cpp:99:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i %i",&n,&qq);
~~~~~^~~~~~~~~~~~~~~~
zamjene.cpp:102:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i",&p[i]);
~~~~~^~~~~~~~~~~~
zamjene.cpp:113:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i",&t);
~~~~~^~~~~~~~~
zamjene.cpp:115:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i %i",&a,&b),query(a-1,b-1,t);
~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
zamjene.cpp:117:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i %i",&a,&b),query(a-1,b-1,t);
~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
37 ms |
24288 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
37 ms |
24288 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
37 ms |
24260 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
37 ms |
24336 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
37 ms |
24388 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
40 ms |
24288 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
86 ms |
25136 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
639 ms |
55104 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
936 ms |
114700 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
712 ms |
41348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
