| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 249640 |
2020-07-15T12:58:09 Z |
leaked |
Zamjene (COCI16_zamjene) |
C++14 |
|
1544 ms |
50808 KB |
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
////
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("-O3")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace (32-__gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
void binary(ll val,int to) {for(int i=0;i<to;i++) cerr<<(pw(i) & val ? 1 : 0); cerr<<endl;}
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const char o[4]={'S','P','R'};
const int N=1e6+3;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
void bad(){
cout<<-1;
exit(0);
}
int n,q;
struct snm{
ll xr1,xr2;int p,sz;
};
vector<snm>v(N);
map<int,ll>vxr;
map<ll,ll>mp;
ll ans=0;
int get_p(int u){
if(u==v[u].p) return u;
else return v[u].p=get_p(v[u].p);
}
void del(int ra,int rb){
if(((v[ra].xr1^v[ra].xr2)^(v[rb].xr1^v[rb].xr2))){
if(v[ra].xr1^v[ra].xr2)ans-=2ll*v[ra].sz*(mp[v[ra].xr1^v[ra].xr2]-v[ra].sz);
if(v[rb].xr1^v[rb].xr2)ans-=2ll*v[rb].sz*(mp[v[rb].xr1^v[rb].xr2]-v[rb].sz);
mp[v[ra].xr1^v[ra].xr2]-=v[ra].sz;
mp[v[rb].xr1^v[rb].xr2]-=v[rb].sz;
}
else{
if(v[ra].xr1^v[ra].xr2)ans-=2ll*v[ra].sz*(mp[v[ra].xr1^v[ra].xr2]-v[ra].sz);
mp[v[ra].xr1^v[ra].xr2]-=v[ra].sz;
if(v[rb].xr1^v[rb].xr2)ans-=2ll*v[rb].sz*(mp[v[rb].xr1^v[rb].xr2]-v[rb].sz);
mp[v[rb].xr1^v[rb].xr2]-=v[rb].sz;
}
}
void add(int ra,int rb){
if((v[ra].xr1^v[ra].xr2)^(v[rb].xr1^v[rb].xr2)){
mp[v[ra].xr1^v[ra].xr2]+=v[ra].sz;
mp[v[rb].xr1^v[rb].xr2]+=v[rb].sz;
mp[0]=0;
if(v[ra].xr1^v[ra].xr2)ans+=2ll*v[ra].sz*(mp[v[ra].xr1^v[ra].xr2]-v[ra].sz);
if(v[rb].xr1^v[rb].xr2)ans+=2ll*v[rb].sz*(mp[v[rb].xr1^v[rb].xr2]-v[rb].sz);
}
else{
mp[v[ra].xr1^v[ra].xr2]+=v[ra].sz;
if(v[ra].xr1^v[ra].xr2)ans+=2ll*v[ra].sz*(mp[v[ra].xr1^v[ra].xr2]-v[ra].sz);
mp[v[rb].xr1^v[rb].xr2]+=v[rb].sz;
if(v[rb].xr1^v[rb].xr2)ans+=2ll*v[rb].sz*(mp[v[rb].xr1^v[rb].xr2]-v[rb].sz);
}
}
void mg(int a,int b){
int ra=get_p(a),rb=get_p(b);
if(ra==rb) return;
del(ra,rb);
v[rb].xr1^=v[ra].xr1;
v[rb].xr2^=v[ra].xr2;
v[rb].sz+=v[ra].sz;
if(v[rb].xr1^v[rb].xr2){
mp[v[rb].xr1^v[rb].xr2]+=v[rb].sz;
ans+=2ll*v[rb].sz*(mp[v[rb].xr1^v[rb].xr2]-v[rb].sz);
}
debug()<<imie(v[rb].xr1^v[rb].xr2)<<' ';
debug()<<imie(ans);
mp[0]=0;
v[ra].p=rb;
}
int a[N],b[N];
void z1(int c,int d){
int ra=get_p(c),rb=get_p(d);
if(ra==rb) return ;
else{
ll val1=vxr[a[c]],val2=vxr[a[d]];
del(ra,rb);
debug()<<imie(ans);
v[ra].xr1^=val1;
v[ra].xr1^=val2;
v[rb].xr1^=val2;
v[rb].xr1^=val1;
add(ra,rb);
mp[0]=0;
swap(a[c],a[d]);
debug()<<imie(ans);
}
}
void z2(int a,int b){
mg(a,b);
}
bool z3(){
return ans==0;
}
ll z4(){
return ans;
}
map<ll,int>used;
signed main()
{
fast_io;
///TODO :
auto rnd=bind(uniform_int_distribution<ll>(1,LLONG_MAX),mt19937(time(0)));
cin>>n>>q;
v.resize(n);
ll cur=rnd();
for(int i=0;i<n;i++){
cin>>a[i];
if(!vxr[a[i]]){
while(used[cur]){
cur=rnd();
}
vxr[a[i]]=cur;
used[cur]=a[i];
}
v[i].p=i;
v[i].sz=1;
v[i].xr1=vxr[a[i]];
}
memcpy(b,a,sizeof(a));
sort(b,b+n);
for(int i=0;i<n;i++){
v[i].xr2=vxr[b[i]];
// mp[0]=0;
//cout<<(v[i].xr2^v[i].xr1)<<' ';
if(v[i].xr2^v[i].xr1) mp[v[i].xr2^v[i].xr1]++;
}
for(int i=0;i<n;i++){
if(v[i].xr2^v[i].xr1)ans+=mp[v[i].xr2^v[i].xr1]-1;
}
while(q--){
int tp,c,d;
cin>>tp;
///mp[0]=0;
// cout<<ans<<endl;
debug()<<imie(ans);
if(tp==1){
cin>>c>>d;--c;--d;
z1(c,d);
}
else if(tp==2){
cin>>c>>d;--c;--d;
z2(c,d);
}
else if(tp==3){
cout<<(z3() ? "DA" : "NE")<<endl;
}
else{
cout<<z4()/2<<endl;
}
//debug()<<imie(ans);
}
return 0;
}
/*
2 0 2 0 1
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
17 ms |
27776 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
18 ms |
27776 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
17 ms |
27768 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
16 ms |
27776 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
17 ms |
27776 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
21 ms |
27904 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
64 ms |
28536 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
681 ms |
33124 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1544 ms |
50808 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
743 ms |
35244 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
