제출 #930595

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
930595		UmairAhmadMirza	Joker (BOI20_joker)	C++17	14 / 100	2057 ms	120284 KiB

Joker

#include <bits/stdc++.h>
using namespace std;
int const N=2e5+5;
vector<int> adj[N];
bool dep[N];
int rep[N];
vector<int> com[N];
// int dp[N][N];
bool merge(int a,int b){
  int ra=a;
  int rb=b;
  a=rep[a];
  b=rep[b];
  // cout<<ra<<' '<<rb<<endl;
  if(a==b){
    if(dep[ra]==dep[rb])
      return 0;
    return 1;
  }
  if(com[a].size()>com[b].size()){
    swap(a,b);
    swap(ra,rb);
  }
  bool sw=0;
  if(dep[ra]==dep[rb])
    sw=1;
  for(auto i:com[a]){
    com[b].push_back(i);
    rep[i]=b;
    dep[i]^=sw;
  }
  com[a].clear();
  return 1;
}
int main() 
{
    int n,m,q;
    cin>>n>>m>>q;
    vector<pair<int,int>> edge;
    for(int i=0;i<m;i++){
      int a,b;
      cin>>a>>b;
      if(a>b)
        swap(a,b);
      edge.push_back({a,b});
    }
    // cout<<k<<endl;
    for(int i=0;i<q;i++){
      for(int i=1;i<=n;i++){
        rep[i]=i;
        com[i].clear();
        com[i].push_back(i);
      }
      int l,r;
      cin>>l>>r;
      l--;
      r--;
      string ans="NO";
      for(int i=0;i<m;i++){
        if(l<=i && i<=r)
          continue;
        if(merge(edge[i].first,edge[i].second)==0){
          ans="YES";
          break;
        }
      }
      cout<<ans<<endl;
    }
    return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 8 / 8
• Subtask 3: 0 / 25
• Subtask 4: 0 / 10
• Subtask 5: 0 / 22
• Subtask 6: 0 / 29