oj.uz

Submission #495248

# Submission time Handle Problem Language Result Execution time Memory
495248 2021-12-18T07:58:22 Z nameIsJatin Best Place (NOI17_bestplace) C++17
100 / 100
 37 ms 3924 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll; 
#define all(x) x.begin(), x.end()

ll n; 
int oned(vector<ll> d) {
    if (n%2 == 1) {
        int mid = floor(n/2);
        return d[mid];
    } else {
        int mid = floor(( (n/2) + (n/2) -1 )/2);
        return d[mid];
    }
    return 0;
}


int solver() {
    cin>>n ;
    vector<ll> x(n), y(n);

    for(int i = 0; i< n; i++) {
        cin>> x[i] >> y[i];
    }


    sort(all(x)); sort(all(y));
    
    if (equal(x.begin()+1 , x.end(), x.begin())) {
        cout<< x[0] <<" "<<  oned(y) << "\n";
        return 0;
    } else if(equal(y.begin()+1, y.end(), y.begin())) {
        cout<< oned(x)<<  " "<< y[0] << "\n";
        return 0;
    } 

    if (n%2 == 1) {
        ll mX = x[n/2];
        ll mY = y[n/2];
        cout<< mX << " " << mY << "\n";
        return 0;
    } else {
        int mid = floor(( (n/2) + (n/2) -1 )/2);
        ll mX = x[mid];
        ll mY = y[mid];
        cout<< mX << " " << mY << "\n";
        return 0;
    }
    return 0;
}


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

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3652 KB Output is correct
2 Correct 24 ms 3788 KB Output is correct
3 Correct 24 ms 3776 KB Output is correct
4 Correct 18 ms 3780 KB Output is correct
5 Correct 20 ms 3780 KB Output is correct
6 Correct 23 ms 3824 KB Output is correct
7 Correct 28 ms 3752 KB Output is correct
8 Correct 22 ms 3776 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 3788 KB Output is correct
2 Correct 33 ms 3780 KB Output is correct
3 Correct 24 ms 3768 KB Output is correct
4 Correct 29 ms 3012 KB Output is correct
5 Correct 37 ms 3924 KB Output is correct
6 Correct 34 ms 3780 KB Output is correct
7 Correct 34 ms 3796 KB Output is correct
8 Correct 34 ms 3800 KB Output is correct