oj.uz

답안 #783135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
783135 2023-07-14T15:52:50 Z pera Xor Sort (eJOI20_xorsort) C++17
0 / 100
 1 ms 212 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 , C = 0 , ok = 0;
		for(int i = 1;i <= n;i ++){
			if(a[i] > b[i]){
				if(ok) c += C;
				C = 0;
				continue;
			}
			if(a[i] == b[i]) ok = 1;
			++ C;
		}
		if(ok) c += C;
		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] + c[i][i] - c[i][j - 1]);
				}
			}
			cout << dp[n] << endl;
		}
	}
}

Compilation message

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

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -