Submission #462390

# Submission time Handle Problem Language Result Execution time Memory
462390 2021-08-10T12:58:33 Z bigo Exam (eJOI20_exam) C++14
0 / 100
7 ms 332 KB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> pii;
int main() {
	int n;
	cin >> n;
	vector<int>a(n), b(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		cin >> b[i];
	}
	vector<pii>vec;
	for (int i = 0; i < n; i++) {
		if (a[i] < b[i]) {
			for (int j = i + 1; j < n; j++) {
				if (a[j] == b[i]) {
					vec.push_back({ i,j });
					break;
				}
			}
		}
		else if (a[i] == b[i])
			vec.push_back({ i,i });
	}
	cout << vec.size();
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -