oj.uz

Submission #949196

# Submission time Handle Problem Language Result Execution time Memory
949196 2024-03-19T03:35:48 Z vjudge1 Best Place (NOI17_bestplace) C++17
100 / 100
 36 ms 2044 KB 
#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>*/
template<class S,class T>
bool chmin(S &a,const T &b) {
	return a>b?(a=b)==b:false;
}
template<class S,class T>
bool chmax(S &a,const T &b) {
	return a<b?(a=b)==b:false;
}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll N=1e5+5;
const ll M=6e6+5;
void solve(){
    ll i,j;
    ll n;
    cin>>n;
    vll x(n),y(n);
    for(i=0;i<n;i++)cin>>x[i]>>y[i];
    sort(all(x));
    sort(all(y));
    cout<<x[(n+1)/2-1]<<' '<<y[(n+1)/2-1]<<endl;
}

signed main(){
	start();
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}
/*




*/

Compilation message

bestplace.cpp: In function 'void solve()':
bestplace.cpp:43:10: warning: unused variable 'j' [-Wunused-variable]
   43 |     ll i,j;
      |          ^

Subtask #1
3.0 / 3.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 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 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 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 468 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 16 ms 1880 KB Output is correct
2 Correct 19 ms 1884 KB Output is correct
3 Correct 19 ms 1884 KB Output is correct
4 Correct 15 ms 2040 KB Output is correct
5 Correct 18 ms 1884 KB Output is correct
6 Correct 19 ms 1884 KB Output is correct
7 Correct 20 ms 1884 KB Output is correct
8 Correct 19 ms 1880 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 344 KB Output is correct
6 Correct 0 ms 348 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 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
7 Correct 0 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 36 ms 1884 KB Output is correct
2 Correct 28 ms 1884 KB Output is correct
3 Correct 18 ms 2044 KB Output is correct
4 Correct 25 ms 1884 KB Output is correct
5 Correct 27 ms 1884 KB Output is correct
6 Correct 31 ms 1888 KB Output is correct
7 Correct 28 ms 1880 KB Output is correct
8 Correct 28 ms 1884 KB Output is correct