oj.uz

답안 #116980

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116980 2019-06-14T10:45:51 Z FutymyClone Doktor (COCI17_doktor) C++14
10 / 100
 296 ms 41264 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 5;

int n, a[N], f[N], p[N];
vector <pair <int, int> > vec[N + N];

int main(){
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    for (int i = 1; i <= n; i++) {
        int x = i - a[i];
        p[a[i]] = i;
        vec[2 * i - 1 - x].push_back({min(i, a[i]), max(i, a[i])});
        f[i] = f[i - 1] + (a[i] == i);
    }

    int Max = -1, ans1 = 0, ans2 = 0;
    for (int i = 1; i <= 2 * n - 1; i++) {
        sort(vec[i].begin(), vec[i].end(), greater <pair <int, int> >());
        for (int j = 0; j < vec[i].size(); j++) {
            int res = j + 1 - (f[vec[i][j].second] - f[vec[i][j].first - 1]);
            if (res > Max) {
                Max = res;
                ans1 = vec[i][j].first;
                ans2 = vec[i][j].second;
            }
        }
    }

    if (p[ans1] > p[ans2]) swap(ans1, ans2);
    cout << ans1 << " " << ans2;
    return 0;
}

Compilation message

doktor.cpp: In function 'int main()':
doktor.cpp:23:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < vec[i].size(); j++) {
                         ~~^~~~~~~~~~~~~~~
doktor.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
doktor.cpp:12:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 22 ms 23808 KB Output isn't correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 23808 KB Output is correct
2 Incorrect 27 ms 23920 KB Output isn't correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 23936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 24056 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 23936 KB Output is correct
2 Incorrect 32 ms 23928 KB Output isn't correct

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 24184 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 72 ms 27000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 296 ms 41264 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 153 ms 34040 KB Output isn't correct
2 Halted 0 ms 0 KB -