oj.uz

Submission #949216

# Submission time Handle Problem Language Result Execution time Memory
949216 2024-03-19T03:51:26 Z vjudge1 Best Place (NOI17_bestplace) C++17
100 / 100
 26 ms 1368 KB 
//#pragma GCC optimizer("03") ;
#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 unsigned short
#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 = 2e5 + 5 ;
const int inf = 1e9 ;
const int mod = 1e9 + 7 ;
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 , a , b ;
int x[N] , y[N] ;

void solve(){
	
	cin >> n ;
	for ( int i = 0 ; i < n ; i ++ ) cin >> x[i] >> y[i] ;
	int l = 0 , r = inf ;
	while ( l < r ){
		int mid = ( l + r ) / 2 , c1 = 0 , c2 = 0 ;
		for ( int i = 0 ; i < n ; i ++ ) c1 += abs(x[i]-mid) ;
		for ( int i = 0 ; i < n ; i ++ ) c2 += abs(x[i]-mid-1) ;
		if ( c1 < c2 ) r = mid ;
		else l = mid + 1 ;
	} a = l ; l = 0 , r = inf ;
	while ( l < r ){
		int mid = ( l + r ) / 2 , c1 = 0 , c2 = 0 ;
		for ( int i = 0 ; i < n ; i ++ ) c1 += abs(y[i]-mid) ;
		for ( int i = 0 ; i < n ; i ++ ) c2 += abs(y[i]-mid-1) ;
		if ( c1 < c2 ) r = mid ;
		else l = mid + 1 ;
	} b = l ;
	cout << a << ' ' << b ;
}

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

Compilation message

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

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1116 KB Output is correct
2 Correct 21 ms 1116 KB Output is correct
3 Correct 24 ms 1116 KB Output is correct
4 Correct 21 ms 1256 KB Output is correct
5 Correct 23 ms 1016 KB Output is correct
6 Correct 23 ms 1112 KB Output is correct
7 Correct 21 ms 1116 KB Output is correct
8 Correct 21 ms 1368 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 480 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 1200 KB Output is correct
2 Correct 26 ms 1368 KB Output is correct
3 Correct 25 ms 1116 KB Output is correct
4 Correct 23 ms 1116 KB Output is correct
5 Correct 26 ms 1112 KB Output is correct
6 Correct 25 ms 1116 KB Output is correct
7 Correct 24 ms 1116 KB Output is correct
8 Correct 25 ms 1112 KB Output is correct