oj.uz

Submission #253209

# Submission time Handle Problem Language Result Execution time Memory
253209 2020-07-27T12:12:44 Z nandonathaniel Best Place (NOI17_bestplace) C++14
100 / 100
 47 ms 3192 KB 
#include<bits/stdc++.h>
using namespace std;

int x[100005],y[100005];

int main(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin >> 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;
	return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2176 KB Output is correct
2 Correct 28 ms 2304 KB Output is correct
3 Correct 33 ms 2296 KB Output is correct
4 Correct 23 ms 2304 KB Output is correct
5 Correct 26 ms 2304 KB Output is correct
6 Correct 29 ms 2304 KB Output is correct
7 Correct 31 ms 2176 KB Output is correct
8 Correct 29 ms 2304 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 3192 KB Output is correct
2 Correct 46 ms 3064 KB Output is correct
3 Correct 45 ms 3064 KB Output is correct
4 Correct 39 ms 2296 KB Output is correct
5 Correct 46 ms 3072 KB Output is correct
6 Correct 45 ms 3064 KB Output is correct
7 Correct 47 ms 3068 KB Output is correct
8 Correct 47 ms 3068 KB Output is correct