# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
854963 | parlimoos | Bitaro’s Party (JOI18_bitaro) | C++17 | 875 ms | 145688 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;
const int root = 100;
int n , m , q , r;
vector<int> g[100000];
vector<pair<int , int>> lps[100000];
int dels[100000];
int dis[100000];
int ddd[100000][2];
void init(){
for(int i = 0 ; i < n ; i++){
vector<int> exs;
lps[i].push_back({0 , i});
exs.push_back(i);
ddd[i][0] = 0;
ddd[i][1] = i + 1;
for(int v : g[i]){
for(pair<int , int> el : lps[v]){
if(ddd[el.second][1] != i + 1){
exs.push_back(el.second);
ddd[el.second][1] = i + 1;
ddd[el.second][0] = el.first + 1;
}else ddd[el.second][0] = max(ddd[el.second][0] , el.first + 1);
}
}
for(int el : exs){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |