test/aoj/alds1/a_plus_b.test.cpp

• View this file on GitHub
• Last update: 2024-07-12 05:21:16+09:00
• Problem: https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/4/ALDS1_4_B

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/4/ALDS1_4_B"
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define ALL(x) std::begin(x), std::end(x)
using namespace std;

int main() {
    int n; cin >> n;
    vector<int> s(n);
    REP (i, n) {
        cin >> s[i];
    }
    int q; cin >> q;
    int cnt = 0;
    while (q --) {
        int t_i; cin >> t_i;
        cnt += binary_search(ALL(s), t_i);
    }
    cout << cnt << endl;
    return 0;
}

#line 1 "test/aoj/alds1/a_plus_b.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/4/ALDS1_4_B"
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define ALL(x) std::begin(x), std::end(x)
using namespace std;

int main() {
    int n; cin >> n;
    vector<int> s(n);
    REP (i, n) {
        cin >> s[i];
    }
    int q; cin >> q;
    int cnt = 0;
    while (q --) {
        int t_i; cin >> t_i;
        cnt += binary_search(ALL(s), t_i);
    }
    cout << cnt << endl;
    return 0;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	testcase_00	AC	6 ms	3 MB
g++	testcase_01	AC	5 ms	3 MB
g++	testcase_02	AC	5 ms	3 MB
g++	testcase_03	AC	5 ms	3 MB
g++	testcase_04	AC	5 ms	3 MB
g++	testcase_05	AC	5 ms	3 MB
g++	testcase_06	AC	5 ms	3 MB
g++	testcase_07	AC	6 ms	3 MB
g++	testcase_08	AC	7 ms	3 MB
g++	testcase_09	AC	34 ms	4 MB

Back to top page