oj.uz

Submission #99012

# Submission time Handle Problem Language Result Execution time Memory
99012 2019-02-28T05:30:39 Z 크리(#2856, kriii) Exhibition (JOI19_ho_t2) C++17
0 / 100
 2 ms 384 KB 
#include <stdio.h>
#include <algorithm>
#include <map>
using namespace std;

int N,M,C;
pair<int, int> pic[100100];
int sz[100100],bit[100100];

int out(int x)
{
	int r = 0;
	while (x){
		r = max(r,bit[x]);
		x -= x & (-x);
	}
	return r;
}

void in(int x, int p)
{
	while (x <= C){
		bit[x] = max(bit[x],p);
		x += x & (-x);
	}
}

int main()
{
	scanf ("%d %d",&N,&M);
	for (int i=0;i<N;i++){
		scanf ("%d %d",&pic[i].second,&pic[i].first);
		pic[i].first = -pic[i].first;
	}
	sort(pic,pic+N);
	for (int i=0;i<N;i++){
		int x = C + 1;
		if (pic[i].first != pic[i+1].first) C++;
		pic[i].first = x;
	}
	for (int i=0;i<M;i++) scanf ("%d",&sz[i]);
	sort(sz,sz+M);

	for (int i=0;i<N;i++){
		int u = out(pic[i].first) + 1;
		int v = M - (lower_bound(sz,sz+M,pic[i].second) - sz);
		in(pic[i].first,min(u,v));
	}
	printf ("%d\n",out(C));

	return 0;
}

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:30:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf ("%d %d",&N,&M);
  ~~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:32:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf ("%d %d",&pic[i].second,&pic[i].first);
   ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:41:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i=0;i<M;i++) scanf ("%d",&sz[i]);
                        ~~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -