# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677283 | dsyz | Solar Storm (NOI20_solarstorm) | C++17 | 619 ms | 221220 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>
using namespace std;
using ll = long long;
#define MAXN (1000005)
vector<ll> v[MAXN];
int parent[20][MAXN]; //(2^19 + 2^18 + 2^17 ... + 2^0) = (2^20 - 1) which is > 10^6
bool visited[MAXN];
void dfs(ll x){
visited[x] = 1;
for(auto u : v[x]){
if(!visited[u]){
parent[0][u] = x;
visited[u] = 1;
dfs(u);
}
}
}
ll fp(ll x,ll k){
for(ll i = 19;i >= 0;i--){
if(k >= (1<<i)){
if(x == -1) return -1;
x = parent[i][x];
k -= (1<<i);
}
}
return x;
}
int main() {
ios_base::sync_with_stdio(false);cin.tie(0);
ll N,S,K;
# | 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... |