oj.uz

Submission #92112

# Submission time Handle Problem Language Result Execution time Memory
92112 2019-01-01T14:59:10 Z tjrwodnjs999 격자 보존하기 (GA9_preserve) C++11
65 / 100
 23 ms 1916 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m,k,arr[100005],a[100005],Max,sum;
int main()
{
    scanf("%d%d%d",&n,&m,&k);
    for(int i=0;i<m;i++) scanf("%d",&arr[i]);
    for(int i=0;i<m-1;i++) a[i]=arr[i+1]-arr[i]-1;
    sort(a,a+100005,greater<int>());
    for(int i=0;i<k/2;i++) sum+=a[i]; Max=sum;

    sum=0; for(int i=0;i<(k-1)/2;i++) sum+=a[i]; Max=max(Max,sum+max(arr[0]-1,n-arr[m-1]));

    if(k>=2){
        sum=arr[0]-1; sum+=n-arr[m-1];
        for(int i=0;i<(k-2)/2;i++) sum+=a[i];
        Max=max(Max,sum);
    }

    printf("%d",Max);
}

Compilation message

preserve.cpp: In function 'int main()':
preserve.cpp:10:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(int i=0;i<k/2;i++) sum+=a[i]; Max=sum;
     ^~~
preserve.cpp:10:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     for(int i=0;i<k/2;i++) sum+=a[i]; Max=sum;
                                       ^~~
preserve.cpp:6:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&m,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~~
preserve.cpp:7:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<m;i++) scanf("%d",&arr[i]);
                          ~~~~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 632 KB Output is correct
2 Correct 3 ms 636 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 3 ms 760 KB Output is correct
10 Correct 3 ms 632 KB Output is correct
11 Correct 3 ms 760 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 3 ms 636 KB Output is correct
17 Correct 3 ms 760 KB Output is correct
18 Correct 3 ms 632 KB Output is correct
19 Correct 3 ms 760 KB Output is correct
20 Correct 3 ms 760 KB Output is correct
21 Correct 3 ms 760 KB Output is correct
22 Correct 3 ms 632 KB Output is correct
23 Correct 3 ms 760 KB Output is correct
24 Correct 3 ms 760 KB Output is correct
25 Correct 3 ms 760 KB Output is correct
26 Correct 3 ms 764 KB Output is correct
27 Correct 3 ms 760 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 0 ms 632 KB Output is correct
30 Correct 3 ms 760 KB Output is correct
31 Correct 3 ms 760 KB Output is correct
32 Correct 3 ms 632 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 4 ms 760 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 632 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 3 ms 760 KB Output is correct
10 Correct 3 ms 632 KB Output is correct
11 Correct 3 ms 760 KB Output is correct
12 Correct 3 ms 760 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 3 ms 632 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 3 ms 760 KB Output is correct
19 Correct 3 ms 760 KB Output is correct
20 Correct 3 ms 760 KB Output is correct
21 Correct 3 ms 760 KB Output is correct
22 Correct 3 ms 760 KB Output is correct
23 Correct 3 ms 764 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 760 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 3 ms 760 KB Output is correct
5 Correct 3 ms 760 KB Output is correct
6 Correct 3 ms 760 KB Output is correct
7 Correct 3 ms 760 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 3 ms 760 KB Output is correct
11 Correct 3 ms 760 KB Output is correct
12 Correct 4 ms 760 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 4 ms 756 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 3 ms 760 KB Output is correct
17 Correct 3 ms 632 KB Output is correct
18 Correct 3 ms 760 KB Output is correct
19 Correct 3 ms 760 KB Output is correct
20 Correct 3 ms 632 KB Output is correct
21 Correct 3 ms 760 KB Output is correct
22 Correct 3 ms 760 KB Output is correct
23 Correct 3 ms 632 KB Output is correct
24 Correct 3 ms 760 KB Output is correct
25 Correct 3 ms 760 KB Output is correct
26 Correct 3 ms 752 KB Output is correct
27 Correct 3 ms 636 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1144 KB Output is correct
2 Correct 23 ms 1016 KB Output is correct
3 Correct 22 ms 1052 KB Output is correct
4 Correct 22 ms 1016 KB Output is correct
5 Correct 22 ms 1144 KB Output is correct
6 Correct 22 ms 1144 KB Output is correct
7 Correct 23 ms 1144 KB Output is correct
8 Correct 23 ms 1016 KB Output is correct
9 Correct 13 ms 888 KB Output is correct
10 Correct 9 ms 864 KB Output is correct
11 Correct 22 ms 1120 KB Output is correct
12 Correct 21 ms 1144 KB Output is correct
13 Correct 21 ms 1016 KB Output is correct
14 Correct 20 ms 1016 KB Output is correct
15 Correct 21 ms 1144 KB Output is correct
16 Correct 21 ms 1144 KB Output is correct
17 Correct 20 ms 1144 KB Output is correct
18 Correct 21 ms 1144 KB Output is correct
19 Correct 21 ms 1144 KB Output is correct
20 Correct 3 ms 760 KB Output is correct
21 Correct 3 ms 760 KB Output is correct
22 Correct 20 ms 1016 KB Output is correct
23 Correct 22 ms 1144 KB Output is correct
24 Correct 19 ms 1016 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 1916 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -