oj.uz

Submission #257660

# Submission time Handle Problem Language Result Execution time Memory
257660 2020-08-04T14:08:42 Z arnold518 Joker (BOI20_joker) C++14
39 / 100
 2000 ms 27756 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 4e5;
const int SQ = 300;

struct Query
{
	int l, r, k;
	bool operator < (const Query &p) { return r>p.r; }
};

int N, M, Q;
pii E[MAXN+10];
Query A[MAXN+10];
vector<Query> B[MAXN+10];
int ans[MAXN+10];

struct UF
{
	//int par[MAXN+10], sz[MAXN+10], opp[MAXN+10];
	vector<int> par, sz, opp;
	bool state;
	vector<int> V;
	void init()
	{
		par.resize(2*N+10); sz.resize(2*N+10); opp.resize(2*N+10);
		int i, j;
		for(i=1; i<=N; i++) par[i]=i, sz[i]=1, opp[i]=N+i;
		for(i=1; i<=N; i++) par[i+N]=i+N, sz[i+N]=1, opp[i+N]=i;
		V.clear(); state=true;
	}
	int Find(int x)
	{
		if(x==par[x]) return x;
		return Find(par[x]);
	}
	void Union(int x, int y)
	{
		//printf("Union %d %d\n", x, y);

		x=Find(x); y=Find(y);
		int nx=opp[x], ny=opp[y];

		if(x==y || !state)
		{
			if(state) V.push_back(-1);
			else V.push_back(-2);
			state=false;
			return;
		}

		if(sz[x]<sz[ny]) swap(x, ny);
		if(sz[y]<sz[nx]) swap(y, nx);
		
		if(sz[x]==sz[ny]) sz[x]++, V.push_back(-3);
		if(sz[y]==sz[nx]) sz[y]++, V.push_back(-4);
		V.push_back(opp[x]); V.push_back(opp[y]); V.push_back(ny); V.push_back(nx);
		par[ny]=x;
		par[nx]=y;
		opp[x]=y; opp[y]=x;
	}
	void restore()
	{
		int ny, nx, x, y, oppx, oppy;
		//printf("RESTORE\n");
		if(V.empty()) while(1);
		if(V.back()==-1 || V.back()==-2)
		{
			if(V.back()==-1) state=true;
			V.pop_back();
		 	return;
		}

		nx=V.back(); V.pop_back();
		ny=V.back(); V.pop_back();
		oppy=V.back(); V.pop_back();
		oppx=V.back(); V.pop_back();
		x=par[ny]; y=par[nx];
		if(!V.empty() && V.back()==-4) sz[x]--, V.pop_back();
		if(!V.empty() && V.back()==-3) sz[y]--, V.pop_back();
		opp[x]=oppx; opp[y]=oppy;
		sz[x]-=sz[ny]; sz[y]-=sz[nx];
		par[ny]=ny; par[nx]=nx;
	}
}uf;


int main()
{
	int i, j, k;

	scanf("%d%d%d", &N, &M, &Q);
	for(i=1; i<=M; i++) scanf("%d%d", &E[i].first, &E[i].second);
	for(i=1; i<=Q; i++)
	{
		scanf("%d%d", &A[i].l, &A[i].r);
		A[i].k=i;
		B[A[i].l/SQ].push_back(A[i]);
	}

	uf.init();
	for(i=0, j=1; i<=M/SQ; i++)
	{
		int l=max(SQ*i, 1), r=min(SQ*i+SQ-1, M);
		sort(B[i].begin(), B[i].end());

		for(; j<l; j++) uf.Union(E[j].first, E[j].second);
		int p=M, q;
		for(auto it : B[i])
		{
			for(; p>it.r; p--) uf.Union(E[p].first, E[p].second);
			for(q=l; q<it.l; q++) uf.Union(E[q].first, E[q].second);
			ans[it.k]=uf.state;
			for(q=l; q<it.l; q++) uf.restore();
		}
		for(p++; p<=M; p++) uf.restore();
	}
	for(i=1; i<=Q; i++)
	{
		if(!ans[i]) printf("YES\n");
		else printf("NO\n");
	}
}

Compilation message

Joker.cpp: In member function 'void UF::init()':
Joker.cpp:32:10: warning: unused variable 'j' [-Wunused-variable]
   int i, j;
          ^
Joker.cpp: In function 'int main()':
Joker.cpp:109:23: warning: unused variable 'r' [-Wunused-variable]
   int l=max(SQ*i, 1), r=min(SQ*i+SQ-1, M);
                       ^
Joker.cpp:95:12: warning: unused variable 'k' [-Wunused-variable]
  int i, j, k;
            ^
Joker.cpp:97:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &N, &M, &Q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:98:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=M; i++) scanf("%d%d", &E[i].first, &E[i].second);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Joker.cpp:101:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &A[i].l, &A[i].r);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 8 ms 9728 KB Output is correct
8 Correct 7 ms 9728 KB Output is correct
9 Correct 8 ms 9728 KB Output is correct
10 Correct 7 ms 9728 KB Output is correct
11 Correct 8 ms 9728 KB Output is correct
12 Correct 7 ms 9728 KB Output is correct
13 Correct 7 ms 9728 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 7 ms 9728 KB Output is correct
16 Correct 10 ms 9728 KB Output is correct
17 Correct 6 ms 9728 KB Output is correct
18 Correct 7 ms 9728 KB Output is correct
19 Correct 8 ms 9728 KB Output is correct
20 Correct 7 ms 9728 KB Output is correct
21 Correct 8 ms 9728 KB Output is correct
22 Correct 7 ms 9728 KB Output is correct
23 Correct 8 ms 9728 KB Output is correct
24 Correct 6 ms 9728 KB Output is correct
25 Correct 9 ms 9728 KB Output is correct
26 Correct 7 ms 9728 KB Output is correct
27 Correct 9 ms 9728 KB Output is correct
28 Correct 9 ms 9728 KB Output is correct
29 Correct 25 ms 9856 KB Output is correct
30 Correct 17 ms 9856 KB Output is correct
31 Correct 16 ms 9856 KB Output is correct
32 Correct 14 ms 9856 KB Output is correct
33 Correct 16 ms 9856 KB Output is correct
34 Correct 14 ms 9984 KB Output is correct
35 Correct 19 ms 9984 KB Output is correct
36 Correct 13 ms 9856 KB Output is correct
37 Correct 17 ms 9984 KB Output is correct
38 Correct 20 ms 9984 KB Output is correct
39 Correct 15 ms 9984 KB Output is correct
40 Correct 17 ms 9856 KB Output is correct
41 Correct 18 ms 9856 KB Output is correct
42 Correct 17 ms 9856 KB Output is correct
43 Correct 15 ms 9856 KB Output is correct
44 Correct 16 ms 9856 KB Output is correct
45 Correct 13 ms 9984 KB Output is correct
46 Correct 17 ms 9976 KB Output is correct
47 Correct 19 ms 9856 KB Output is correct
48 Correct 16 ms 9856 KB Output is correct
49 Correct 19 ms 9856 KB Output is correct
50 Correct 17 ms 9980 KB Output is correct
51 Correct 19 ms 9856 KB Output is correct
52 Correct 23 ms 10088 KB Output is correct
53 Correct 27 ms 9856 KB Output is correct
54 Correct 21 ms 9972 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 177 ms 23828 KB Output is correct
4 Correct 176 ms 27748 KB Output is correct
5 Correct 157 ms 27104 KB Output is correct
6 Correct 164 ms 25316 KB Output is correct
7 Correct 164 ms 25316 KB Output is correct
8 Correct 156 ms 24292 KB Output is correct
9 Correct 164 ms 25312 KB Output is correct
10 Correct 172 ms 27620 KB Output is correct
11 Correct 152 ms 25316 KB Output is correct
12 Correct 155 ms 27108 KB Output is correct
13 Correct 147 ms 23396 KB Output is correct
14 Correct 157 ms 24292 KB Output is correct
15 Correct 176 ms 26232 KB Output is correct
16 Correct 176 ms 27752 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 8 ms 9728 KB Output is correct
8 Correct 7 ms 9728 KB Output is correct
9 Correct 8 ms 9728 KB Output is correct
10 Correct 7 ms 9728 KB Output is correct
11 Correct 8 ms 9728 KB Output is correct
12 Correct 7 ms 9728 KB Output is correct
13 Correct 7 ms 9728 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 7 ms 9728 KB Output is correct
16 Correct 10 ms 9728 KB Output is correct
17 Correct 6 ms 9728 KB Output is correct
18 Correct 7 ms 9728 KB Output is correct
19 Correct 8 ms 9728 KB Output is correct
20 Correct 7 ms 9728 KB Output is correct
21 Correct 8 ms 9728 KB Output is correct
22 Correct 7 ms 9728 KB Output is correct
23 Correct 8 ms 9728 KB Output is correct
24 Correct 6 ms 9728 KB Output is correct
25 Correct 9 ms 9728 KB Output is correct
26 Correct 7 ms 9728 KB Output is correct
27 Correct 9 ms 9728 KB Output is correct
28 Correct 9 ms 9728 KB Output is correct
29 Correct 177 ms 23828 KB Output is correct
30 Correct 176 ms 27748 KB Output is correct
31 Correct 157 ms 27104 KB Output is correct
32 Correct 164 ms 25316 KB Output is correct
33 Correct 164 ms 25316 KB Output is correct
34 Correct 156 ms 24292 KB Output is correct
35 Correct 164 ms 25312 KB Output is correct
36 Correct 172 ms 27620 KB Output is correct
37 Correct 152 ms 25316 KB Output is correct
38 Correct 155 ms 27108 KB Output is correct
39 Correct 147 ms 23396 KB Output is correct
40 Correct 157 ms 24292 KB Output is correct
41 Correct 176 ms 26232 KB Output is correct
42 Correct 176 ms 27752 KB Output is correct
43 Correct 925 ms 23908 KB Output is correct
44 Correct 1035 ms 27756 KB Output is correct
45 Correct 999 ms 27620 KB Output is correct
46 Execution timed out 2086 ms 20872 KB Time limit exceeded
47 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 8 ms 9728 KB Output is correct
8 Correct 7 ms 9728 KB Output is correct
9 Correct 8 ms 9728 KB Output is correct
10 Correct 7 ms 9728 KB Output is correct
11 Correct 8 ms 9728 KB Output is correct
12 Correct 7 ms 9728 KB Output is correct
13 Correct 7 ms 9728 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 7 ms 9728 KB Output is correct
16 Correct 10 ms 9728 KB Output is correct
17 Correct 6 ms 9728 KB Output is correct
18 Correct 7 ms 9728 KB Output is correct
19 Correct 8 ms 9728 KB Output is correct
20 Correct 7 ms 9728 KB Output is correct
21 Correct 8 ms 9728 KB Output is correct
22 Correct 7 ms 9728 KB Output is correct
23 Correct 8 ms 9728 KB Output is correct
24 Correct 6 ms 9728 KB Output is correct
25 Correct 9 ms 9728 KB Output is correct
26 Correct 7 ms 9728 KB Output is correct
27 Correct 9 ms 9728 KB Output is correct
28 Correct 9 ms 9728 KB Output is correct
29 Correct 25 ms 9856 KB Output is correct
30 Correct 17 ms 9856 KB Output is correct
31 Correct 16 ms 9856 KB Output is correct
32 Correct 14 ms 9856 KB Output is correct
33 Correct 16 ms 9856 KB Output is correct
34 Correct 14 ms 9984 KB Output is correct
35 Correct 19 ms 9984 KB Output is correct
36 Correct 13 ms 9856 KB Output is correct
37 Correct 17 ms 9984 KB Output is correct
38 Correct 20 ms 9984 KB Output is correct
39 Correct 15 ms 9984 KB Output is correct
40 Correct 17 ms 9856 KB Output is correct
41 Correct 18 ms 9856 KB Output is correct
42 Correct 17 ms 9856 KB Output is correct
43 Correct 15 ms 9856 KB Output is correct
44 Correct 16 ms 9856 KB Output is correct
45 Correct 13 ms 9984 KB Output is correct
46 Correct 17 ms 9976 KB Output is correct
47 Correct 19 ms 9856 KB Output is correct
48 Correct 16 ms 9856 KB Output is correct
49 Correct 19 ms 9856 KB Output is correct
50 Correct 17 ms 9980 KB Output is correct
51 Correct 19 ms 9856 KB Output is correct
52 Correct 23 ms 10088 KB Output is correct
53 Correct 27 ms 9856 KB Output is correct
54 Correct 21 ms 9972 KB Output is correct
55 Execution timed out 2086 ms 15888 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9728 KB Output is correct
2 Correct 6 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct
7 Correct 8 ms 9728 KB Output is correct
8 Correct 7 ms 9728 KB Output is correct
9 Correct 8 ms 9728 KB Output is correct
10 Correct 7 ms 9728 KB Output is correct
11 Correct 8 ms 9728 KB Output is correct
12 Correct 7 ms 9728 KB Output is correct
13 Correct 7 ms 9728 KB Output is correct
14 Correct 9 ms 9728 KB Output is correct
15 Correct 7 ms 9728 KB Output is correct
16 Correct 10 ms 9728 KB Output is correct
17 Correct 6 ms 9728 KB Output is correct
18 Correct 7 ms 9728 KB Output is correct
19 Correct 8 ms 9728 KB Output is correct
20 Correct 7 ms 9728 KB Output is correct
21 Correct 8 ms 9728 KB Output is correct
22 Correct 7 ms 9728 KB Output is correct
23 Correct 8 ms 9728 KB Output is correct
24 Correct 6 ms 9728 KB Output is correct
25 Correct 9 ms 9728 KB Output is correct
26 Correct 7 ms 9728 KB Output is correct
27 Correct 9 ms 9728 KB Output is correct
28 Correct 9 ms 9728 KB Output is correct
29 Correct 25 ms 9856 KB Output is correct
30 Correct 17 ms 9856 KB Output is correct
31 Correct 16 ms 9856 KB Output is correct
32 Correct 14 ms 9856 KB Output is correct
33 Correct 16 ms 9856 KB Output is correct
34 Correct 14 ms 9984 KB Output is correct
35 Correct 19 ms 9984 KB Output is correct
36 Correct 13 ms 9856 KB Output is correct
37 Correct 17 ms 9984 KB Output is correct
38 Correct 20 ms 9984 KB Output is correct
39 Correct 15 ms 9984 KB Output is correct
40 Correct 17 ms 9856 KB Output is correct
41 Correct 18 ms 9856 KB Output is correct
42 Correct 17 ms 9856 KB Output is correct
43 Correct 15 ms 9856 KB Output is correct
44 Correct 16 ms 9856 KB Output is correct
45 Correct 13 ms 9984 KB Output is correct
46 Correct 17 ms 9976 KB Output is correct
47 Correct 19 ms 9856 KB Output is correct
48 Correct 16 ms 9856 KB Output is correct
49 Correct 19 ms 9856 KB Output is correct
50 Correct 17 ms 9980 KB Output is correct
51 Correct 19 ms 9856 KB Output is correct
52 Correct 23 ms 10088 KB Output is correct
53 Correct 27 ms 9856 KB Output is correct
54 Correct 21 ms 9972 KB Output is correct
55 Correct 177 ms 23828 KB Output is correct
56 Correct 176 ms 27748 KB Output is correct
57 Correct 157 ms 27104 KB Output is correct
58 Correct 164 ms 25316 KB Output is correct
59 Correct 164 ms 25316 KB Output is correct
60 Correct 156 ms 24292 KB Output is correct
61 Correct 164 ms 25312 KB Output is correct
62 Correct 172 ms 27620 KB Output is correct
63 Correct 152 ms 25316 KB Output is correct
64 Correct 155 ms 27108 KB Output is correct
65 Correct 147 ms 23396 KB Output is correct
66 Correct 157 ms 24292 KB Output is correct
67 Correct 176 ms 26232 KB Output is correct
68 Correct 176 ms 27752 KB Output is correct
69 Correct 925 ms 23908 KB Output is correct
70 Correct 1035 ms 27756 KB Output is correct
71 Correct 999 ms 27620 KB Output is correct
72 Execution timed out 2086 ms 20872 KB Time limit exceeded
73 Halted 0 ms 0 KB -