oj.uz

Submission #655099

# Submission time Handle Problem Language Result Execution time Memory
655099 2022-11-03T04:00:05 Z true22 Best Place (NOI17_bestplace) C++14
100 / 100
 50 ms 3804 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef long double ld;

// short forms // 
#define f first
#define s second
#define nl "\n"
#define pb push_back

#define all(x) x.begin(), x.end()

// debug // 
#define pv(x) for(auto k : x){cout << k << " ";} cout << nl;
#define pp(x) cout << x.f << " " << x.s << nl;
#define bv(x) if (x) cout << "true"; else cout << "false";
#define gp(x, y) x << " " << y 

// loop //
#define fur(i, a, b) for(ll i = a; i <= b; i++)
#define ruf(i, a, b) for(ll i = a; i >= b; i--)

// pair // 
typedef pair<ll, ll> pl;

// vector // 
typedef vector<ll> vl;
typedef vector<vl> vvl;    
typedef vector<pl> vp;

// constants // 
const ll INF = 1e17; 
const ll mod = 1e9 + 7;
const ll S = 1e5 + 5;

void solve(){
    ll n;
    cin >> n;
    vl x(n);
    vl y(n);
    fur(i, 0, n-1) cin >> x[i] >> y[i];
    sort(all(x));
    sort(all(y));
    ll mx, my;
    if (n%2 == 0){
        mx = (x[(n/2)] + x[(n/2) - 1])/2;
        my = (y[(n/2)] + y[(n/2) - 1])/2;
    }else{
        mx = x[(n+1)/2 - 1];
        my = y[(n+1)/2 - 1];
    }
    cout << mx << ' ' << my << nl;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

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

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2912 KB Output is correct
2 Correct 22 ms 3048 KB Output is correct
3 Correct 22 ms 3020 KB Output is correct
4 Correct 16 ms 3040 KB Output is correct
5 Correct 21 ms 3028 KB Output is correct
6 Correct 21 ms 3044 KB Output is correct
7 Correct 22 ms 2900 KB Output is correct
8 Correct 21 ms 3156 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 3804 KB Output is correct
2 Correct 36 ms 3796 KB Output is correct
3 Correct 37 ms 3788 KB Output is correct
4 Correct 36 ms 3032 KB Output is correct
5 Correct 47 ms 3804 KB Output is correct
6 Correct 50 ms 3784 KB Output is correct
7 Correct 46 ms 3784 KB Output is correct
8 Correct 38 ms 3788 KB Output is correct