Submission #949166

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
949166	2024-03-19T03:10:52 Z	vjudge1	Best Place (NOI17_bestplace)	C++17	48 / 100	21 ms	3184 KB

bestplace

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
 
using namespace std;
using namespace __gnu_pbds; 
 
#define int long long
#define ff first
#define ss second
#define rep(i,s,f) for(int i = s;i < f;i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define ordered_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> 

const int INF = 1e18,N = 2e5 + 1;
const int p = 31,m = 1e9 + 9,MOD7 = 1e9 + 7;

int binpow(int n,int k){	
	if(k == 0){
		return 1 ;
	} else if(k % 2 == 0){
		int b = binpow(n,k / 2);
		return b * b ;
	} else{
		return n * binpow(n,k - 1) ;
	}

}

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);
	cout << x[n / 2] << " " << 0 << "\n";
	
;	
}

signed main(){
	
	ios_base::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	
	int t = 1;
	//~ cin >> t;
	while(t--){
		solve();
	}
	
}

Subtask #1
0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Incorrect	0 ms	344 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

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	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	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	1884 KB	Output is correct
2	Correct	17 ms	1880 KB	Output is correct
3	Correct	19 ms	3160 KB	Output is correct
4	Correct	15 ms	3164 KB	Output is correct
5	Correct	16 ms	3160 KB	Output is correct
6	Correct	18 ms	3164 KB	Output is correct
7	Correct	21 ms	2908 KB	Output is correct
8	Correct	18 ms	3184 KB	Output is correct