oj.uz

Submission #783147

# Submission time Handle Problem Language Result Execution time Memory
783147 2023-07-14T16:00:02 Z pera Exam (eJOI20_exam) C++17
12 / 100
 16 ms 1904 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int N = 2e5 + 1;


main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int n , oK = 1;cin >> n;
	vector<int> a(n + 1) , b(n + 1);
	for(int i = 1;i <= n;i ++){
		cin >> a[i];
	}
	for(int i = 1;i <= n;i ++){
		cin >> b[i];
		if(i != 1) oK &= (b[i] == b[i - 1]);
	}
	if(oK){
		int c = 0;
		for(int i = 1;i <= n;i ++){
			int cc = 0 , k = 0;
			while(a[i] <= b[i] && i <= n){
				if(a[i] == b[i]) k = 1;
				++ cc , ++ i; 
			}
			if(k) c += cc;
		}
		cout << c << endl;
	}else{
		oK = 1;
		for(int i = 2;i <= n;i ++){
			oK &= (a[i] > a[i - 1]);
		}
		if(oK){
			vector<int> dp(n + 1);
			vector<vector<int>> c(n + 1 , vector<int>(n + 1));
			for(int i = 1;i <= n;i ++){
				for(int j = 1;j <= n;j ++){
					c[i][j] = c[i][j - 1] + (b[j] == a[i]);
				}
			}
			dp[1] = (a[1] == b[1]);
			for(int i = 2;i <= n;i ++){
				for(int j = 1;j <= i;j ++){
					dp[i] = max(dp[i] , dp[j - 1] + c[i][i] - c[i][j - 1]);
				}
			}
			cout << dp[n] << endl;
		}
	}
}

Compilation message

exam.cpp:9:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    9 | main(){
      | ^~~~

Subtask #1
0 / 14.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 11 ms 1740 KB Output is correct
4 Correct 8 ms 1884 KB Output is correct
5 Correct 16 ms 1900 KB Output is correct
6 Correct 9 ms 1904 KB Output is correct
7 Correct 9 ms 1900 KB Output is correct
8 Correct 16 ms 1876 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 212 KB Output isn't correct
2 Halted 0 ms 0 KB -