oj.uz

Submission #159084

# Submission time Handle Problem Language Result Execution time Memory
159084 2019-10-20T16:06:00 Z TadijaSebez None (JOI16_worst_reporter2) C++11
100 / 100
 477 ms 148708 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=200050;
int a[N],b[N],c[N],d[N];
const int M=2*N;
int mx[M],lzy[M],ls[M],rs[M],tsz,root;
void Set(int &c, int ss, int se, int qs, int qe, int f)
{
	if(qs>qe || qs>se || ss>qe) return;
	if(!c) c=++tsz;
	if(qs<=ss && qe>=se){ lzy[c]+=f;mx[c]+=f;return;}
	int mid=ss+se>>1;
	Set(ls[c],ss,mid,qs,qe,f);
	Set(rs[c],mid+1,se,qs,qe,f);
	mx[c]=max(mx[ls[c]],mx[rs[c]])+lzy[c];
}
int Get(int c, int ss, int se, int qs, int qe)
{
	if(qs<=ss && qe>=se) return mx[c];
	int mid=ss+se>>1;
	if(qe<=mid) return Get(ls[c],ss,mid,qs,qe)+lzy[c];
	if(qs>mid) return Get(rs[c],mid+1,se,qs,qe)+lzy[c];
	return max(Get(ls[c],ss,mid,qs,qe),Get(rs[c],mid+1,se,qs,qe))+lzy[c];
}
stack<int> cnt[N];
int main()
{
	int n;
	scanf("%i",&n);
	for(int i=1;i<=n;i++) scanf("%i %i",&a[i],&b[i]);
	for(int i=1;i<=n;i++) scanf("%i %i",&c[i],&d[i]);
	int ans=n;
	for(int i=n,j=n;i>=1;i--)
	{
		for(;j>=1 && b[j]<=d[i];j--)
		{
			cnt[a[j]].push(i);
			Set(root,1,n,1,i,-1);
		}
		if(cnt[c[i]].size())
		{
			int x=cnt[c[i]].top();
			if(Get(root,1,n,1,x)<0)
			{
				cnt[c[i]].pop();
				Set(root,1,n,1,x,1);
				ans--;
			}
			else Set(root,1,n,1,i,1);
		}
		else Set(root,1,n,1,i,1);
	}
	printf("%i\n",ans);
	return 0;
}

Compilation message

worst_reporter2.cpp: In function 'void Set(int&, int, int, int, int, int)':
worst_reporter2.cpp:12:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
worst_reporter2.cpp: In function 'int Get(int, int, int, int, int)':
worst_reporter2.cpp:20:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
worst_reporter2.cpp: In function 'int main()':
worst_reporter2.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
worst_reporter2.cpp:30:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%i %i",&a[i],&b[i]);
                        ~~~~~^~~~~~~~~~~~~~~~~~~~~
worst_reporter2.cpp:31:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%i %i",&c[i],&d[i]);
                        ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 135032 KB Output is correct
