# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967971 | owoovo | Binaria (CCO23_day1problem1) | C++17 | 265 ms | 38992 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<bits/stdc++.h>
#define ll long long
#define F first
#define S second
using namespace std;
const ll p=1e6+3;
struct Dsu{
int ori[1000010]={};
void init(int n){
for(int i=0;i<=n;i++)ori[i]=i;
}
int f(int a){
if(ori[a]==a)return a;
ori[a]=f(ori[a]);
return ori[a];
}
void onion(int a,int b){
a=f(a);
b=f(b);
ori[a]=b;
return ;
}
}dsu;
int n,k,x[1000010];
ll pre[1000010],erp[1000010];
ll inv(ll a){
return a==1?1:(p-p/a)*inv(p%a)%p;
}
ll c(ll a,ll b){
if(a<b)return 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |