oj.uz

Submission #482700

# Submission time Handle Problem Language Result Execution time Memory
482700 2021-10-26T05:22:15 Z Sneha_codes Best Place (NOI17_bestplace) C++14
100 / 100
 40 ms 3032 KB 
#include <bits/stdc++.h>
 
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define debug(x) cerr << #x << " = " << x << endl
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
 
void solve() {
    int n;
    cin >> n;
    vi vx(n), vy(n);
 
    rep (i, 0, n) {
        cin >> vx[i] >> vy[i];
    }
 
    sort(all(vx));
    sort(all(vy));
    cout << vx[n / 2] << ' ' << vy[n / 2] << endl;
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    int tt = 1;
 
    for (int i = 1; i <= tt; ++i) {
        solve();
    }
 
    return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.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 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1112 KB Output is correct
2 Correct 23 ms 1108 KB Output is correct
3 Correct 22 ms 2276 KB Output is correct
4 Correct 16 ms 2244 KB Output is correct
5 Correct 19 ms 2268 KB Output is correct
6 Correct 21 ms 2248 KB Output is correct
7 Correct 21 ms 2204 KB Output is correct
8 Correct 22 ms 2252 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 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 216 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 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 336 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 39 ms 1100 KB Output is correct
2 Correct 37 ms 3000 KB Output is correct
3 Correct 24 ms 3016 KB Output is correct
4 Correct 31 ms 2252 KB Output is correct
5 Correct 40 ms 3008 KB Output is correct
6 Correct 33 ms 3020 KB Output is correct
7 Correct 36 ms 3032 KB Output is correct
8 Correct 35 ms 2940 KB Output is correct