# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093963 | simona1230 | Joker (BOI20_joker) | C++17 | 2057 ms | 18776 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;
int n,m,k;
pair<int,int> e[200001],q[200001];
void read()
{
cin>>n>>m>>k;
for(int i=1;i<=m;i++)
{
int x,y;
cin>>x>>y;
e[i]={x,y};
}
for(int i=1;i<=k;i++)
{
int l,r;
cin>>l>>r;
q[i]={l,r};
}
}
int used[200001];
vector<int> v[200001];
bool pos;
void dfs(int i)
{
for(int j=0;j<v[i].size();j++)
{
int nb=v[i][j];
if(!used[nb])
{
used[nb]=1;
if(used[i]==1)used[nb]=2;
dfs(nb);
}
else if(used[i]==used[nb])pos=0;
}
}
void slow()
{
for(int i=1;i<=k;i++)
{
pos=1;
for(int j=1;j<=n;j++)
{
used[j]=0;
v[j].clear();
}
for(int j=1;j<q[i].first;j++)
{
v[e[j].first].push_back(e[j].second);
v[e[j].second].push_back(e[j].first);
}
for(int j=q[i].second+1;j<=m;j++)
{
v[e[j].first].push_back(e[j].second);
v[e[j].second].push_back(e[j].first);
}
for(int j=1;j<=n;j++)
{
if(!used[j])
{
used[j]=1;
dfs(j);
}
}
if(pos)cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
read();
slow();
return 0;
}
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... |