oj.uz

Submission #968194

# Submission time Handle Problem Language Result Execution time Memory
968194 2024-04-23T08:25:44 Z Vladth11 Best Place (NOI17_bestplace) C++14
100 / 100
 35 ms 3388 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;

const ll NMAX = 100005;
const ll INF = 1e9;
const ll nrbits = 20;
const ll MOD = 998244353;

int x[NMAX];
int y[NMAX];

signed main() {
#ifdef HOME
    ifstream cin(".in");
    ofstream cout(".out");
#endif // HOME
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int i, n;
    cin >> n;
    for(i = 1;  i<= n; i++){
        cin >> x[i] >> y[i];
    }
    sort(x + 1, x + n + 1);
    sort(y + 1, y + n + 1);
    cout << x[(n + 1) / 2] << " " << y[(n + 1) / 2];
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 600 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 2116 KB Output is correct
2 Correct 18 ms 2192 KB Output is correct
3 Correct 18 ms 2384 KB Output is correct
4 Correct 14 ms 2360 KB Output is correct
5 Correct 19 ms 2392 KB Output is correct
6 Correct 19 ms 2396 KB Output is correct
7 Correct 26 ms 2288 KB Output is correct
8 Correct 18 ms 2360 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 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 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 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 3160 KB Output is correct
2 Correct 27 ms 3388 KB Output is correct
3 Correct 28 ms 3152 KB Output is correct
4 Correct 25 ms 2384 KB Output is correct
5 Correct 29 ms 3164 KB Output is correct
6 Correct 28 ms 3160 KB Output is correct
7 Correct 28 ms 3164 KB Output is correct
8 Correct 35 ms 3156 KB Output is correct