oj.uz

Submission #494310

# Submission time Handle Problem Language Result Execution time Memory
494310 2021-12-15T05:24:29 Z BeanZ Best Place (NOI17_bestplace) C++14
100 / 100
 37 ms 2480 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 3e5 + 5;
long long mod = 1e9 + 7;
const int lim = 4e5 + 5;
const int lg = 21;
const int base = 37;
const long double eps = 1e-6;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    if (fopen("tests.inp", "r")){
        freopen("tests.inp", "r", stdin);
        freopen("tests.out", "w", stdout);
    }
    ll n;
    cin >> n;
    vector<ll> vx, vy;
    for (int i = 1; i <= n; i++){
        ll x, y;
        cin >> x >> y;
        vx.push_back(x);
        vy.push_back(y);
    }
    sort(vx.begin(), vx.end());
    sort(vy.begin(), vy.end());
    cout << vx[vx.size() / 2] << " " << vy[vy.size() / 2];
}
/*
Ans:

Out:
*/

Compilation message

bestplace.cpp: In function 'int main()':
bestplace.cpp:15:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         freopen("tests.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bestplace.cpp:16:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |         freopen("tests.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2288 KB Output is correct
2 Correct 24 ms 2344 KB Output is correct
3 Correct 24 ms 2272 KB Output is correct
4 Correct 19 ms 2240 KB Output is correct
5 Correct 21 ms 2284 KB Output is correct
6 Correct 24 ms 2288 KB Output is correct
7 Correct 24 ms 2328 KB Output is correct
8 Correct 24 ms 2304 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 312 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 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2244 KB Output is correct
2 Correct 35 ms 2352 KB Output is correct
3 Correct 24 ms 2480 KB Output is correct
4 Correct 32 ms 2304 KB Output is correct
5 Correct 37 ms 2348 KB Output is correct
6 Correct 34 ms 2392 KB Output is correct
7 Correct 35 ms 2452 KB Output is correct
8 Correct 37 ms 2368 KB Output is correct