oj.uz

Submission #531652

# Submission time Handle Problem Language Result Execution time Memory
531652 2022-03-01T08:00:46 Z kebine Best Place (NOI17_bestplace) C++17
100 / 100
 104 ms 2384 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll mod = 1e9 + 7;
#pragma GCC optimize("Ofast")
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define sc second
#define endl '\n'
#define gl ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);



int main()
{
  int n; cin >> n;
  vi x(n), y(n);
  
  for(int i = 0; i < n; i++)
    cin >> x[i] >> y[i];
  
  sort(x.begin(), x.end());
  sort(y.begin(), y.end());
  
  cout << x[n/2] << ' ' << y[n/2] << endl;
}

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 288 KB Output is correct
3 Correct 1 ms 296 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 288 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 300 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 296 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 2068 KB Output is correct
2 Correct 75 ms 2232 KB Output is correct
3 Correct 85 ms 2192 KB Output is correct
4 Correct 68 ms 2192 KB Output is correct
5 Correct 62 ms 2180 KB Output is correct
6 Correct 62 ms 2180 KB Output is correct
7 Correct 82 ms 2068 KB Output is correct
8 Correct 77 ms 2116 KB Output is correct

Subtask #4
13.0 / 13.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 0 ms 292 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 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 2 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 304 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 2244 KB Output is correct
2 Correct 104 ms 2384 KB Output is correct
3 Correct 86 ms 2244 KB Output is correct
4 Correct 83 ms 2244 KB Output is correct
5 Correct 103 ms 2256 KB Output is correct
6 Correct 91 ms 2176 KB Output is correct
7 Correct 95 ms 2172 KB Output is correct
8 Correct 100 ms 2260 KB Output is correct