oj.uz

Submission #966055

# Submission time Handle Problem Language Result Execution time Memory
966055 2024-04-19T10:03:33 Z detectivebowon Best Place (NOI17_bestplace) C++14
100 / 100
 70 ms 7004 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,x[100007],y[1000007],ans,ansx,ansy,sumx,sumy;
signed main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>x[i]>>y[i];
    } 
    sort(x+1,x+1+n);
    sort(y+1,y+1+n);
    if(n%2!=0)
        cout<<x[n/2+1]<<" "<<y[n/2+1];
    else
        cout<<(x[n/2]+x[n/2+1])/2<<" "<<(y[n/2]+y[n/2+1])/2;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 5972 KB Output is correct
2 Correct 45 ms 5980 KB Output is correct
3 Correct 46 ms 6000 KB Output is correct
4 Correct 43 ms 6044 KB Output is correct
5 Correct 45 ms 5980 KB Output is correct
6 Correct 45 ms 5968 KB Output is correct
7 Correct 44 ms 5968 KB Output is correct
8 Correct 46 ms 5968 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 6736 KB Output is correct
2 Correct 66 ms 6748 KB Output is correct
3 Correct 65 ms 7004 KB Output is correct
4 Correct 51 ms 6140 KB Output is correct
5 Correct 66 ms 6748 KB Output is correct
6 Correct 66 ms 6864 KB Output is correct
7 Correct 70 ms 6992 KB Output is correct
8 Correct 65 ms 6732 KB Output is correct