oj.uz

Submission #127796

# Submission time Handle Problem Language Result Execution time Memory
127796 2019-07-10T06:14:53 Z 송준혁(#3112) JOI15_aaqqz (JOI15_aaqqz) C++14
10 / 100
 5 ms 380 KB 
#include <bits/stdc++.h>
using namespace std;

int N;
int ans;
int A[110], B[110];

int main(){
    scanf("%d %*d", &N);
    for (int i=1; i<=N; i++) scanf("%d", &A[i]);
    for (int i=1; i<=N; i++) for (int j=i; j<=N; j++){
        for (int k=1; k<=N; k++) B[k] = A[k];
        sort(B+i, B+j+1);
        for (int k=1; k<=N; k++) {
            for (int l=0; 0<k-l && k+l<=N; l++){
                if (B[k-l] != B[k+l]) break;
                ans = max(ans, 2*l+1);
            }
            for (int l=1; 0<k-l+1 && k+l<=N; l++){
                if (B[k-l+1] != B[k+l]) break;
                ans = max(ans, 2*l);
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}

Compilation message

aaqqz.cpp: In function 'int main()':
aaqqz.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %*d", &N);
     ~~~~~^~~~~~~~~~~~~~
aaqqz.cpp:10:35: 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 3 ms 256 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 252 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 380 KB Output is correct
10 Correct 3 ms 360 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 256 KB Output is correct
17 Correct 3 ms 256 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 3 ms 256 KB Output is correct
21 Correct 3 ms 252 KB Output is correct
22 Correct 3 ms 252 KB Output is correct
23 Correct 3 ms 256 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 256 KB Output is correct
26 Correct 3 ms 380 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 256 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 256 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 3 ms 256 KB Output is correct
36 Correct 3 ms 256 KB Output is correct
37 Correct 3 ms 256 KB Output is correct

Subtask #2
0 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 256 KB Output is correct
4 Correct 3 ms 252 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 380 KB Output is correct
10 Correct 3 ms 360 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 256 KB Output is correct
17 Correct 3 ms 256 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 3 ms 256 KB Output is correct
21 Correct 3 ms 252 KB Output is correct
22 Correct 3 ms 252 KB Output is correct
23 Correct 3 ms 256 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 256 KB Output is correct
26 Correct 3 ms 380 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 256 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 3 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 256 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 3 ms 256 KB Output is correct
36 Correct 3 ms 256 KB Output is correct
37 Correct 3 ms 256 KB Output is correct
38 Incorrect 5 ms 256 KB Output isn't correct
39 Halted 0 ms 0 KB -