Submission #468058

#TimeUsernameProblemLanguageResultExecution timeMemory
468058StickfishExam (eJOI20_exam)C++17
0 / 100
1 ms332 KiB
#include <iostream> #include <bitset> using namespace std; const int MAXN = 11; int a[MAXN]; int b[MAXN]; signed main(){ int n; cin >> n; for(int i = 0; i < n; ++i){ cin >> a[i]; } for(int i = 0; i < n; ++i){ cin >> b[i]; } int ans = 0; for(int m = 0; m < (1 << n); ++m){ bitset<MAXN> bs = m; bs[n] = 1; bs[0] = 1; int cnt = 0; for(int i = 0; i < n; ++i){ if(bs[i]){ int mx = a[i]; for(int j = i + 1; !bs[j]; ++j) mx = max(mx, a[j]); for(int j = i; !bs[j] || j == i; ++j){ if(mx == b[j]) ++cnt; } } } ans = max(ans, cnt); } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...