oj.uz

Submission #955004

# Submission time Handle Problem Language Result Execution time Memory
955004 2024-03-29T06:48:53 Z anonym1 Best Place (NOI17_bestplace) C++14
100 / 100
 28 ms 3164 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

typedef long long int ll;
typedef pair<int, int> pii;

#define endl "\n"
#define ff first
#define ss second

const int N = 2e5+20;
const ll INF = 1e18+10;
const int mod = 1e9+7;

int x[N], y[N];

void solve()
{
	int n; cin >> n;
	for(int i=1; i<=n; i++){
		cin >> x[i] >> y[i];
	}

	sort(x+1, x+n+1); sort(y+1, y+n+1);

	if(n%2) cout << x[n/2+1] << " " << y[n/2+1] << endl;
	else cout << x[n/2] << " " << y[n/2] << endl;

}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    // cout.precision(10);
    
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif

    int t;
    // cin >> t;
    t=1;

    for(int i=1; i<=t; i++){
        // cout << "Case #" << i << ": ";
        solve();
    }

}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1112 KB Output is correct
2 Correct 18 ms 1116 KB Output is correct
3 Correct 18 ms 1112 KB Output is correct
4 Correct 13 ms 1112 KB Output is correct
5 Correct 16 ms 1132 KB Output is correct
6 Correct 18 ms 1116 KB Output is correct
7 Correct 19 ms 1112 KB Output is correct
8 Correct 18 ms 1116 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 1116 KB Output is correct
2 Correct 27 ms 2948 KB Output is correct
3 Correct 19 ms 3164 KB Output is correct
4 Correct 25 ms 2468 KB Output is correct
5 Correct 27 ms 3164 KB Output is correct
6 Correct 27 ms 3164 KB Output is correct
7 Correct 28 ms 3164 KB Output is correct
8 Correct 28 ms 3132 KB Output is correct