# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1061881 | nishkarsh | timeismoney (balkan11_timeismoney) | C++14 | 759 ms | 1380 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 vt vector
#define pb push_back
using namespace std;
int fastexp(int b, int e, int mod){
int ans = 1;
while(e){
if(e&1) ans = (1ll*ans*b)%mod;
b = (1ll*b*b)%mod;
e >>= 1;
}
return ans;
}
const int N = 1e4+1;
const int mod = 998244353;
const ll INFLL = 1e18;
const int INF = 2e9;
struct dsu{
int n, *p;
dsu(int _n){
n = _n;
p = new int[n];
for(int i = 0; i < n; i++) p[i] = -1;
}
int find(int u){
if(p[u] < 0) return u;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |