oj.uz

Submission #1095114

# Submission time Handle Problem Language Result Execution time Memory
1095114 2024-10-01T10:02:49 Z simona1230 Joker (BOI20_joker) C++17
14 / 100
 741 ms 17236 KB 
#include <bits/stdc++.h>
 
using namespace std;
struct query
{
    int l,r,i;
    query(){}
    query(int _l,int _r,int _i)
    {
        l=_l;
        r=_r;
        i=_i;
    }
};
 
struct edge
{
    int x,y;
    edge(){}
    edge(int _x,int _y)
    {
        x=_x;
        y=_y;
    }
};
 
int n,m,k;
query a[200001];
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};
        a[i]={l,r,i};
    }
}
 
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 minr[200001];
int sz[200001];
pair<int,int> p[200001];
 
void init()
{
    pos=1;
    for(int i=1;i<=n;i++)
        p[i]={i,0},sz[i]=1;
}
 
pair<int,int> parent(int x)
{
    if(x==p[x].first)return p[x];
    int curr=p[x].second;
 
    p[x]=parent(p[x].first);
    p[x].second+=curr;
    return p[x];
}
 
void unite(int x,int y)
{
    pair<int,int> pxx=parent(x);
    pair<int,int> pyy=parent(y);
 
    int px=pxx.first;
    int py=pyy.first;
 
    if(px!=py)
    {
        if(sz[px]>sz[py])swap(px,py);
 
        p[px]={py,pxx.second+1};
        sz[py]+=sz[px];
    }
    else
    {
        //cout<<x<<" "<<y<<" "<<pxx.second<<" "<<pyy.second<<endl;
        if(pxx.second%2==pyy.second%2)
            pos=0;
    }
}
 
void subt()
{
    for(int i=1;i<=min(200,m);i++)
    {
        //cout<<i<<endl;
        init();
        for(int j=1;j<i;j++)
        {
            unite(e[j].first,e[j].second);
            if(pos==0)
            {
                //cout<<"in"<<" "<<i<<" "<<j<<endl;
                minr[i]=m+1;
                break;
            }
        }
        for(int j=m;j>i;j--)
        {
            unite(e[j].first,e[j].second);
            if(pos==0)
            {
                //cout<<"in"<<" "<<i<<" "<<j<<endl;
                minr[i]=max(minr[i],j);
                break;
            }
        }
    }
 
    for(int i=1;i<=k;i++)
    {
        if(minr[q[i].first]>q[i].second)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
}
 
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	read();
	if(n<=2000)slow();
	else subt();
	return 0;
}

Compilation message

Joker.cpp: In function 'void dfs(int)':
Joker.cpp:56:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for(int j=0;j<v[i].size();j++)
      |                 ~^~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 3 ms 4952 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Correct 4 ms 4952 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 3 ms 5172 KB Output is correct
