题目详情提交记录（0）

挑战最长题解（178行）

userId_undefined
@三硝基苯酚
出道萌新循环·循环打卡人模拟·模拟练习生I/O·IO入门者

2025-08-26 21:11:16

发布于：浙江

33阅读
0回复
0点赞

热知识，杀鸡不用牛刀，要用水滴🙌

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <shared_mutex>
#include <any>
#include <charconv>
#include <filesystem>
#include <optional>
#include <memory_resource>
#include <string_view>
#include <variant>
#include <bit>
#include <version>
using namespace std;
struct node 
{
    int data,rev,sum;
    node *son[2],*pre;
    bool judge();
    bool isroot();
    void pushdown();
    void update();
    void setson(node *child,int lr);
}lct[233];
int top,a,b;
node *getnew(int x)
{
    node *now=lct+ ++top;
    now->data=x;
    now->pre=now->son[1]=now->son[0]=lct;
    now->sum=0;
    now->rev=0;
    return now;
}
bool node::judge(){return pre->son[1]==this;}
bool node::isroot()
{
    if(pre==lct)return true;
    return !(pre->son[1]==this||pre->son[0]==this);
}
void node::pushdown()
{
    if(this==lct||!rev)return;
    swap(son[0],son[1]);
    son[0]->rev^=1;
    son[1]->rev^=1;
    rev=0;
}
void node::update(){sum=son[1]->sum+son[0]->sum+data;}
void node::setson(node *child,int lr)
{
    this->pushdown();
    child->pre=this;
    son[lr]=child;
    this->update();
}
void rotate(node *now)
{
    node *father=now->pre,*grandfa=father->pre;
    if(!father->isroot()) grandfa->pushdown();
    father->pushdown();now->pushdown();
    int lr=now->judge();
    father->setson(now->son[lr^1],lr);
    if(father->isroot()) now->pre=grandfa;
    else grandfa->setson(now,father->judge());
    now->setson(father,lr^1);
    father->update();now->update();
    if(grandfa!=lct) grandfa->update();
}
void splay(node *now)
{
    if(now->isroot())return;
    for(;!now->isroot();rotate(now))
    if(!now->pre->isroot())
    now->judge()==now->pre->judge()?rotate(now->pre):rotate(now);
}
node *access(node *now)
{
    node *last=lct;
    for(;now!=lct;last=now,now=now->pre)
    {
        splay(now);
        now->setson(last,1);
    }
    return last;
}
void changeroot(node *now)
{
    access(now)->rev^=1;
    splay(now);
}
void connect(node *x,node *y)
{
    changeroot(x);
    x->pre=y;
    access(x);
}
void cut(node *x,node *y)
{
    changeroot(x);
    access(y);
    splay(x);
    x->pushdown();
    x->son[1]=y->pre=lct;
    x->update();
}
int query(node *x,node *y)
{
    changeroot(x);
    node *now=access(y);
    return now->sum;
}
int main()
{
    scanf("%d%d",&a,&b);
    node *A=getnew(a);
    node *B=getnew(b);
    //连边 Link
        connect(A,B);
    //断边 Cut
        cut(A,B);
    //再连边orz Link again
        connect(A,B);
    printf("%d\n",query(A,B)); 
    return 0;
}
userId_undefined
去预览
0/2000

