oj.uz

Submission #218134

# Submission time Handle Problem Language Result Execution time Memory
218134 2020-04-01T10:07:14 Z quocnguyen1012 Best Place (NOI17_bestplace) C++14
100 / 100
 51 ms 3088 KB 
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;

const int bit = 1 << 17;

signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  #ifdef LOCAL
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  #endif // LOCAL
  int n; cin >> n;
  vector<int> 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];
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 2176 KB Output is correct
2 Correct 33 ms 2296 KB Output is correct
3 Correct 34 ms 2424 KB Output is correct
4 Correct 27 ms 2304 KB Output is correct
5 Correct 32 ms 2296 KB Output is correct
6 Correct 33 ms 2304 KB Output is correct
7 Correct 34 ms 2176 KB Output is correct
8 Correct 34 ms 2304 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 3072 KB Output is correct
2 Correct 48 ms 3064 KB Output is correct
3 Correct 38 ms 3072 KB Output is correct
4 Correct 42 ms 2304 KB Output is correct
5 Correct 48 ms 3064 KB Output is correct
6 Correct 49 ms 3064 KB Output is correct
7 Correct 51 ms 3064 KB Output is correct
8 Correct 47 ms 3088 KB Output is correct