This documentation is automatically generated by competitive-verifier/competitive-verifier
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/4/ALDS1_4_B"
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
int q;
cin >> q;
int cnt = 0;
while (q--) {
int t_i;
cin >> t_i;
cnt += ranges::binary_search(s, t_i);
}
cout << cnt << endl;
return 0;
}
#line 1 "src/example/example_cpp20.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/4/ALDS1_4_B"
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(n);
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
int q;
cin >> q;
int cnt = 0;
while (q--) {
int t_i;
cin >> t_i;
cnt += ranges::binary_search(s, t_i);
}
cout << cnt << endl;
return 0;
}
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| g++ | testcase_00 |
|
97 ms | 16 MB |
| g++ | testcase_01 |
|
10 ms | 16 MB |
| g++ | testcase_02 |
|
10 ms | 16 MB |
| g++ | testcase_03 |
|
10 ms | 16 MB |
| g++ | testcase_04 |
|
10 ms | 16 MB |
| g++ | testcase_05 |
|
9 ms | 16 MB |
| g++ | testcase_06 |
|
10 ms | 16 MB |
| g++ | testcase_07 |
|
10 ms | 16 MB |
| g++ | testcase_08 |
|
11 ms | 16 MB |
| g++ | testcase_09 |
|
45 ms | 16 MB |