oj.uz

Submission #1005983

# Submission time Handle Problem Language Result Execution time Memory
1005983 2024-06-23T09:57:31 Z makanhulia Best Place (NOI17_bestplace) C++17
100 / 100
 32 ms 2020 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i=a; i<=(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b); i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define int long long
#define ld long double
#define lb lower_bound
#define ceil(a,b) (a+(b-1))/b
#define ins insert
#define ub upper_bound
#define pb push_back
#define VI vector<int> 
#define VVI vector<VI> 
#define PII pair<int,int> 
#define VII vector<PII> 
#define size(x) x.size()
#define all(x) x.begin(), x.end()
#define fi first
#define se second
const int mod = 1e9+7;
const int N = 2e5 + 5;
// const int mod = 998244353;
void solve(){
    int n ;
    cin>>n;
    int x[n] , y[n];
    for(int i = 0 ;i<n;i++){
        cin>>x[i]>>y[i];
    }
    sort(x,x+n);
    sort(y,y+n);

    cout<<x[n/2]<<" "<<y[n/2]<<endl;

}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    cout<<setprecision(12)<<fixed;
    // cin>>t; 
    while(t--){
        
        solve();
    }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 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 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 1 ms 348 KB Output is correct
2 Correct 0 ms 344 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 348 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 11 ms 1884 KB Output is correct
2 Correct 17 ms 1880 KB Output is correct
3 Correct 16 ms 1884 KB Output is correct
4 Correct 12 ms 1884 KB Output is correct
5 Correct 14 ms 2020 KB Output is correct
6 Correct 16 ms 1884 KB Output is correct
7 Correct 16 ms 1884 KB Output is correct
8 Correct 16 ms 1884 KB Output is correct

Subtask #4
13.0 / 13.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 0 ms 348 KB Output is correct
5 Correct 0 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 0 ms 348 KB Output is correct

Subtask #5
17.0 / 17.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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 1880 KB Output is correct
2 Correct 32 ms 1880 KB Output is correct
3 Correct 16 ms 2016 KB Output is correct
4 Correct 24 ms 2020 KB Output is correct
5 Correct 24 ms 1880 KB Output is correct
6 Correct 24 ms 1884 KB Output is correct
7 Correct 24 ms 1884 KB Output is correct
8 Correct 24 ms 1884 KB Output is correct