oj.uz

Submission #467460

# Submission time Handle Problem Language Result Execution time Memory
467460 2021-08-23T05:01:46 Z Ghost_in_the_Wire Best Place (NOI17_bestplace) C++17
100 / 100
 45 ms 3728 KB 
#include <bits/stdc++.h>
#define FIO             ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long INT;
typedef vector<INT> ARR;

int main() {
    FIO;
    INT n;
    cin >> n;
    ARR x = {};
    ARR y = {};
    for (int i = 0; i < n; i++) {
        INT temp1, temp2;
        cin >> temp1 >> temp2;
        x.push_back(temp1);
        y.push_back(temp2);
    }
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    INT ansx;
    INT ansy;
    if (n%2 == 0) {
        ansx = x[n/2];
        ansy = y[n/2];
    }
    else {
        ansx = x[(n-1)/2];
        ansy = y[(n-1)/2];
    }
    cout << ansx << " " << ansy << "\n";
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 308 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 1 ms 316 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 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3136 KB Output is correct
2 Correct 30 ms 3248 KB Output is correct
3 Correct 33 ms 3184 KB Output is correct
4 Correct 27 ms 3244 KB Output is correct
5 Correct 30 ms 3232 KB Output is correct
6 Correct 37 ms 3248 KB Output is correct
7 Correct 30 ms 3168 KB Output is correct
8 Correct 31 ms 3264 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 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 332 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 332 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 43 ms 3632 KB Output is correct
2 Correct 44 ms 3628 KB Output is correct
3 Correct 32 ms 3728 KB Output is correct
4 Correct 39 ms 3248 KB Output is correct
5 Correct 45 ms 3688 KB Output is correct
6 Correct 43 ms 3632 KB Output is correct
7 Correct 44 ms 3688 KB Output is correct
8 Correct 43 ms 3632 KB Output is correct