oj.uz

Submission #381338

# Submission time Handle Problem Language Result Execution time Memory
381338 2021-03-25T06:33:22 Z AdiZer0 Doktor (COCI17_doktor) C++17
50 / 100
 1000 ms 2284 KB 
#include <bits/stdc++.h>

#define pb push_back
#define whole(x) x.begin(), x.end()
#define sz(x) (int)x.size()

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = (int)5e5 + 7;
const int INF = (int)1e9 + 7;
const ll linf = (ll)1e18 + 1;

int a[N];
int main() {
    int n; scanf ("%d", &n);
    int ans = 0, ansL = -1, ansR = -1;
    for (int i = 1; i <= n; ++i) { 
        scanf ("%d", a + i);
        if (a[i] == i) ++ans;
        ansL = ansR = a[i];
    }
    for (int i = 1; i <= n; ++i) {
        int l = i, r = a[i];
        if (l > r) swap(l, r);
        int cur = 0;
        while (l <= r) {
            if (l == a[r]) ++cur;
            if (r == a[l]) ++cur;
            l++, r--;
        }   
        if (cur > ans) { 
            ans = cur;
            if (a[i] < i) ansL = a[a[i]], ansR = a[i];
            else ansL = a[i], ansR = a[a[i]];
        } 
    }
    printf ("%d %d\n", ansL, ansR);
    return 0;
}

Compilation message

doktor.cpp: In function 'int main()':
doktor.cpp:18:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |     int n; scanf ("%d", &n);
      |            ~~~~~~^~~~~~~~~~
doktor.cpp:21:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   21 |         scanf ("%d", a + i);
      |         ~~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 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 364 KB Output is correct
2 Correct 4 ms 364 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 364 KB Output is correct
2 Execution timed out 1093 ms 1516 KB Time limit exceeded

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 2284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 1388 KB Time limit exceeded
2 Halted 0 ms 0 KB -