oj.uz

답안 #1110179

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1110179 2024-11-09T01:12:19 Z thunopro Growing Vegetables is Fun 5 (JOI24_vegetables5) C++14
4 / 100
 71 ms 7504 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 200009
#define ll long long 
#define pb push_back 
#define fi first 
#define se second 
#define left id<<1
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1 
#define TIME ( 1.0*clock() / CLOCKS_PER_SEC )
const int mod = 1e9+7 ;
const int INF = 1e9 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ; 

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void add ( int &a , int b ) 
{
	a += b ; 
	if ( a >= mod ) a -= mod ; 
	if ( a < 0 ) a += mod ; 
}

void rf () 
{
	freopen ("bai1.inp","r",stdin) ;
}

mt19937 rng (time(0)) ; 

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n ; 
int a [maxn] ; 
int b [maxn] , c [maxn] ; 
int res = INF ; 

pii T [maxn] ; 
int tt [maxn] ; 
void check1 () 
{
	int ans = 0 ;  
	int Prev = -1 ; 
	int Max = 0 , cur = 0 ; 
	for ( int i = 1 ; i <= 2*n ; i ++ ) 
	{
		chkmax (ans,abs (T[tt[i]].fi-a[i])); 
		if ( T[tt[i]].se == Prev ) cur ++ ; 
		else cur = 1 ; 
		Prev = T[tt[i]].se ; 
		chkmax (Max,cur) ; 
	}
	if ( Max == n ) chkmin (res,ans) ; 
}
void sub1 () 
{
	for ( int i = 1 ; i <= n ; i ++ ) T [i] = {b[i],0} , T [i+n] = {c[i],1} ; 
	for ( int i = 1 ; i <= 2*n ; i ++ ) tt [i] = i ; 
	check1() ; 
	while (next_permutation(tt+1,tt+2*n+1)) check1() ; 
	cout << res << "\n" ; 
}
int main () 
{
	ios_base::sync_with_stdio(0); 
	cin.tie(0);cout.tie(0); 
//	rf () ;
	cin >> n ; 
	for ( int i = 1 ; i <= 2*n ; i ++ ) cin >> a [i] ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> b [i] ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> c [i] ; 
	
	if ( n <= 5 ) sub1 () ; 	

}

Compilation message

Main.cpp: In function 'void rf()':
Main.cpp:32:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 4432 KB Output is correct
2 Correct 2 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 70 ms 4600 KB Output is correct
7 Correct 71 ms 4432 KB Output is correct
8 Correct 2 ms 4432 KB Output is correct
9 Correct 69 ms 4432 KB Output is correct
10 Correct 69 ms 4600 KB Output is correct
11 Correct 70 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 4432 KB Output is correct
2 Correct 2 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 70 ms 4600 KB Output is correct
7 Correct 71 ms 4432 KB Output is correct
8 Correct 2 ms 4432 KB Output is correct
9 Correct 69 ms 4432 KB Output is correct
10 Correct 69 ms 4600 KB Output is correct
11 Correct 70 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Incorrect 1 ms 2384 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 4432 KB Output is correct
2 Correct 2 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 70 ms 4600 KB Output is correct
7 Correct 71 ms 4432 KB Output is correct
8 Correct 2 ms 4432 KB Output is correct
9 Correct 69 ms 4432 KB Output is correct
10 Correct 69 ms 4600 KB Output is correct
11 Correct 70 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Incorrect 1 ms 2384 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 20 ms 7504 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 4432 KB Output is correct
2 Correct 2 ms 4432 KB Output is correct
3 Correct 1 ms 4432 KB Output is correct
4 Correct 2 ms 4432 KB Output is correct
5 Correct 1 ms 4432 KB Output is correct
6 Correct 70 ms 4600 KB Output is correct
7 Correct 71 ms 4432 KB Output is correct
8 Correct 2 ms 4432 KB Output is correct
9 Correct 69 ms 4432 KB Output is correct
10 Correct 69 ms 4600 KB Output is correct
11 Correct 70 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Incorrect 1 ms 2384 KB Output isn't correct
14 Halted 0 ms 0 KB -