oj.uz

Submission #116934

# Submission time Handle Problem Language Result Execution time Memory
116934 2019-06-14T06:42:54 Z FutymyClone Doktor (COCI17_doktor) C++14
70 / 100
 66 ms 6136 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 5;

int n, a[N], cnt[2 * 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];
        if (x & 1) cnt[2 * i - 1 - x]++;
        else cnt[(i - x / 2) * 2 - 1]++;
    }

    int Max = -1, pos = 0;
    for (int i = 1; i <= 2 * n - 1; i++) if (cnt[i] > Max) Max = cnt[i], pos = i;
    if (pos & 1) {
        pos = (pos + 1) / 2;
        int d = min(pos - 1, n - pos);
        cout << a[pos - d] << " " << a[pos + d];
    }
    else {
        pos /= 2;
        int d = min(pos - 1, n - (pos + 1));
        cout << a[pos - d] << " " << a[pos + 1 + d];
    }
    return 0;
}

Compilation message

doktor.cpp: In function 'int main()':
doktor.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
doktor.cpp:11: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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 304 KB Output is correct
2 Correct 2 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 33 ms 1528 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 1408 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 6108 KB Output is correct
2 Correct 53 ms 2296 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3704 KB Output is correct
2 Correct 57 ms 6136 KB Output is correct