Submission #924957

#	Time	Username	Problem	Language	Result	Execution time	Memory
924957		sleepntsheep	Best Place (NOI17_bestplace)	C++17	3 / 100	15 ms	1116 KiB

bestplace

#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>
#include <complex>

using u32 = unsigned;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;

using namespace std;
using pt = complex<f80>;
#define ALL(x) begin(x), end(x)
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
#define N 200005

int n;
array<int, 2> a[N];

int main()
{
    ShinLena;
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i][0] >> a[i][1];

    if (n == 2)
    {
        cout << (a[1][0] + a[2][0]) / 2 << ' ' << (a[1][1] + a[2][1]) /2 ;

    }
    return 0;
}

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