# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642416 | berr | Joker (BOI20_joker) | C++17 | 2087 ms | 31768 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;
#define int long long
int n, m, q, flag;
vector<array<int, 2>> adj[(int)3e5], check((int)3e5);
vector<int> val((int)3e5, 1e18), vis((int)(3e5), -1);
void dfs(int p, int x, int y, int z, int par)
{
vis[p]=z%2;
if(y<x) swap(x, y);
for(auto i: adj[p])
{
if(i[1]>=x&&i[1]<=y) continue;
if(i[0]==par) continue;
if(vis[i[0]]==-1) dfs(i[0], x, y, z+1, p);
else if(vis[i[0]]!=-1&&(z+vis[i[0]]+1)%2==1) flag=1;
}
}
int bs(int pos)
{
int s=pos;
for(int i=15; i>=0; i--)
{
if(s+(1<<i)<=m)
{
int tmp=(s+(1<<i));
# | 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... |