oj.uz

Submission #861700

# Submission time Handle Problem Language Result Execution time Memory
861700 2023-10-16T16:44:00 Z wakandaaa Best Place (NOI17_bestplace) C++17
100 / 100
 28 ms 3384 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1 << (x))
#define file ""
using namespace std;

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long l, long long r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = 1e9 + 7; // 998244353;
const int inf = INT_MAX;
const long long llinf = LLONG_MAX;
const int lg = 25; // lg + 1

template<class X, class Y> bool minimize(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maximize(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
template<class X, class Y> bool add(X &a, Y b) {
    a += b;
    while (a >= mod) a -= mod;
    while (a < 0) a += mod;
    return true;
}

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

    // freopen(file".inp", "r",stdin);
    // freopen(file".out", "w",stdout);

    int n;
    cin >> n;
    vector<int> dx, dy;
    for (int i = 0; i < n; ++i) {
    	int x, y;
    	cin >> x >> y;
    	dx.emplace_back(x);
    	dy.emplace_back(y);
    }

    sort(all(dx));
    sort(all(dy));

    cout << dx[n / 2] << ' ' << dy[n / 2] << '\n';
    
    return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2508 KB Output is correct
2 Correct 21 ms 2512 KB Output is correct
3 Correct 19 ms 2512 KB Output is correct
4 Correct 14 ms 2508 KB Output is correct
5 Correct 17 ms 2512 KB Output is correct
6 Correct 21 ms 2608 KB Output is correct
7 Correct 19 ms 2508 KB Output is correct
8 Correct 22 ms 2508 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3280 KB Output is correct
2 Correct 28 ms 3280 KB Output is correct
3 Correct 20 ms 3272 KB Output is correct
4 Correct 25 ms 2512 KB Output is correct
5 Correct 28 ms 3280 KB Output is correct
6 Correct 28 ms 3276 KB Output is correct
7 Correct 28 ms 3384 KB Output is correct
8 Correct 28 ms 3276 KB Output is correct