oj.uz

Submission #697161

# Submission time Handle Problem Language Result Execution time Memory
697161 2023-02-08T16:55:32 Z noobnessOVERLOADED Best Place (NOI17_bestplace) C++14
100 / 100
 90 ms 3100 KB 
#include<bits/stdc++.h>
using namespace std;

double median(int arr[], int size){
  sort(arr, arr+size);
  if(size % 2!=0)
    return (double)arr[size/2];
    return (double)(arr[(size-1)/2]+arr[size/2])/2.0;
}
int main(){
  int n;
  cin >> n;
  int arr[n];
  int brr[n];
  int a;
  int b;
  int ans;
  int bns;

  for(int i = 0; i<n; i++){
    cin >> a >> b;
    arr[i] = a;
    brr[i] = b;
  }

  ans = median(arr,n);
  bns = median(brr,n);

  cout << ans << " " << bns;
  return 0;
  }

Compilation message

bestplace.cpp: In function 'double median(int*, int)':
bestplace.cpp:6:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
    6 |   if(size % 2!=0)
      |   ^~
bestplace.cpp:8:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    8 |     return (double)(arr[(size-1)/2]+arr[size/2])/2.0;
      |     ^~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 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 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 2068 KB Output is correct
2 Correct 60 ms 2124 KB Output is correct
3 Correct 63 ms 2204 KB Output is correct
4 Correct 54 ms 2204 KB Output is correct
5 Correct 58 ms 2204 KB Output is correct
6 Correct 59 ms 2124 KB Output is correct
7 Correct 57 ms 2072 KB Output is correct
8 Correct 59 ms 2188 KB Output is correct

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

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 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 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 3100 KB Output is correct
2 Correct 86 ms 2988 KB Output is correct
3 Correct 78 ms 2956 KB Output is correct
4 Correct 65 ms 2188 KB Output is correct
5 Correct 87 ms 2960 KB Output is correct
6 Correct 88 ms 2972 KB Output is correct
7 Correct 86 ms 2892 KB Output is correct
8 Correct 90 ms 2960 KB Output is correct