2 Correct 135 ms 135032 KB Output is correct
3 Correct 135 ms 135004 KB Output is correct
4 Correct 136 ms 135160 KB Output is correct
5 Correct 137 ms 135032 KB Output is correct
6 Correct 137 ms 135032 KB Output is correct
7 Correct 138 ms 135068 KB Output is correct
8 Correct 136 ms 135032 KB Output is correct
9 Correct 139 ms 135292 KB Output is correct
10 Correct 137 ms 135044 KB Output is correct
11 Correct 138 ms 135084 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 135032 KB Output is correct
2 Correct 135 ms 135032 KB Output is correct
3 Correct 135 ms 135004 KB Output is correct
4 Correct 136 ms 135160 KB Output is correct
5 Correct 137 ms 135032 KB Output is correct
6 Correct 137 ms 135032 KB Output is correct
7 Correct 138 ms 135068 KB Output is correct
8 Correct 136 ms 135032 KB Output is correct
9 Correct 139 ms 135292 KB Output is correct
10 Correct 137 ms 135044 KB Output is correct
11 Correct 138 ms 135084 KB Output is correct
12 Correct 146 ms 135092 KB Output is correct
13 Correct 159 ms 135008 KB Output is correct
14 Correct 138 ms 135176 KB Output is correct
15 Correct 139 ms 135092 KB Output is correct
16 Correct 139 ms 135032 KB Output is correct
17 Correct 138 ms 135228 KB Output is correct
18 Correct 137 ms 135204 KB Output is correct
19 Correct 137 ms 135056 KB Output is correct
20 Correct 137 ms 135032 KB Output is correct
21 Correct 136 ms 135084 KB Output is correct
22 Correct 138 ms 135032 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 135032 KB Output is correct
2 Correct 135 ms 135032 KB Output is correct
3 Correct 135 ms 135004 KB Output is correct
4 Correct 136 ms 135160 KB Output is correct
5 Correct 137 ms 135032 KB Output is correct
6 Correct 137 ms 135032 KB Output is correct
7 Correct 138 ms 135068 KB Output is correct
8 Correct 136 ms 135032 KB Output is correct
9 Correct 139 ms 135292 KB Output is correct
10 Correct 137 ms 135044 KB Output is correct
11 Correct 138 ms 135084 KB Output is correct
12 Correct 146 ms 135092 KB Output is correct
13 Correct 159 ms 135008 KB Output is correct
14 Correct 138 ms 135176 KB Output is correct
15 Correct 139 ms 135092 KB Output is correct
16 Correct 139 ms 135032 KB Output is correct
17 Correct 138 ms 135228 KB Output is correct
18 Correct 137 ms 135204 KB Output is correct
19 Correct 137 ms 135056 KB Output is correct
20 Correct 137 ms 135032 KB Output is correct
21 Correct 136 ms 135084 KB Output is correct
22 Correct 138 ms 135032 KB Output is correct
23 Correct 146 ms 135432 KB Output is correct
24 Correct 142 ms 135344 KB Output is correct
25 Correct 146 ms 135304 KB Output is correct
26 Correct 147 ms 135288 KB Output is correct
27 Correct 143 ms 135248 KB Output is correct
28 Correct 144 ms 135412 KB Output is correct
29 Correct 143 ms 135288 KB Output is correct
30 Correct 144 ms 135292 KB Output is correct
31 Correct 143 ms 135288 KB Output is correct
32 Correct 143 ms 135264 KB Output is correct
33 Correct 144 ms 135388 KB Output is correct
34 Correct 141 ms 135248 KB Output is correct
35 Correct 142 ms 135288 KB Output is correct
36 Correct 142 ms 135296 KB Output is correct
37 Correct 142 ms 135204 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 135032 KB Output is correct
2 Correct 135 ms 135032 KB Output is correct
3 Correct 135 ms 135004 KB Output is correct
4 Correct 136 ms 135160 KB Output is correct
5 Correct 137 ms 135032 KB Output is correct
6 Correct 137 ms 135032 KB Output is correct
7 Correct 138 ms 135068 KB Output is correct
8 Correct 136 ms 135032 KB Output is correct
9 Correct 139 ms 135292 KB Output is correct
10 Correct 137 ms 135044 KB Output is correct
11 Correct 138 ms 135084 KB Output is correct
12 Correct 146 ms 135092 KB Output is correct
13 Correct 159 ms 135008 KB Output is correct
14 Correct 138 ms 135176 KB Output is correct
15 Correct 139 ms 135092 KB Output is correct
16 Correct 139 ms 135032 KB Output is correct
17 Correct 138 ms 135228 KB Output is correct
18 Correct 137 ms 135204 KB Output is correct
19 Correct 137 ms 135056 KB Output is correct
20 Correct 137 ms 135032 KB Output is correct
21 Correct 136 ms 135084 KB Output is correct
22 Correct 138 ms 135032 KB Output is correct
23 Correct 146 ms 135432 KB Output is correct
24 Correct 142 ms 135344 KB Output is correct
25 Correct 146 ms 135304 KB Output is correct
26 Correct 147 ms 135288 KB Output is correct
27 Correct 143 ms 135248 KB Output is correct
28 Correct 144 ms 135412 KB Output is correct
29 Correct 143 ms 135288 KB Output is correct
30 Correct 144 ms 135292 KB Output is correct
31 Correct 143 ms 135288 KB Output is correct
32 Correct 143 ms 135264 KB Output is correct
33 Correct 144 ms 135388 KB Output is correct
34 Correct 141 ms 135248 KB Output is correct
35 Correct 142 ms 135288 KB Output is correct
36 Correct 142 ms 135296 KB Output is correct
37 Correct 142 ms 135204 KB Output is correct
38 Correct 477 ms 148708 KB Output is correct
39 Correct 475 ms 147676 KB Output is correct
40 Correct 455 ms 147452 KB Output is correct
41 Correct 459 ms 147672 KB Output is correct
42 Correct 461 ms 146808 KB Output is correct
43 Correct 392 ms 146184 KB Output is correct
44 Correct 392 ms 146296 KB Output is correct
45 Correct 394 ms 146300 KB Output is correct
46 Correct 390 ms 147292 KB Output is correct
47 Correct 399 ms 145176 KB Output is correct
48 Correct 381 ms 145656 KB Output is correct
49 Correct 372 ms 145340 KB Output is correct
50 Correct 383 ms 145660 KB Output is correct
51 Correct 379 ms 147064 KB Output is correct
52 Correct 383 ms 143744 KB Output is correct