# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
847201 | Pacybwoah | Palindromi (COCI22_palindromi) | C++17 | 1038 ms | 4520 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<algorithm>
#include<vector>
#include<utility>
#include<set>
#include<string>
using namespace std;
#define ll long long
vector<int> dsu;
const ll mod=998244353;
vector<string> vec;
void build(int n){
dsu.resize(n+1);
for(int i=1;i<=n;i++) dsu[i]=i;
}
int query(int x){
if(x==dsu[x]) return x;
int tmp=query(dsu[x]);
dsu[x]=tmp;
return tmp;
}
void unite(int a,int b){
a=query(a),b=query(b);
if(a==b) return;
vec[a]+=vec[b];
dsu[b]=a;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
# | 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... |