Submission #1059925

#	Time	Username	Problem	Language	Result	Execution time	Memory
1059925		vjudge1	Best Place (NOI17_bestplace)	C++17	100 / 100	30 ms	3952 KiB

bestplace

/*
    Author:52ducbanh
    The best say which I think is:Never give up _ Let me see your attemption because you deserve to get it.
*/
#include<bits/stdc++.h>
using namespace std;
using namespace chrono;

mt19937 rd(steady_clock::now().time_since_epoch().count());

#define name "task"

#define ll long long
#define ld long double
#define pll pair<ll,ll>

#define fi first
#define se second
#define eb emplace_back
#define pb push_back
#define el '\n'
#define all(s) s.begin(),s.end()
#define bit(mask,i) ((mask >> i) & 1)
//For_constant//
const int MAX = 3e6 + 7;
const ll MOD = 1e9 + 7;
const ll MOD_power = 1e9 + 7;
const ll INF32 = 1e9 + 7;
const ll INF64 = 1e18;
const ll BASE = 333;
//For_initial_function//
template<typename T> T power(T a,T n) {
    T res = 1;
    while(n > 0)
    {
        if(n & 1)
        {
            res *= a;
            res %= MOD_power;
        }
        a *= a;
        a %= MOD_power;
        n >>= 1;
    }
    return res;
}
template<typename T> T gcd(T a,T b) {
    if(a == 0 || b == 0) return a + b;
    else return gcd(b,a % b);
}
template<typename T> T lcm(T a,T b) {
    return a/gcd(a,b) * b;
}
void initial(){
    srand(time(NULL));
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    if(fopen(name".INP","r"))
    {
        freopen(name".INP","r",stdin);
        freopen(name".OUT","w",stdout);
    }
    time_t now = time(0);
    cerr << ctime(&now);
}
//For_solving//

int n;
pair<ll,ll> a[MAX];

bool cmp(pair<ll,ll> &a,pair<ll,ll> &b)
{
    return a.se < b.se;
}

void solve()
{
    cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i].fi >> a[i].se;
    sort(a +  1,a + n + 1);
    if(n % 2 == 0)
    {
        ll xm = (a[n/2].fi + a[n/2 + 1].fi)/2;
        sort(a +  1,a + n + 1,cmp);
        ll ym = (a[n/2].se + a[n/2 + 1].se)/2;
        cout << xm << ' ' << ym << el;
    }
    else
    {
        ll xm = a[n - n/2].fi;
        sort(a +  1,a + n + 1,cmp);
        ll ym = a[n - n/2].se;
        cout << xm << ' ' << ym << el;
    }


}

void process_test()
{
    initial();
    int test;test = 1;
    while(test--) solve();
}

int main()
{
    //Started_time
    time_point<high_resolution_clock> st,ed;
    st = high_resolution_clock::now();
    //Solving
    process_test();
    //End_time
    ed = high_resolution_clock::now();
    auto start = time_point_cast<milliseconds>(st).time_since_epoch().count();
    auto end = time_point_cast<milliseconds>(ed).time_since_epoch().count();
    cerr <<"Time_wasting(milliseconds): " << end - start << el;
    return 0;
}

Compilation message (stderr)

bestplace.cpp: In function 'void initial()':
bestplace.cpp:60:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |         freopen(name".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
bestplace.cpp:61:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         freopen(name".OUT","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 20 / 20
• Subtask 3: 28 / 28
• Subtask 4: 13 / 13
• Subtask 5: 17 / 17
• Subtask 6: 19 / 19