oj.uz

Submission #209543

# Submission time Handle Problem Language Result Execution time Memory
209543 2020-03-14T13:45:08 Z model_code Best Place (NOI17_bestplace) C++17
100 / 100
 81 ms 3308 KB 
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n; scanf("%d", &n);
  vector<int> x, y;
  for(int i = 0; i < n; i++) {
    int a, b; scanf("%d%d", &a, &b);
    x.push_back(a);
    y.push_back(b);
  }
  sort(x.begin(), x.end());
  sort(y.begin(), y.end());
  if(n % 2 == 1) {
    printf("%d %d\n", x[n / 2], y[n / 2]);
  }else {
    printf("%d %d\n", (x[n / 2] + x[n / 2 - 1]) / 2, (y[n / 2] + y[n / 2 - 1]) / 2);
  }
  return 0;
}

Compilation message

bestplace.cpp: In function 'int main()':
bestplace.cpp:4:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int n; scanf("%d", &n);
          ~~~~~^~~~~~~~~~
bestplace.cpp:7:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int a, b; scanf("%d%d", &a, &b);
               ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2412 KB Output is correct
2 Correct 46 ms 2540 KB Output is correct
3 Correct 42 ms 2540 KB Output is correct
4 Correct 35 ms 2544 KB Output is correct
5 Correct 48 ms 2536 KB Output is correct
6 Correct 43 ms 2540 KB Output is correct
7 Correct 42 ms 2412 KB Output is correct
8 Correct 43 ms 2536 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 380 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 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 61 ms 3304 KB Output is correct
2 Correct 60 ms 3308 KB Output is correct
3 Correct 45 ms 3304 KB Output is correct
4 Correct 55 ms 2668 KB Output is correct
5 Correct 59 ms 3308 KB Output is correct
6 Correct 55 ms 3304 KB Output is correct
7 Correct 60 ms 3308 KB Output is correct
8 Correct 81 ms 3304 KB Output is correct