oj.uz

답안 #914485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
914485 2024-01-22T09:05:10 Z Amr Joker (BOI20_joker) C++14
14 / 100
 2000 ms 36604 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))); sqr = 3;
    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);
          //  cout << cycles << endl;
            // merge st;
        }
        //cout << endl;
        //for(int i = 1; i <= n; i++) cout << p[i].first << " " << p[i].second << endl;
        //cout << l << " " << r << ": " << st << " " << en<< " " << cycles  << endl;
         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;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 22872 KB Output is correct
2 Correct 16 ms 22872 KB Output is correct
3 Correct 17 ms 22876 KB Output is correct
4 Correct 16 ms 23288 KB Output is correct
5 Correct 18 ms 22872 KB Output is correct
6 Correct 15 ms 22876 KB Output is correct
7 Correct 15 ms 22872 KB Output is correct
8 Correct 16 ms 22876 KB Output is correct
9 Correct 16 ms 22876 KB Output is correct
10 Correct 18 ms 22876 KB Output is correct
11 Correct 16 ms 22988 KB Output is correct
12 Correct 17 ms 22876 KB Output is correct
13 Correct 18 ms 23052 KB Output is correct
14 Correct 17 ms 22872 KB Output is correct
15 Correct 17 ms 22876 KB Output is correct
16 Correct 17 ms 23128 KB Output is correct
17 Correct 17 ms 22872 KB Output is correct
18 Correct 17 ms 22876 KB Output is correct
19 Correct 18 ms 22876 KB Output is correct
20 Correct 18 ms 22876 KB Output is correct
21 Correct 24 ms 22872 KB Output is correct
22 Correct 19 ms 22876 KB Output is correct
23 Correct 18 ms 22876 KB Output is correct
24 Correct 18 ms 22872 KB Output is correct
25 Correct 16 ms 22876 KB Output is correct
26 Correct 17 ms 22876 KB Output is correct
27 Correct 18 ms 22920 KB Output is correct
28 Correct 16 ms 22876 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 22872 KB Output is correct
2 Correct 16 ms 22872 KB Output is correct
3 Correct 17 ms 22876 KB Output is correct
4 Correct 16 ms 23288 KB Output is correct
5 Correct 18 ms 22872 KB Output is correct
6 Correct 15 ms 22876 KB Output is correct
7 Correct 15 ms 22872 KB Output is correct
8 Correct 16 ms 22876 KB Output is correct
9 Correct 16 ms 22876 KB Output is correct
10 Correct 18 ms 22876 KB Output is correct
11 Correct 16 ms 22988 KB Output is correct
12 Correct 17 ms 22876 KB Output is correct
13 Correct 18 ms 23052 KB Output is correct
14 Correct 17 ms 22872 KB Output is correct
15 Correct 17 ms 22876 KB Output is correct
16 Correct 17 ms 23128 KB Output is correct
17 Correct 17 ms 22872 KB Output is correct
18 Correct 17 ms 22876 KB Output is correct
19 Correct 18 ms 22876 KB Output is correct
20 Correct 18 ms 22876 KB Output is correct
21 Correct 24 ms 22872 KB Output is correct
22 Correct 19 ms 22876 KB Output is correct
23 Correct 18 ms 22876 KB Output is correct
24 Correct 18 ms 22872 KB Output is correct
25 Correct 16 ms 22876 KB Output is correct
26 Correct 17 ms 22876 KB Output is correct
27 Correct 18 ms 22920 KB Output is correct
28 Correct 16 ms 22876 KB Output is correct
29 Correct 63 ms 23132 KB Output is correct
30 Correct 189 ms 23208 KB Output is correct
31 Correct 483 ms 23132 KB Output is correct
32 Correct 773 ms 23132 KB Output is correct
33 Correct 982 ms 23380 KB Output is correct
34 Correct 288 ms 23204 KB Output is correct
35 Correct 312 ms 23216 KB Output is correct
36 Correct 1878 ms 23128 KB Output is correct
37 Correct 114 ms 23132 KB Output is correct
38 Correct 117 ms 23212 KB Output is correct
39 Correct 339 ms 23212 KB Output is correct
40 Correct 695 ms 23208 KB Output is correct
41 Correct 617 ms 23204 KB Output is correct
42 Correct 610 ms 23216 KB Output is correct
43 Correct 1368 ms 23196 KB Output is correct
44 Correct 1563 ms 23204 KB Output is correct
45 Correct 1145 ms 23380 KB Output is correct
46 Correct 799 ms 23132 KB Output is correct
47 Correct 914 ms 23208 KB Output is correct
48 Correct 419 ms 23212 KB Output is correct
49 Correct 363 ms 23208 KB Output is correct
50 Correct 303 ms 23124 KB Output is correct
51 Correct 989 ms 23196 KB Output is correct
52 Correct 854 ms 23200 KB Output is correct
53 Correct 608 ms 23224 KB Output is correct
54 Correct 298 ms 23132 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 22872 KB Output is correct
2 Correct 16 ms 22872 KB Output is correct
3 Execution timed out 2029 ms 31460 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 22872 KB Output is correct
2 Correct 16 ms 22872 KB Output is correct
3 Correct 17 ms 22876 KB Output is correct
4 Correct 16 ms 23288 KB Output is correct
5 Correct 18 ms 22872 KB Output is correct
6 Correct 15 ms 22876 KB Output is correct
7 Correct 15 ms 22872 KB Output is correct
8 Correct 16 ms 22876 KB Output is correct
9 Correct 16 ms 22876 KB Output is correct
10 Correct 18 ms 22876 KB Output is correct
11 Correct 16 ms 22988 KB Output is correct
12 Correct 17 ms 22876 KB Output is correct
13 Correct 18 ms 23052 KB Output is correct
14 Correct 17 ms 22872 KB Output is correct
15 Correct 17 ms 22876 KB Output is correct
16 Correct 17 ms 23128 KB Output is correct
17 Correct 17 ms 22872 KB Output is correct
18 Correct 17 ms 22876 KB Output is correct
19 Correct 18 ms 22876 KB Output is correct
20 Correct 18 ms 22876 KB Output is correct
21 Correct 24 ms 22872 KB Output is correct
22 Correct 19 ms 22876 KB Output is correct
23 Correct 18 ms 22876 KB Output is correct
24 Correct 18 ms 22872 KB Output is correct
25 Correct 16 ms 22876 KB Output is correct
26 Correct 17 ms 22876 KB Output is correct
27 Correct 18 ms 22920 KB Output is correct
28 Correct 16 ms 22876 KB Output is correct
29 Execution timed out 2029 ms 31460 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 22872 KB Output is correct
2 Correct 16 ms 22872 KB Output is correct
3 Correct 17 ms 22876 KB Output is correct
4 Correct 16 ms 23288 KB Output is correct
5 Correct 18 ms 22872 KB Output is correct
6 Correct 15 ms 22876 KB Output is correct
7 Correct 15 ms 22872 KB Output is correct
8 Correct 16 ms 22876 KB Output is correct
9 Correct 16 ms 22876 KB Output is correct
10 Correct 18 ms 22876 KB Output is correct
11 Correct 16 ms 22988 KB Output is correct
12 Correct 17 ms 22876 KB Output is correct
13 Correct 18 ms 23052 KB Output is correct
14 Correct 17 ms 22872 KB Output is correct
15 Correct 17 ms 22876 KB Output is correct
16 Correct 17 ms 23128 KB Output is correct
17 Correct 17 ms 22872 KB Output is correct
18 Correct 17 ms 22876 KB Output is correct
19 Correct 18 ms 22876 KB Output is correct
20 Correct 18 ms 22876 KB Output is correct
21 Correct 24 ms 22872 KB Output is correct
22 Correct 19 ms 22876 KB Output is correct
23 Correct 18 ms 22876 KB Output is correct
24 Correct 18 ms 22872 KB Output is correct
25 Correct 16 ms 22876 KB Output is correct
26 Correct 17 ms 22876 KB Output is correct
27 Correct 18 ms 22920 KB Output is correct
28 Correct 16 ms 22876 KB Output is correct
29 Correct 63 ms 23132 KB Output is correct
30 Correct 189 ms 23208 KB Output is correct
31 Correct 483 ms 23132 KB Output is correct
32 Correct 773 ms 23132 KB Output is correct
33 Correct 982 ms 23380 KB Output is correct
34 Correct 288 ms 23204 KB Output is correct
35 Correct 312 ms 23216 KB Output is correct
36 Correct 1878 ms 23128 KB Output is correct
37 Correct 114 ms 23132 KB Output is correct
38 Correct 117 ms 23212 KB Output is correct
39 Correct 339 ms 23212 KB Output is correct
40 Correct 695 ms 23208 KB Output is correct
41 Correct 617 ms 23204 KB Output is correct
42 Correct 610 ms 23216 KB Output is correct
43 Correct 1368 ms 23196 KB Output is correct
44 Correct 1563 ms 23204 KB Output is correct
45 Correct 1145 ms 23380 KB Output is correct
46 Correct 799 ms 23132 KB Output is correct
47 Correct 914 ms 23208 KB Output is correct
48 Correct 419 ms 23212 KB Output is correct
49 Correct 363 ms 23208 KB Output is correct
50 Correct 303 ms 23124 KB Output is correct
51 Correct 989 ms 23196 KB Output is correct
52 Correct 854 ms 23200 KB Output is correct
53 Correct 608 ms 23224 KB Output is correct
54 Correct 298 ms 23132 KB Output is correct
55 Execution timed out 2012 ms 36604 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 22872 KB Output is correct
2 Correct 16 ms 22872 KB Output is correct
3 Correct 17 ms 22876 KB Output is correct
4 Correct 16 ms 23288 KB Output is correct
5 Correct 18 ms 22872 KB Output is correct
6 Correct 15 ms 22876 KB Output is correct
7 Correct 15 ms 22872 KB Output is correct
8 Correct 16 ms 22876 KB Output is correct
9 Correct 16 ms 22876 KB Output is correct
10 Correct 18 ms 22876 KB Output is correct
11 Correct 16 ms 22988 KB Output is correct
12 Correct 17 ms 22876 KB Output is correct
13 Correct 18 ms 23052 KB Output is correct
14 Correct 17 ms 22872 KB Output is correct
15 Correct 17 ms 22876 KB Output is correct
16 Correct 17 ms 23128 KB Output is correct
17 Correct 17 ms 22872 KB Output is correct
18 Correct 17 ms 22876 KB Output is correct
19 Correct 18 ms 22876 KB Output is correct
20 Correct 18 ms 22876 KB Output is correct
21 Correct 24 ms 22872 KB Output is correct
22 Correct 19 ms 22876 KB Output is correct
23 Correct 18 ms 22876 KB Output is correct
24 Correct 18 ms 22872 KB Output is correct
25 Correct 16 ms 22876 KB Output is correct
26 Correct 17 ms 22876 KB Output is correct
27 Correct 18 ms 22920 KB Output is correct
28 Correct 16 ms 22876 KB Output is correct
29 Correct 63 ms 23132 KB Output is correct
30 Correct 189 ms 23208 KB Output is correct
31 Correct 483 ms 23132 KB Output is correct
32 Correct 773 ms 23132 KB Output is correct
33 Correct 982 ms 23380 KB Output is correct
34 Correct 288 ms 23204 KB Output is correct
35 Correct 312 ms 23216 KB Output is correct
36 Correct 1878 ms 23128 KB Output is correct
37 Correct 114 ms 23132 KB Output is correct
38 Correct 117 ms 23212 KB Output is correct
39 Correct 339 ms 23212 KB Output is correct
40 Correct 695 ms 23208 KB Output is correct
41 Correct 617 ms 23204 KB Output is correct
42 Correct 610 ms 23216 KB Output is correct
43 Correct 1368 ms 23196 KB Output is correct
44 Correct 1563 ms 23204 KB Output is correct
45 Correct 1145 ms 23380 KB Output is correct
46 Correct 799 ms 23132 KB Output is correct
47 Correct 914 ms 23208 KB Output is correct
48 Correct 419 ms 23212 KB Output is correct
49 Correct 363 ms 23208 KB Output is correct
50 Correct 303 ms 23124 KB Output is correct
51 Correct 989 ms 23196 KB Output is correct
52 Correct 854 ms 23200 KB Output is correct
53 Correct 608 ms 23224 KB Output is correct
54 Correct 298 ms 23132 KB Output is correct
55 Execution timed out 2029 ms 31460 KB Time limit exceeded
56 Halted 0 ms 0 KB -