oj.uz

Submission #249762

# Submission time Handle Problem Language Result Execution time Memory
249762 2020-07-15T17:01:24 Z leaked Zamjene (COCI16_zamjene) C++14
140 / 140
 5731 ms 49688 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 {
#ifndef 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
//#define ull unsigned long long
typedef unsigned long long ull;
////////////////////////////////???????????????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 __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;
map<ull, int> mem;
//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;
ull s[N];
ull val[N];
int p[N],sz[N];
map<int,ll>vxr;
//ll ans=0;
int get_p(int u){
    if(u==p[u]) return u;
    else return p[u]=get_p(p[u]);
}
int a[N],b[N];
void delet(int xx,ll & ans){
    if(!s[xx]) return;
    ull inv=ull(0)-s[xx];
    mem[s[xx]]-=sz[xx];
    if(mem[s[xx]]==0) mem.erase(s[xx]);
    if(mem.find(inv)!=mem.end()) ans-=2ll*mem[inv]*sz[xx];
}
void add(int xx,ll &ans){
    if(!s[xx]) return;
    ull inv=ull(0)-s[xx];
    mem[s[xx]]+=sz[xx];
    if(mem.find(inv)!=mem.end()) ans+=2ll*mem[inv]*sz[xx];
}
signed main()
{
    fast_io;
    ///TODO :
    ll ans=0;
//    freopen("out.txt","w",stdout);
//    freopen("in.txt","r",stdin);
    auto rnd=bind(uniform_int_distribution<ll>(1,LLONG_MAX),mt19937(time(0)));
    cin>>n>>q;
    for(int i=0;i<n;i++){
        cin>>a[i];b[i]=a[i];
        sz[i]=1;
        p[i]=i;
        if(!vxr[a[i]]){
            vxr[a[i]]=rnd();
        }
    }
    sort(b,b+n);
    for(int i= 0;i < n; i++){
        s[i]=ull(vxr[a[i]]-vxr[b[i]]);
        if(s[i])mem[s[i]]++;
    }
    for(int i= 0;i < n; i++){
        if(mem.find(ull(0)-s[i])!=mem.end())ans+=mem[ull(0)-s[i]];
    }
    while(q--){
        int tp,c,d;
        cin>>tp;
        if(tp==1){
            cin>>c>>d;--c;--d;
            ull v1=vxr[a[c]],v2=vxr[a[d]];
            swap(a[c],a[d]);
            c=get_p(c),d=get_p(d);
            delet(c,ans);delet(d,ans);
            s[c]+=-v1+v2;
            s[d]+=v1-v2;
            add(c,ans);
            add(d,ans);
            mem.erase(0);

        }else if(tp==2){
            cin>>c>>d;--c;--d;
            c=get_p(c),d=get_p(d);
            if(c==d) continue;
            delet(c,ans);delet(d,ans);

            s[c]+=s[d];
            sz[c]+=sz[d];
            p[d]=c;
            add(c,ans);
            mem.erase(0);

        }else if(tp==3){
            cout<<(sz(mem) ? "NE" : "DA")<<endl;
        }else{
            cout<<abs(ans/2)<<endl;
        }
        //debug()<<imie(mem);
    }
    return 0;
}
/*
    2 0 2 0 1
*/

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
14.0 / 14.0

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

Subtask #4
14.0 / 14.0

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

Subtask #5
14.0 / 14.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 640 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 6 ms 768 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 3064 KB Output is correct
2 Correct 131 ms 3704 KB Output is correct
3 Correct 223 ms 4472 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1206 ms 16888 KB Output is correct
2 Correct 5003 ms 39120 KB Output is correct
3 Correct 5731 ms 45724 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2173 ms 35628 KB Output is correct
2 Correct 4557 ms 49688 KB Output is correct
3 Correct 1996 ms 47992 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1086 ms 29088 KB Output is correct
2 Correct 2474 ms 36268 KB Output is correct
3 Correct 2040 ms 48000 KB Output is correct