oj.uz

Submission #160314

# Submission time Handle Problem Language Result Execution time Memory
160314 2019-10-27T01:36:22 Z model_code Mean (info1cup19_mean) C++17
100 / 100
 4 ms 504 KB 
#include <bits/stdc++.h>

using namespace std;
int n,i,j,k,h,x,Max,a[204],d[204][204];
int main()
{
    scanf ("%d", &n);
    assert ((1<=n) && (n<=200));
    for (i=1;i<=n;i++)
    {
        scanf ("%d", &a[i]);
        assert ((1<=a[i]) && (a[i]<=1000000000));
    }
    for (i=1;i<=n;i++)
        d[i][i]=a[i];
    for (i=1;i<=(n-1);i++)
        for (j=1;j<=(n-i);j++)
        {
            k=i+j;
            Max=-2000000000;
            for (h=j;h<=(k-1);h++)
            {
                x=d[j][h]+d[h+1][k];
                x/=2;
                if (x>Max)
                    Max=x;
            }
            d[j][k]=Max;
        }
    printf ("%d\n", Max);
    return 0;
}

Compilation message

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

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 252 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 252 KB Output is correct
9 Correct 2 ms 424 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 372 KB Output is correct
16 Correct 4 ms 376 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 4 ms 504 KB Output is correct
19 Correct 4 ms 504 KB Output is correct
20 Correct 4 ms 504 KB Output is correct