# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
440446 | prvocislo | Exam (eJOI20_exam) | C++17 | 214 ms | 13880 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
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<vector<int> > v(n, vector<int>(2, -1));
for (int it = 0; it < 2; it++)
{
map<int, int> m;
vector<pair<int, int>> stk; // {hodnota, index}
for (int k = 0; k < n; k++)
{
int i = it ? n - k - 1 : k;
while (!stk.empty() && a[i] > stk.back().first)
m[stk.back().first] = -1, stk.pop_back();
stk.push_back({a[i], i}); m[a[i]] = i;
if (m.count(b[i]) && m[b[i]] != -1)
v[i][it] = m[b[i]];
}
}
vector<int> u;
for (int i = 0; i < n; i++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |