oj.uz

Submission #914472

# Submission time Handle Problem Language Result Execution time Memory
914472 2024-01-22T08:30:15 Z Amr Joker (BOI20_joker) C++14
0 / 100
 2000 ms 34100 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define S second
//#define F first
#define all(x) (x).begin(),(x).end()
#define sz size()
#define Yes cout << "YES" << endl
#define No cout << "NO" << endl
#define pb(x) push_back(x);
#define endl '\n'
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const int N=3e5+7;
ll INF=INT_MAX,mod=1e9+7;
int TT=1;
ll power(ll x, unsigned int y)
{
    ll res = 1;
    x = x; // % mod;
    if (x == 0) return 0;
    while (y > 0)
    {
        if (y & 1) res = (res*x)  ; // % mod;
        y = y>>1;
        x = (x*x) ; // % mod;
    }
    return res;
}
ll n , m , q;
pair<ll,ll> p[N];
pair<ll,ll>  a[N];
vector<vector<ll> > qe(N,vector<ll> (3));
ll ans[N];
ll siz[N];
ll cycles = 0;
vector<vector<ll>> roll;
ll sqr = 4;
bool cmp(vector<ll> x, vector<ll> y)
{
    if(x[0]/sqr==y[0]/sqr) return x[1] < y[1];
    return x[0]<y[0];
}
pair<ll,ll> get(ll x)
{
    if(p[x].first==x) return {x,0};
    pair<ll,ll> ho = get(p[x].first);
    return {ho.first, p[x].second^ho.second};
}
void nonmerge(vector<ll> v)
{
    ll x= v[0] , y = v[1] , b = v[2];
    if(b)
    {
    siz[y] -= siz[x];
    p[x] = {x,0};
    return;
    }
    else
    {
        pair<ll,ll> paix = get(x);
        pair<ll,ll> paiy = get(y);
        if(paix.second==paiy.second) cycles--;
    }
}
void merg(ll x, ll y)
{

    pair<ll,ll> paix = get(x);
    pair<ll,ll> paiy = get(y);
    if(paix.first==paiy.first)
    {
        if(paix.second==paiy.second) cycles++;
        roll.push_back({x,y,0});
    }
    else
    {
        ll xx = paix.first , yy = paiy.first;
        if(siz[xx]<siz[yy])
        {
            p[xx] = {yy,(paix.second==paiy.second)};
            roll.push_back({xx,yy,1});
        }
        else
        {
            p[yy] = {xx,(paix.second,paiy.second)};
            roll.push_back({yy,xx,1});
        }
    }
}
void solve()
{

    cin >> n >> m >> q;
    sqr = max(2LL,m/int(sqrt(q)));
    for(int i = 1; i <= n; i++) p[i] = {i,0};
    for(int i = 1; i <= m; i++) cin >> a[i].first >> a[i].second;
    for(int i = 1; i <= q; i++)
    {
        cin >> qe[i][0] >> qe[i][1];
        qe[i][2] = i;
    }
    sort(qe.begin()+1,qe.begin()+q+1,cmp);
    ll st = 0, en = m+1;
    for(int i = 1; i <= q; i++)
    {
        ll l = qe[i][0] , r = qe[i][1];
        while(roll.sz&&st>0)
        {
            //
            nonmerge(roll.back());
            roll.pop_back();
            st--;
        }

        while(roll.sz&&en<=r)
        {
            //
            nonmerge(roll.back());
            roll.pop_back();
            en++;
        }
        while(en>r+1)
        {
            en--;
            merg(a[en].first,a[en].second);
            // mege en
        }
        while(st<l-1)
        {
            st++;
            merg(a[st].first,a[st].second);
            // merge st;
        }
        if(cycles>0) ans[qe[i][2]] = bool(cycles);
    }
    for(int i = 1; i <= q; i++)
    {
        if(ans[i]) Yes; else No;
    }
}
int main(){
    //freopen("friday.in","r",stdin);
    //freopen("friday.out","w",stdout);
    fast;
    //cin >> TT;
    while(TT--)
        solve();

    return 0;
}

Compilation message

Joker.cpp: In function 'void merg(ll, ll)':
Joker.cpp:86:31: warning: left operand of comma operator has no effect [-Wunused-value]
   86 |             p[yy] = {xx,(paix.second,paiy.second)};
      |                          ~~~~~^~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 20824 KB Output is correct
2 Correct 18 ms 20828 KB Output is correct
3 Correct 15 ms 22876 KB Output is correct
4 Correct 15 ms 22876 KB Output is correct
5 Correct 14 ms 21080 KB Output is correct
6 Correct 15 ms 22876 KB Output is correct
7 Correct 15 ms 20828 KB Output is correct
8 Incorrect 17 ms 22876 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 20824 KB Output is correct
2 Correct 18 ms 20828 KB Output is correct
3 Correct 15 ms 22876 KB Output is correct
4 Correct 15 ms 22876 KB Output is correct
5 Correct 14 ms 21080 KB Output is correct
6 Correct 15 ms 22876 KB Output is correct
7 Correct 15 ms 20828 KB Output is correct
8 Incorrect 17 ms 22876 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 20824 KB Output is correct
2 Correct 18 ms 20828 KB Output is correct
3 Execution timed out 2016 ms 34100 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 20824 KB Output is correct
2 Correct 18 ms 20828 KB Output is correct
3 Correct 15 ms 22876 KB Output is correct
4 Correct 15 ms 22876 KB Output is correct
5 Correct 14 ms 21080 KB Output is correct
6 Correct 15 ms 22876 KB Output is correct
7 Correct 15 ms 20828 KB Output is correct
8 Incorrect 17 ms 22876 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 20824 KB Output is correct
2 Correct 18 ms 20828 KB Output is correct
3 Correct 15 ms 22876 KB Output is correct
4 Correct 15 ms 22876 KB Output is correct
5 Correct 14 ms 21080 KB Output is correct
6 Correct 15 ms 22876 KB Output is correct
7 Correct 15 ms 20828 KB Output is correct
8 Incorrect 17 ms 22876 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 20824 KB Output is correct
2 Correct 18 ms 20828 KB Output is correct
3 Correct 15 ms 22876 KB Output is correct
4 Correct 15 ms 22876 KB Output is correct
5 Correct 14 ms 21080 KB Output is correct
6 Correct 15 ms 22876 KB Output is correct
7 Correct 15 ms 20828 KB Output is correct
8 Incorrect 17 ms 22876 KB Output isn't correct
9 Halted 0 ms 0 KB -