Submission #343487

#	Time	Username	Problem	Language	Result	Execution time	Memory
343487		leinad2	The Potion of Great Power (CEOI20_potion)	C++17	0 / 100	177 ms	103020 KiB

potion

#include<bits/stdc++.h>
using namespace std;
int n, d, H[10010], i, j, u, A[10010], B[10010], b, x, a;
set<int>adj[10010][105], F[10010], X;
set<int>::iterator it, it2;
void init(int N, int D, int HH[])
{
    n=N;
    d=D;
    for(i=0;i<n;i++)H[i]=HH[i];
}
void curseChanges(int U, int C[], int D[])
{
    u=U;
    for(i=0;i++<u;)A[i]=C[i-1],B[i]=D[i-1];
    b=(int)round(sqrt(u));
    for(i=0;i++<u;)
    {
        if(F[B[i]].find(A[i])==F[B[i]].end())
        {
            F[A[i]].insert(B[i]);
            F[B[i]].insert(A[i]);
        }
        else
        {
            F[A[i]].erase(B[i]);
            F[B[i]].erase(A[i]);
        }
        if(i%b==0)
        {
            for(j=0;j<n;j++)
            {
                for(it=F[j].begin();it!=F[j].end();it++)
                {
                    adj[j][i/b].insert(*it);
                }
            }
        }
    }
}
int question(int s, int e, int v)
{
    x=v/b;
    if(x<n/b&&v-b*x>b*(x+1)-v)
    {
        x++;
        for(i=b*x;i>v;i--)
        {
            if(adj[B[i]][x].find(A[i])==adj[B[i]][x].end())
            {
                adj[A[i]][x].insert(B[i]);
                adj[B[i]][x].insert(A[i]);
            }
            else
            {
                adj[A[i]][x].erase(B[i]);
                adj[B[i]][x].erase(A[i]);
            }
        }
    }
    else
    {
        for(i=b*x+1;i<=v;i++)
        {
            if(adj[B[i]][x].find(A[i])==adj[B[i]][x].end())
            {
                adj[A[i]][x].insert(B[i]);
                adj[B[i]][x].insert(A[i]);
            }
            else
            {
                adj[A[i]][x].erase(B[i]);
                adj[B[i]][x].erase(A[i]);
            }
        }
    }
    int ans=1e9;
    if(adj[s][x].size()==0||adj[e][x].size()==0)
    {
        goto w;
    }
    X.clear();
    for(it=adj[s][x].begin();it!=adj[s][x].end();it++)
    {
        X.insert(H[*it]);
    }
    for(it=adj[e][x].begin();it!=adj[e][x].end();it++)
    {
        it2=X.lower_bound(H[*it]);
        if(it2==X.end())it2--;
        ans=min(ans, abs(H[*it]-*it2));
        if(it2==X.begin())continue;
        it2--;
        ans=min(ans, abs(H[*it]-*it2));
    }
    w:;
    if(b*x>=v)
    {
        x++;
        for(i=b*x;i>v;i--)
        {
            if(adj[B[i]][x].find(A[i])==adj[B[i]][x].end())
            {
                adj[A[i]][x].insert(B[i]);
                adj[B[i]][x].insert(A[i]);
            }
            else
            {
                adj[A[i]][x].erase(B[i]);
                adj[B[i]][x].erase(A[i]);
            }
        }
    }
    else
    {
        for(i=v;i>b*x;i--)
        {
            if(adj[B[i]][x].find(A[i])==adj[B[i]][x].end())
            {
                adj[A[i]][x].insert(B[i]);
                adj[B[i]][x].insert(A[i]);
            }
            else
            {
                adj[A[i]][x].erase(B[i]);
                adj[B[i]][x].erase(A[i]);
            }
        }
    }
    return ans;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 17
• Subtask 3: 0 / 14
• Subtask 4: 0 / 18
• Subtask 5: 0 / 21
• Subtask 6: 0 / 30