oj.uz

Submission #730471

# Submission time Handle Problem Language Result Execution time Memory
730471 2023-04-26T01:59:54 Z josanneo22 Exam (eJOI20_exam) C++17
100 / 100
 38 ms 6860 KB 
#include <bits/stdc++.h>
using namespace std;
inline int rd(){
	int x=0,w=1;
	char ch=getchar();
	for(;ch>'9'||ch<'0';ch=getchar()) if(ch=='-') w=-1;
	for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1) +(x<<3) +ch-'0';
	return x*w;
}
int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	int N=rd();
	vector<int> A(N); for (auto& a : A)a=rd();
	vector<int> B(N); for (auto& b : B)b=rd();
	vector<array<int, 2>> match(N, array<int, 2>{-1, -1});
	for (int z = 0; z < 2; z++) {
		unordered_map<int, int> in_stack;
		vector<int> stk; stk.reserve(N);
		for (int j = 0; j < N; j++) {
			int i = z ? N-1-j : j;
			while (!stk.empty() && stk.back() <= A[i]) {
				in_stack.erase(stk.back());
				stk.pop_back();
			}
			stk.push_back(A[i]);
			in_stack[A[i]] = i;
 
			if (in_stack.count(B[i])) {
				match[i][z] = in_stack[B[i]];
			}
		}
	}
	vector<int> V; V.reserve(2*N);
	for (int i = 0; i < N; i++) {
		if (match[i][1] != -1) {
			V.push_back(match[i][1]);
		}
		if (match[i][0] != -1 && match[i][0] != match[i][1]) {
			V.push_back(match[i][0]);
		}
	}
	vector<int> best; best.reserve(V.size());
	for (int v : V) {
		int mi = -1;
		int ma = int(best.size());
		while (ma - mi > 1) {
			int md = (mi + ma) / 2;
			if (v >= best[md]) mi = md;
			else ma = md;
		}
		if (ma == int(best.size())) best.push_back(v);
		else best[ma] = v;
	}
 
	printf("%d\n",best.size());
	return 0;
}

Compilation message

exam.cpp: In function 'int main()':
exam.cpp:55:11: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
   55 |  printf("%d\n",best.size());
      |          ~^    ~~~~~~~~~~~
      |           |             |
      |           int           std::vector<int>::size_type {aka long unsigned int}
      |          %ld

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 224 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 852 KB Output is correct
3 Correct 19 ms 6668 KB Output is correct
4 Correct 28 ms 3060 KB Output is correct
5 Correct 34 ms 2632 KB Output is correct
6 Correct 16 ms 2060 KB Output is correct
7 Correct 30 ms 3016 KB Output is correct
8 Correct 24 ms 1900 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 10 ms 976 KB Output is correct
3 Correct 21 ms 1896 KB Output is correct
4 Correct 25 ms 1876 KB Output is correct
5 Correct 37 ms 6860 KB Output is correct
6 Correct 35 ms 4596 KB Output is correct
7 Correct 38 ms 4484 KB Output is correct
8 Correct 21 ms 1876 KB Output is correct
9 Correct 27 ms 2260 KB Output is correct
10 Correct 30 ms 4320 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 224 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 224 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 596 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct