oj.uz

Submission #938277

# Submission time Handle Problem Language Result Execution time Memory
938277 2024-03-05T04:02:30 Z vjudge1 Sure Bet (CEOI17_sure) C++17
60 / 100
 2000 ms 13416 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
 
bool YES(bool f){ if(f) cout << "Yes\n" ; else cout << "No\n" ; return f ; }
void YES(){YES(1);}
void NO(){YES(0);}
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define ld long double
#define pii pair <int , int>
#define all(x) x.begin() , x.end()
#define ff first
#define ss second
#define endl '\n'
 
const int N = 1e6 + 5 ;
const int inf = 1e16 ;
const int mod = 1e9 + 8 ;
const double eps = 1e-8 ;
 
template <class T>
bool chmax( T& x , const T& y ){
  bool f = 0 ;
  if ( x < y ) x = y , f = 1 ;
  return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
  bool f = 0 ;
  if ( x > y ) x = y , f = 1 ;
  return f ;
}
 
//code
 
int n ;
ld res ;
ld a[N] , b[N] ;
ld p1[N] , p2[N] ;
ld ans[N] ;

void solve(){
	cout << fixed << setprecision(4) ;
	cin >> n ;
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a[i] >> b[i] ;
	sort ( a+1 , a + n+1 ) ; sort ( b+1 , b + n+1 ) ;
	reverse ( a+1 , a + n+1 ) ; reverse ( b+1 , b + n+1 ) ;
	for ( int i = 1 ; i <= n ; i ++ ){
		p1[i] = p1[i-1] + a[i] - 1 ;
		p2[i] = p2[i-1] + b[i] - 1 ;
	}
	for ( int i = 1 ; i <= n ; i ++ ){
		for ( int j = 1 ; j <= n ; j ++ ) chmax ( ans[i] , min ( p2[j]-i , p1[i]-j ) ) ;
		chmax ( res , ans[i] ) ;
	} cout << res ;
}

signed main(){
    ios ;
	int t = 1 ;
	//cin >> t ;
	while ( t -- ) solve() ;
}

Compilation message

sure.cpp: In function 'void fopn(std::string)':
sure.cpp:10:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sure.cpp:10:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 4 ms 4440 KB Output is correct
13 Correct 4 ms 4444 KB Output is correct
14 Correct 5 ms 4444 KB Output is correct
15 Correct 5 ms 4444 KB Output is correct
16 Correct 5 ms 4444 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 4 ms 4440 KB Output is correct
13 Correct 4 ms 4444 KB Output is correct
14 Correct 5 ms 4444 KB Output is correct
15 Correct 5 ms 4444 KB Output is correct
16 Correct 5 ms 4444 KB Output is correct
17 Execution timed out 2057 ms 13416 KB Time limit exceeded
18 Halted 0 ms 0 KB -