oj.uz

Submission #924960

# Submission time Handle Problem Language Result Execution time Memory
924960 2024-02-10T07:08:26 Z sleepntsheep Best Place (NOI17_bestplace) C++17
100 / 100
 36 ms 2904 KB 
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <complex>

using u32 = unsigned;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

using namespace std;
using pt = complex<f80>;
#define ALL(x) begin(x), end(x)
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 200005

int n, x[N], y[N], b[N], zx, zy;;

int main()
{
    ShinLena;
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> x[i] >> y[i], b[i] = i;

    sort(b+1, b+1+n, [](int i, int j){ return x[i] < x[j]; });
    zx = x[b[n/2+1]];
    sort(b+1, b+1+n, [](int i, int j){ return y[i] < y[j]; });
    zy = y[b[n/2+1]];
    cout << zx << ' ' << zy;



    return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2652 KB Output is correct
2 Correct 20 ms 2904 KB Output is correct
3 Correct 20 ms 2648 KB Output is correct
4 Correct 15 ms 2652 KB Output is correct
5 Correct 18 ms 2652 KB Output is correct
6 Correct 20 ms 2652 KB Output is correct
7 Correct 20 ms 2652 KB Output is correct
8 Correct 20 ms 2652 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 2652 KB Output is correct
2 Correct 30 ms 2656 KB Output is correct
3 Correct 17 ms 2652 KB Output is correct
4 Correct 27 ms 2648 KB Output is correct
5 Correct 29 ms 2652 KB Output is correct
6 Correct 30 ms 2652 KB Output is correct
7 Correct 36 ms 2652 KB Output is correct
8 Correct 29 ms 2648 KB Output is correct