oj.uz

Submission #499825

# Submission time Handle Problem Language Result Execution time Memory
499825 2021-12-29T16:01:04 Z PothePanda Best Place (NOI17_bestplace) C++14
100 / 100
 37 ms 2656 KB 
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(){
    int n;
    cin>>n;
    int x[n];
    int y[n];
    int x_curr,y_curr;
    for(int i =0;i<n;i++){
        cin>>x[i]>>y[i];
    }

    sort(x,x+n);
    sort(y,y+n);
    if(n%2==1){
        cout<<x[(n/2)]<<" "<<y[n/2];
    }
    else{
        int x_1 = x[(n/2)-1]+x[(n/2)];
        int y_1 = y[(n/2)-1]+y[(n/2)];
        cout<<x_1/2<<" "<<y_1/2;
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    int t = 1;
    //cin>>t;
    while(t--){
        solve();
    }
}

Compilation message

bestplace.cpp: In function 'void solve()':
bestplace.cpp:9:9: warning: unused variable 'x_curr' [-Wunused-variable]
    9 |     int x_curr,y_curr;
      |         ^~~~~~
bestplace.cpp:9:16: warning: unused variable 'y_curr' [-Wunused-variable]
    9 |     int x_curr,y_curr;
      |                ^~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 316 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 316 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1976 KB Output is correct
2 Correct 23 ms 2092 KB Output is correct
3 Correct 22 ms 2096 KB Output is correct
4 Correct 18 ms 2076 KB Output is correct
5 Correct 21 ms 2116 KB Output is correct
6 Correct 22 ms 2116 KB Output is correct
7 Correct 22 ms 2096 KB Output is correct
8 Correct 22 ms 2200 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2656 KB Output is correct
2 Correct 32 ms 2212 KB Output is correct
3 Correct 24 ms 2200 KB Output is correct
4 Correct 32 ms 2104 KB Output is correct
5 Correct 37 ms 2216 KB Output is correct
6 Correct 33 ms 2300 KB Output is correct
7 Correct 33 ms 2404 KB Output is correct
8 Correct 34 ms 2384 KB Output is correct