| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1347328 | qs1 | Magija (COCI26_magija) | C++20 | 1070 ms | 4064 KiB |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
lli f(lli x,vector<lli>v){
lli a=v[x];
if(x!=a){
v[x]=f(a,v);
}
return v[x];
}
int main(){
lli x,y,a,b,c,an,bn,am,bm;
cin>>x>>y;
vector<lli>va(x),vb(x);
for(lli i=0;i<x;i++){
va[i]=vb[i]=i;
}
while(y--){
cin>>a;
if(a==1){
cin>>a;
a--;
cout<<f(a,va)+1<<" "<<f(a,vb)+1<<endl;
}
else{
cin>>a>>b>>c;
a-=2;
b-=2;
while(c--){
a++;
b++;
an=f(a,va);
bn=f(b,va);
if(an!=bn){
am=f(a,vb);
bm=f(b,vb);
va[an]=min(va[an],va[bn]);
va[bn]=min(va[an],va[bn]);
vb[am]=max(vb[am],vb[bm]);
vb[bm]=max(vb[am],vb[bm]);
}
}
}
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