全部评论 7

  • userId_undefined
    AC君
    时空双修者维度操控者进制转换师快排信徒→排序之神位操作忍者造物者

    菜就多练（2）
    x0000000000000001, 0x5000000000010002, 0x1000000000000002, 0xf000000000000000
    };
    /*
    0 Input
    1 Output
    2 Write
    3 Copy
    4 Calculate (& | ~ ^ << >>)
    5 Calculate (+ - * / %)
    6 Goto
    7 If-goto
    8 x++
    9 x--
    f Exit
    /
    signed main()
    {
    for(int i=0;;i=(i+1)%N)
    {
    int op=code[i]>>60;
    if(op0) //Input
    {
    int p=code[i]&65535;
    cin >> memory[ (code[i]>>56)&1 ? memory[p] : p ];
    }
    else if(op    1) //Output
    {
    int p=code[i]&65535, val = memory[ (code[i]>>56)&1 ? memory[p] : p ];
    if((code[i]>>57)&1)
    {
    cout<<char(val&127);
    }
    else
    {
    cout<<val;
    }
    }
    else if(op2) //Write
    {
    int p = (code[i]>>32)&65535, val = code[i]&((1ll<<32)-1);
    memory[ (code[i]>>56)&1 ? memory[p] : p ] = val;
    }
    else if(op    3) //Copy
    {
    int pf = (code[i]>>16)&65535, pt = code[i]&65535;
    int val = memory[ (code[i]>>55)&1 ? memory[pf] : pf ];
    memory[ (code[i]>>56)&1 ? memory[pt] : pt ] = val;
    }
    else if(op4) //Calculate (& | ~ ^ << >>)
    {
    int p1 = (code[i]>>32)&65535, p2 = (code[i]>>16)&65535, p3 = code[i]&65535;
    int val1 = memory[ (code[i]>>58)&1 ? memory[p1] : p1 ],
    val2 = memory[ (code[i]>>57)&1 ? memory[p2] : p2 ], val3;
    int op2 = (code[i]>>52)&15;
    if(op2    0)
    {
    val3=val1&val2;
    }
    else if(op21)
    {
    val3=val1|val2;
    }
    else if(op2    2)
    {
    val3=~val2;
    }
    else if(op23)
    {
    val3=val1^val2;
    }
    else if(op2    4)
    {
    val3=((val2>>6)?0:val1<<val2);
    }
    else
    {
    val3=((val2>>6)?0:val1>>val2);
    }
    memory[ (code[i]>>56)&1 ? memory[p3] : p3 ] = val3;
    }
    else if(op5) //Calculate (+ - * / %)
    {
    int p1 = (code[i]>>32)&65535, p2 = (code[i]>>16)&65535, p3 = code[i]&65535;
    int val1 = memory[ (code[i]>>58)&1 ? memory[p1] : p1 ],
    val2 = memory[ (code[i]>>57)&1 ? memory[p2] : p2 ], val3;
    int op2 = (code[i]>>52)&15;
    if(op2    0)
    {
    val3=val1+val2;
    }
    else if(op21)
    {
    val3=val1-val2;
    }
    else if(op2    2)
    {
    val3=val1    val2;
    }
    e

    2025-11-15 来自 浙江

    0
  • userId_undefined
    AC君
    时空双修者维度操控者进制转换师快排信徒→排序之神位操作忍者造物者

    菜就多练（1）
    #include<iostream>
    #include <algorithm>
    #include <math.h>
    #include <cmath>
    #include<string>
    #include<cstring>
    #include<list>
    #include<map>
    #include<queue>
    #include<iterator>
    #include<stack>
    #include<cstdio>
    #include <type_traits>
    #include <functional>
    #include <tuple>
    #include <random>
    #include <cstdint>
    #include <unistd.h>
    #include <vector>
    #include <sstream>
    #include <stdexcept>
    #include <memory>
    #include <numeric>
    #include<list>
    #include<map>
    #include<queue>
    #include<iterator>
    #include <cctype>
    #include <cerrno>
    #include <cfloat>
    #include <ciso646>
    #include <climits>
    #include <clocale>
    #include <cmath>
    #include <csetjmp>
    #include <csignal>
    #include <cstdarg>
    #include <cstddef>
    #include <cstdio>
    #include <cstdlib>
    #include <cstring>
    #include <ctime>
    #include <ccomplex>
    #include <cfenv>
    #include <cinttypes>
    #include <cstdalign>
    #include <cstdbool>
    #include <cstdint>
    #include <ctgmath>
    #include <cwchar>
    #include <cwctype>
    #include <algorithm>
    #include <bitset>
    #include <complex>
    #include <deque>
    #include <exception>
    #include <fstream>
    #include <functional>
    #include <iomanip>
    #include <ios>
    #include <iosfwd>
    #include <iostream>
    #include <istream>
    #include <iterator>
    #include <limits>
    #include <locale>
    #include <new>
    #include <numeric>
    #include <ostream>
    #include <queue>
    #include <set>
    #include <sstream>
    #include <stack>
    #include <stdexcept>
    #include <streambuf>
    #include <string>
    #include <typeinfo>
    #include <utility>
    #include <valarray>
    #include <vector>
    #include <array>
    #include <atomic>
    #include <chrono>
    #include <condition_variable>
    #include <forward_list>
    #include <future>
    #include <initializer_list>
    #include <mutex>
    #include <random>
    #include <ratio>
    #include <regex>
    #include <scoped_allocator>
    #include <system_error>
    #include <thread>
    #include <tuple>
    #include <typeindex>
    #include <type_traits>
    #include <unordered_map>
    using namespace std;
    #define int long long
    #define ull unsigned int
    #define N 65536
    int memory[N];
    ull code[N] = {
    0x0000000000000000, 0

    2025-11-15 来自 浙江

    0
  • userId_undefined
    G.T.I-蜂医🔪陈梓睿
    小有名气7月全勤卷王时空双修者倔强青铜

    你是怎么办到的？

    2025-10-12 来自 浙江

    0
  • userId_undefined
    古希腊掌管AC和WA的神
    8月全勤卷王出道萌新荣耀黄金时间刺客空间掌握者时空双修者

    %%%

    2025-10-07 来自 上海

    0
  • userId_undefined
    @三硝基苯酚
    出道萌新循环·循环打卡人模拟·模拟练习生I/O·IO入门者

    d

    2025-08-26 来自 浙江

    0
  • userId_undefined
    @三硝基苯酚
    出道萌新循环·循环打卡人模拟·模拟练习生I/O·IO入门者

    d

    2025-08-26 来自 浙江

    0
  • userId_undefined
    @三硝基苯酚
    出道萌新循环·循环打卡人模拟·模拟练习生I/O·IO入门者

    d

    2025-08-26 来自 浙江

    0
暂无数据

提交答案之后，这里将显示提交结果～

首页