# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
700950 | Farbod | Constellation 3 (JOI20_constellation3) | C++17 | 520 ms | 524288 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.
/*
* In the name of God
*
* Author: Farbod Doost
* Last Modified: Sun, 19 Feb 2023 (16:42:59)
*
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const long long inf = 1e18;
int pw[N];
int n, m, a[N], dp[N][20];
long long s[N], Ans = inf;
vector <pair <int, int>> adj[N];
vector <int> v;
int mx(int l, int r)
{
if (a[dp[l][pw[r - l + 1]]] > a[dp[r - (1 << pw[r - l + 1]) + 1][pw[r - l + 1]]])
return dp[l][pw[r - l + 1]];
return dp[r - (1 << pw[r - l + 1]) + 1][pw[r - l + 1]];
}
int mn(int i, int x)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |