oj.uz

Submission #320748

# Submission time Handle Problem Language Result Execution time Memory
320748 2020-11-09T18:05:42 Z egas Best Place (NOI17_bestplace) C++14
100 / 100
 41 ms 2184 KB 
#include <bits/stdc++.h>

using namespace std;

long long getManHat(long long x, vector<long long> &a) {

    long long res=0;

    for(long long i = 0 ; i < a.size() ; i++) {

        res+=abs(x-a[i]);

    }

    return res;

}

int32_t main() {

    ios_base::sync_with_stdio(false);

    cin.tie(0);

    long long n;

    cin >> n;

    vector<long long> X,Y;

    for(long long i = 0 ; i < n ; i++) {

        long long x;

        cin >> x;

        long long y;

        cin >> y;

        X.push_back(x);

        Y.push_back(y);

    }

    sort(X.begin(),X.end());

    sort(Y.begin(),Y.end());

    long long resx;

    if(n%2==0) {

        if(getManHat(X[X.size()/2],X)<getManHat(X[(X.size()/2)-1],X)) {

            resx=X[X.size()/2];

        } else {

            resx=X[(X.size()/2)-1];

        }

    } else {

        resx=X[X.size()/2];

    }

    long long resy;

    if(n%2==0) {

        if(getManHat(Y[Y.size()/2],Y)<getManHat(Y[(Y.size()/2)-1],Y)) {

            resy=Y[Y.size()/2];

        } else {

            resy=Y[(Y.size()/2)-1];

        }

    } else {

        resy=Y[Y.size()/2];

    }

    cout << resx << ' ' << resy << '\n';

    return 0;

}

Compilation message

bestplace.cpp: In function 'long long int getManHat(long long int, std::vector<long long int>&)':
bestplace.cpp:9:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(long long i = 0 ; i < a.size() ; i++) {
      |                           ~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2144 KB Output is correct
2 Correct 33 ms 2184 KB Output is correct
3 Correct 29 ms 2144 KB Output is correct
4 Correct 23 ms 2144 KB Output is correct
5 Correct 27 ms 2144 KB Output is correct
6 Correct 29 ms 2144 KB Output is correct
7 Correct 34 ms 2144 KB Output is correct
8 Correct 32 ms 2144 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 2176 KB Output is correct
2 Correct 40 ms 2144 KB Output is correct
3 Correct 28 ms 2144 KB Output is correct
4 Correct 37 ms 2144 KB Output is correct
5 Correct 41 ms 2144 KB Output is correct
6 Correct 40 ms 2144 KB Output is correct
7 Correct 41 ms 2144 KB Output is correct
8 Correct 40 ms 2144 KB Output is correct