# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
930550 | Faisal_Saqib | Joker (BOI20_joker) | C++17 | 2051 ms | 19132 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 M=2e5+1;
int n,m,q;
bool mark[M],vis[M];
int val[M];
vector<pair<int,int>> ma[M],query;
map<int,int> mx_r_for_l;
bool found=0;
void dfs(int x)
{
vis[x]=1;
for(auto [y,ind]:ma[x])
{
if(mark[ind])
continue;
if(!vis[y])
{
val[y]=(val[x]+1)%2;
dfs(y);
}
else if((val[y]+1)%2!=val[x])
{
found=1;
}
}
}
bool check(int l,int r)
{
// cout<<"Check "<<l<<' '<<r<<endl;
Compilation message (stderr)
# | 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... |