14 Correct 3 ms 4956 KB Output is correct
15 Correct 3 ms 4956 KB Output is correct
16 Correct 3 ms 4956 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 4956 KB Output is correct
20 Correct 3 ms 4956 KB Output is correct
21 Correct 3 ms 4956 KB Output is correct
22 Correct 3 ms 4956 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 3 ms 4956 KB Output is correct
25 Correct 3 ms 5168 KB Output is correct
26 Correct 3 ms 4956 KB Output is correct
27 Correct 3 ms 5168 KB Output is correct
28 Correct 3 ms 4956 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 3 ms 4952 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Correct 4 ms 4952 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 3 ms 5172 KB Output is correct
14 Correct 3 ms 4956 KB Output is correct
15 Correct 3 ms 4956 KB Output is correct
16 Correct 3 ms 4956 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 4956 KB Output is correct
20 Correct 3 ms 4956 KB Output is correct
21 Correct 3 ms 4956 KB Output is correct
22 Correct 3 ms 4956 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 3 ms 4956 KB Output is correct
25 Correct 3 ms 5168 KB Output is correct
26 Correct 3 ms 4956 KB Output is correct
27 Correct 3 ms 5168 KB Output is correct
28 Correct 3 ms 4956 KB Output is correct
29 Correct 46 ms 5212 KB Output is correct
30 Correct 85 ms 5176 KB Output is correct
31 Correct 88 ms 5208 KB Output is correct
32 Correct 72 ms 5176 KB Output is correct
33 Correct 61 ms 5212 KB Output is correct
34 Correct 89 ms 5212 KB Output is correct
35 Correct 95 ms 5208 KB Output is correct
36 Correct 41 ms 5208 KB Output is correct
37 Correct 68 ms 5216 KB Output is correct
38 Correct 59 ms 5208 KB Output is correct
39 Correct 70 ms 5212 KB Output is correct
40 Correct 68 ms 5212 KB Output is correct
41 Correct 70 ms 5208 KB Output is correct
42 Correct 67 ms 5208 KB Output is correct
43 Correct 61 ms 5212 KB Output is correct
44 Correct 75 ms 5212 KB Output is correct
45 Correct 80 ms 5212 KB Output is correct
46 Correct 80 ms 5336 KB Output is correct
47 Correct 62 ms 5208 KB Output is correct
48 Correct 69 ms 5212 KB Output is correct
49 Correct 77 ms 5328 KB Output is correct
50 Correct 85 ms 5212 KB Output is correct
51 Correct 64 ms 5208 KB Output is correct
52 Correct 76 ms 5208 KB Output is correct
53 Correct 81 ms 5212 KB Output is correct
54 Correct 92 ms 5340 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 680 ms 16352 KB Output is correct
4 Incorrect 741 ms 17236 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 3 ms 4952 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Correct 4 ms 4952 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 3 ms 5172 KB Output is correct
14 Correct 3 ms 4956 KB Output is correct
15 Correct 3 ms 4956 KB Output is correct
16 Correct 3 ms 4956 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 4956 KB Output is correct
20 Correct 3 ms 4956 KB Output is correct
21 Correct 3 ms 4956 KB Output is correct
22 Correct 3 ms 4956 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 3 ms 4956 KB Output is correct
25 Correct 3 ms 5168 KB Output is correct
26 Correct 3 ms 4956 KB Output is correct
27 Correct 3 ms 5168 KB Output is correct
28 Correct 3 ms 4956 KB Output is correct
29 Correct 680 ms 16352 KB Output is correct
30 Incorrect 741 ms 17236 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 3 ms 4952 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Correct 4 ms 4952 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 3 ms 5172 KB Output is correct
14 Correct 3 ms 4956 KB Output is correct
15 Correct 3 ms 4956 KB Output is correct
16 Correct 3 ms 4956 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 4956 KB Output is correct
20 Correct 3 ms 4956 KB Output is correct
21 Correct 3 ms 4956 KB Output is correct
22 Correct 3 ms 4956 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 3 ms 4956 KB Output is correct
25 Correct 3 ms 5168 KB Output is correct
26 Correct 3 ms 4956 KB Output is correct
27 Correct 3 ms 5168 KB Output is correct
28 Correct 3 ms 4956 KB Output is correct
29 Correct 46 ms 5212 KB Output is correct
30 Correct 85 ms 5176 KB Output is correct
31 Correct 88 ms 5208 KB Output is correct
32 Correct 72 ms 5176 KB Output is correct
33 Correct 61 ms 5212 KB Output is correct
34 Correct 89 ms 5212 KB Output is correct
35 Correct 95 ms 5208 KB Output is correct
36 Correct 41 ms 5208 KB Output is correct
37 Correct 68 ms 5216 KB Output is correct
38 Correct 59 ms 5208 KB Output is correct
39 Correct 70 ms 5212 KB Output is correct
40 Correct 68 ms 5212 KB Output is correct
41 Correct 70 ms 5208 KB Output is correct
42 Correct 67 ms 5208 KB Output is correct
43 Correct 61 ms 5212 KB Output is correct
44 Correct 75 ms 5212 KB Output is correct
45 Correct 80 ms 5212 KB Output is correct
46 Correct 80 ms 5336 KB Output is correct
47 Correct 62 ms 5208 KB Output is correct
48 Correct 69 ms 5212 KB Output is correct
49 Correct 77 ms 5328 KB Output is correct
50 Correct 85 ms 5212 KB Output is correct
51 Correct 64 ms 5208 KB Output is correct
52 Correct 76 ms 5208 KB Output is correct
53 Correct 81 ms 5212 KB Output is correct
54 Correct 92 ms 5340 KB Output is correct
55 Incorrect 464 ms 10284 KB Output isn't correct
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 3 ms 4952 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Correct 4 ms 4952 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4956 KB Output is correct
13 Correct 3 ms 5172 KB Output is correct
14 Correct 3 ms 4956 KB Output is correct
15 Correct 3 ms 4956 KB Output is correct
16 Correct 3 ms 4956 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 3 ms 4956 KB Output is correct
20 Correct 3 ms 4956 KB Output is correct
21 Correct 3 ms 4956 KB Output is correct
22 Correct 3 ms 4956 KB Output is correct
23 Correct 3 ms 4956 KB Output is correct
24 Correct 3 ms 4956 KB Output is correct
25 Correct 3 ms 5168 KB Output is correct
26 Correct 3 ms 4956 KB Output is correct
27 Correct 3 ms 5168 KB Output is correct
28 Correct 3 ms 4956 KB Output is correct
29 Correct 46 ms 5212 KB Output is correct
30 Correct 85 ms 5176 KB Output is correct
31 Correct 88 ms 5208 KB Output is correct
32 Correct 72 ms 5176 KB Output is correct
33 Correct 61 ms 5212 KB Output is correct
34 Correct 89 ms 5212 KB Output is correct
35 Correct 95 ms 5208 KB Output is correct
36 Correct 41 ms 5208 KB Output is correct
37 Correct 68 ms 5216 KB Output is correct
38 Correct 59 ms 5208 KB Output is correct
39 Correct 70 ms 5212 KB Output is correct
40 Correct 68 ms 5212 KB Output is correct
41 Correct 70 ms 5208 KB Output is correct
42 Correct 67 ms 5208 KB Output is correct
43 Correct 61 ms 5212 KB Output is correct
44 Correct 75 ms 5212 KB Output is correct
45 Correct 80 ms 5212 KB Output is correct
46 Correct 80 ms 5336 KB Output is correct
47 Correct 62 ms 5208 KB Output is correct
48 Correct 69 ms 5212 KB Output is correct
49 Correct 77 ms 5328 KB Output is correct
50 Correct 85 ms 5212 KB Output is correct
51 Correct 64 ms 5208 KB Output is correct
52 Correct 76 ms 5208 KB Output is correct
53 Correct 81 ms 5212 KB Output is correct
54 Correct 92 ms 5340 KB Output is correct
55 Correct 680 ms 16352 KB Output is correct
56 Incorrect 741 ms 17236 KB Output isn't correct
57 Halted 0 ms 0 KB -