oj.uz

Submission #481773

# Submission time Handle Problem Language Result Execution time Memory
481773 2021-10-21T19:03:47 Z sicho_mohit Best Place (NOI17_bestplace) C++17
100 / 100
 79 ms 1844 KB 
#include<bits/stdc++.h>
using namespace std;
#define ff               first
#define ss              second
#define ll             long long
#define pb              push_back
#define pii             pair<int ,int>
#define pll      		pair<long ,long>
#define mii             map<int,int>
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define ull             unsigned long long
#define fastio          ios_base::sync_with_stdio();cin.tie(NULL)
const int mod = 1e9 + 7;
ll gcd(ll a, ll b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}
ll binopow(ll b, ll pow) { if (pow == 0) return 1 ; ll ans; ans = binopow(b, pow / 2); ans = (ans * ans) % mod; if (pow % 2) ans = (ans * b) % mod; return ans; }
ll inv(ll a , ll mod) { return binopow(a, mod - 2); }
//------------------------------------------------------------------------------------------------------------------------------------------//
int main ()
{
	fastio;
	ll n ;
	cin >> n;
	ll x[n];
	ll y[n];
	for (int i = 0; i < n; i++)
	{
		cin >> x[i];
		cin >> y[i];
	}
	sort(x, x + n);
	sort(y, y + n);
	cout << x[n / 2] << " " << y[n / 2] << "\n";
}

Subtask #1
3.0 / 3.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1824 KB Output is correct
2 Correct 54 ms 1740 KB Output is correct
3 Correct 53 ms 1844 KB Output is correct
4 Correct 49 ms 1824 KB Output is correct
5 Correct 52 ms 1740 KB Output is correct
6 Correct 53 ms 1740 KB Output is correct
7 Correct 51 ms 1740 KB Output is correct
8 Correct 57 ms 1828 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 1740 KB Output is correct
2 Correct 79 ms 1740 KB Output is correct
3 Correct 70 ms 1824 KB Output is correct
4 Correct 61 ms 1740 KB Output is correct
5 Correct 79 ms 1740 KB Output is correct
6 Correct 79 ms 1828 KB Output is correct
7 Correct 78 ms 1824 KB Output is correct
8 Correct 79 ms 1740 KB Output is correct