oj.uz

답안 #250598

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
250598 2020-07-18T13:42:14 Z Vladikus004 Doktor (COCI17_doktor) C++14
50 / 100
 125 ms 10208 KB 
#include <bits/stdc++.h>
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;

const int N = 500000 + 3;
int n, a[N], pref[N], now[N];
int get_sum(int l, int r){
    if (!l) return pref[r];
    return pref[r] - pref[l - 1];
}

vector <pii> v1, v2;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> a[i];
        if (a[i] == i + 1) pref[i] = 1;
        if (i) pref[i] += pref[i - 1];
        int mid = (a[i] + i) / 2;
        if ((a[i] + i) & 1){
            v1.push_back({abs(i - mid), mid});
        }else{
            v2.push_back({abs(i - mid), mid});
        }
    }
    sort(all(v1));
    sort(all(v2));
    pair <int, pii> ans1 = {-inf,{-inf, -inf}};
    for (int i = 0; i < v1.size(); i++){
        now[v1[i].second]++;
        ans1 = max(ans1, {now[v1[i].second] -
                  get_sum(v1[i].second - v1[i].first, v1[i].second + v1[i].first), v1[i]});
    }
    fill(now, now + n, 0);
    pair <int, pii> ans2 = {-inf,{-inf, -inf}};
    for (int i = 0; i < v2.size(); i++){
        now[v2[i].second]++;
        ans2 = max(ans2, {now[v2[i].second] -
                  get_sum(v2[i].second - v2[i].first - 1, v2[i].second + v2[i].first), v2[i]});
    }
    if (ans1 > ans2){
        cout << a[ans1.second.second - ans1.second.first] << " " << a[ans1.second.second + ans1.second.first] << "\n";
    }else{
        cout << a[ans2.second.second - ans2.second.first - 1] << " " << a[ans2.second.second + ans2 .second.first] << "\n";
    }
}

Compilation message

doktor.cpp: In function 'int main()':
doktor.cpp:40:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v1.size(); i++){
                     ~~^~~~~~~~~~~
doktor.cpp:47:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v2.size(); i++){
                     ~~^~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Integer 0 violates the range [1, 12]

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Integer 0 violates the range [1, 2000]
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 640 KB Output is correct
2 Incorrect 82 ms 6776 KB Integer 0 violates the range [1, 300000]

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 2264 KB Output is correct
2 Incorrect 23 ms 2416 KB Integer 0 violates the range [1, 100000]

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 10072 KB Output is correct
2 Incorrect 124 ms 10208 KB Integer 0 violates the range [1, 500000]

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 6228 KB Output is correct
2 Correct 89 ms 9944 KB Output is correct