oj.uz

답안 #892818

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892818 2023-12-26T03:27:47 Z votranngocvy Best Place (NOI17_bestplace) C++14
64 / 100
 24 ms 3728 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
const int N = 1e5 + 5;
int n;
pii a[N];

namespace sub3 {
    bool check_condition() {
        for (int i = 1; i <= n; i++)
            if (a[i].se != 0) return false;
        return true;
    }
    void solve() {
        sort(a + 1,a + n + 1);
        int mid = (n + 1) / 2;
        cout << a[mid].fi << " " << a[mid].se << "\n";
    }
}

namespace sub4 {
    const int inf = 0x3f3f3f3f3f3f3f3f;
    bool check_condition() {
        if (n > 100) return false;
        for (int i = 1; i <= n; i++)
            if (a[i].fi > 100 || a[i].se > 100) return false;
        return true;
    }
    void solve() {
        int ans = inf,x = -1,y = -1;
        for (int i = 0; i <= 100; i++)
            for (int j = 0; j <= 100; j++) {
                int res = 0;
                for (int k = 1; k <= n; k++)
                    res += abs(i - a[k].fi) + abs(j - a[k].se);
                if (res < ans) ans = res,x = i,y = j;
            }
        cout << x << " " << y << "\n";
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i].fi >> a[i].se;
    if (n == 2) cout << a[1].fi << " " << a[1].se << "\n";
    else if (sub3::check_condition()) sub3::solve();
    else if (sub4::check_condition()) sub4::solve();
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #3
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 2908 KB Output is correct
2 Correct 22 ms 3160 KB Output is correct
3 Correct 18 ms 3152 KB Output is correct
4 Correct 14 ms 3164 KB Output is correct
5 Correct 18 ms 3160 KB Output is correct
6 Correct 18 ms 3160 KB Output is correct
7 Correct 19 ms 2904 KB Output is correct
8 Correct 24 ms 3180 KB Output is correct

Subtask #4
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 756 KB Output is correct
8 Correct 1 ms 468 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 17 ms 3728 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -