oj.uz

Submission #468056

# Submission time Handle Problem Language Result Execution time Memory
468056 2021-08-26T09:45:23 Z Stickfish Exam (eJOI20_exam) C++17
0 / 100
 1 ms 332 KB 
#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 == a[j])
						++cnt;
				}
			}
		}
		ans = max(ans, cnt);
	}
	cout << ans << endl;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -