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 <iostream>
#include <vector>
#include <string>
#include <set>
#include <cmath>
#include <tuple>
#include <queue>
#include <functional>
using namespace std;
/*long long int power(long long int n, int k)
{
long long int vys = 1;
for (int i = 0; i < k; i++)
{
vys = (vys * (n - i)) / (i + 1);
}
return vys;
}*/
int main()
{
/*for (int i = 0; i < 10; i++)
{
std::cout << "Hello Flash!\n";
}*/
//cout << "TU" << endl;
int n;
cin >> n;
vector<int>v(n);
vector<int>p(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
for (int i = 0; i < n; i++)
{
cin >> p[i];
}
int vys = 0;
vector<int>cheat(n, 0);//zaznacime si pre i-teho studenta ci podvadza alebo nie
for (int i = 0; i < n; i++)
{
if (v[i] == p[0])
{
int j = i;
int k = i-1;
for ( ;j < n; j++)
{
if (v[j] > v[i]||cheat[k]==1)
{
break;
}
cheat[i] = 1;
}
if (i > 0)
{
for (; k >= 0; k--)
{
if (v[k] > v[i]||cheat[k]==1)
{
break;
}
cheat[k] = 1;
}
}
// cout << j << ' ' << k << endl;
}
}
for (int i = 0; i < n; i++)
{
if (cheat[i] == 1)
{
vys += 1;
}
}
cout << vys << endl;
return 0;
}
# | 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... |