oj.uz

Submission #681858

# Submission time Handle Problem Language Result Execution time Memory
681858 2023-01-14T17:40:50 Z dsyz Best Place (NOI17_bestplace) C++17
100 / 100
 48 ms 3800 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  ios_base::sync_with_stdio(false);cin.tie(0);
  ll N;
  cin>>N;
  ll arr[N];
  ll arr2[N];
  for(ll i = 0;i < N;i++){
    ll a,b;
    cin>>a>>b;
    arr[i] = a;
    arr2[i] = b;
    // arr[i].second.first = a;
    // arr[i].second.second = b;
    // arr[i].first = a + b; 
  }
  sort(arr,arr + N);
  sort(arr2,arr2 + N);
  if(N % 2 == 0){
    ll sum1 = (arr[(N / 2) - 1] + arr[(N / 2)]) / 2;
    ll sum2 =  (arr2[(N / 2) - 1] + arr2[(N / 2)]) / 2;  
    //ll sum1 = (arr[(N / 2) - 1].second.first + arr[(N / 2)].second.first) / 2;
    //ll sum2 = (arr[(N / 2) - 1].second.second + arr[(N / 2)].second.second) / 2;
    cout<<sum1<<" "<<sum2<<'\n';
  }else if(N % 2 == 1){
    //cout<<N / 2<<'\n';
    ll sum1 = arr[N / 2];
    ll sum2 = arr2[N / 2];
    cout<<sum1<<" "<<sum2<<'\n';
  }  
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2884 KB Output is correct
2 Correct 23 ms 3024 KB Output is correct
3 Correct 22 ms 3012 KB Output is correct
4 Correct 18 ms 3068 KB Output is correct
5 Correct 20 ms 3024 KB Output is correct
6 Correct 22 ms 3028 KB Output is correct
7 Correct 24 ms 2892 KB Output is correct
8 Correct 21 ms 3012 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 3776 KB Output is correct
2 Correct 48 ms 3796 KB Output is correct
3 Correct 31 ms 3772 KB Output is correct
4 Correct 36 ms 3028 KB Output is correct
5 Correct 34 ms 3800 KB Output is correct
6 Correct 37 ms 3780 KB Output is correct
7 Correct 41 ms 3776 KB Output is correct
8 Correct 36 ms 3780 KB Output is correct