Submission #2872919


Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;

long long s=1000000000000;
int n;
int a[200000];
int main()
{
    int i,j;
    long long b;
    long long s0;
    cin>>n;
    for (i=1;i<=n;i++)
    {
    	scanf ("%d",&a[i]);
	}
	for (i=1;i<=n;i++)
    {
    	b=a[i]-i;
    	s0=0;
    	for (j=1;j<=n;j++)
    	{
    		if (a[j]>(b+j))
    		{
    			s0+=a[j]-(b+j);
			}
			else
			{
				s0+=(b+j)-a[j];
			}
		}

		if (s>s0)
		{
			s=s0;
		}
	}
	cout<<s<<endl;
	return 0;
}

Submission Info

Submission Time
Task C - Linear Approximation
User HuaJinHuan
Language C++14 (GCC 5.4.1)
Score 0
Code Size 565 Byte
Status WA
Exec Time 2103 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
      scanf ("%d",&a[i]);
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 4
AC × 9
WA × 2
TLE × 8
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sample_04.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt TLE 2103 ms 384 KB
subtask_1_03.txt WA 987 ms 384 KB
subtask_1_04.txt TLE 2103 ms 640 KB
subtask_1_05.txt TLE 2103 ms 896 KB
subtask_1_06.txt TLE 2103 ms 1024 KB
subtask_1_07.txt TLE 2103 ms 1024 KB
subtask_1_08.txt TLE 2103 ms 1024 KB
subtask_1_09.txt WA 25 ms 1024 KB
subtask_1_10.txt TLE 2103 ms 1024 KB
subtask_1_11.txt TLE 2103 ms 1024 KB