oj.uz

답안 #1087220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087220 2024-09-12T10:01:34 Z peacebringer1667 Giraffes (JOI22_giraffes) C++17
10 / 100
 7000 ms 440 KB 
#include<bits/stdc++.h>
#define ll long long
#define ldb long double
#define fi first
#define se second
#define sza(a) (int)a.size()
#define pir pair<int,int>
#define pirll pair<ll,ll>
using namespace std;
const int maxn = 8e3 + 5;

int a[maxn],pos[maxn];
namespace sub1{
	bool check(int n){
		return n <= 7;
	}
	
	bool good(const vector <int> &vec){
		int n = vec.size(),M = 0,m = n + 1;
		for (int l = 0 ; l < n - 2 ; l++){
		  M = 0;m = n + 1;
		  for (int r = l + 2 ; r < n ; r++){
		  	 M = max(M,vec[r - 1]);
		  	 m = min(m,vec[r - 1]);
		  	
		  	 if (M > max(vec[l],vec[r]) && m < min(vec[l],vec[r])) 
			     return 0;
		}
	 }
		return 1;
	}
	
	void solve(int n){
		vector <int> vec(n);
		for (int i = 0 ; i < n ; i++) vec[i] = i + 1;
		int res = n;
		
		do{
			int tmp = 0;
			if (good(vec)){
				
				for (int i = 1 ; i <= n ; i++)
				  tmp += (a[i] != vec[i - 1]);
			    res = min(res,tmp); 
			}
		} while (next_permutation(vec.begin(),vec.end()));
	    
	    cout << res;
	}
}


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	
	int n;
	cin >> n;
	for (int i = 1 ; i <= n ; i++) cin >> a[i];
	
	
	sub1::solve(n);
    

	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 424 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 424 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 52 ms 440 KB Output is correct
14 Correct 525 ms 440 KB Output is correct
15 Correct 6151 ms 344 KB Output is correct
16 Correct 6361 ms 440 KB Output is correct
17 Execution timed out 7075 ms 348 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 424 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 52 ms 440 KB Output is correct
14 Correct 525 ms 440 KB Output is correct
15 Correct 6151 ms 344 KB Output is correct
16 Correct 6361 ms 440 KB Output is correct
17 Execution timed out 7075 ms 348 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 424 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 52 ms 440 KB Output is correct
14 Correct 525 ms 440 KB Output is correct
15 Correct 6151 ms 344 KB Output is correct
16 Correct 6361 ms 440 KB Output is correct
17 Execution timed out 7075 ms 348 KB Time limit exceeded
18 Halted 0 ms 0 KB -