# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
370843 |
2021-02-24T18:29:16 Z |
Traduttore |
Exam (eJOI20_exam) |
C++14 |
|
1000 ms |
2796 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define F first
#define S second
#define pb push_back
#define ld long double
#define int ll
#define pll pair <ll,ll>
#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define TIME 1.0*clock()/CLOCKS_PER_SEC
using namespace std;
using namespace __gnu_pbds;
mt19937_64 gen(time(0));
int n,q;
vector <int> a;
vector <int> b;
void init() {
cin>>n;
a.resize(n);
for (int i = 0;i < n;i++)
cin>>a[i];
b.resize(n);
for (int i = 0;i < n;i++)
cin>>b[i];
}
ll ans = 0;
void output() {
cout<<ans<<'\n';
}
void solve() {
bool can = true;
int pos = -1;
int kol = 0;
for (int i = 0;i < n;i++)
{
if (a[i] > b[i]) {
if (can != true) ans+=kol;
can = true;
kol = 0;
}
else if (a[i] == b[i]) {++kol;can = false;}
else ++kol;
}
if (can != true) ans+=kol;
}
int dp[(int)(1e5) ^ 1];
void solve2() {
for (int i = 0;i < n;i++)
{
int kol = 0;
unordered_map <int,int> mp;
int oz = dp[i];
int mx = 0;
for (int j = i;j < n;j++)
{
mx = max(mx,a[j]);
++mp[b[j]];
dp[j + 1] = max(dp[j + 1],oz + mp[mx]);
oz = max(oz,dp[j]);
}
}
ans = dp[n];
}
int32_t main() {
srand(time(0));
//freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
IOS;
int test;
test = 1;
while (test--) {
init();
bool has = true;
for (int i = 0;i < n - 1;i++)
if (b[i] != b[i + 1]) {
has = false;
break;
}
if (has == true) solve();
else solve2();
output();
}
exit(0);}
/*3 5 7 9 10 11*/
/*5 14 13 8 14 11*/
Compilation message
exam.cpp: In function 'void solve()':
exam.cpp:34:9: warning: unused variable 'pos' [-Wunused-variable]
34 | int pos = -1;
| ^~~
exam.cpp: In function 'void solve2()':
exam.cpp:52:9: warning: unused variable 'kol' [-Wunused-variable]
52 | int kol = 0;
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
6 ms |
620 KB |
Output is correct |
3 |
Correct |
17 ms |
2540 KB |
Output is correct |
4 |
Correct |
13 ms |
2284 KB |
Output is correct |
5 |
Correct |
26 ms |
2668 KB |
Output is correct |
6 |
Correct |
14 ms |
2284 KB |
Output is correct |
7 |
Correct |
17 ms |
2540 KB |
Output is correct |
8 |
Correct |
27 ms |
2796 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1083 ms |
720 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |