oj.uz

답안 #5886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
5886 2014-05-21T08:06:14 Z baneling100 전봇대 (KOI13_pole) C++
52 / 100
 28 ms 2260 KB 
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>

using namespace std;

pair <int,int> y[100000];
int N, x[100000], Hab;
long long Ans;

void input(void)
{
    int i;

    scanf("%d",&N);
    for(i=0 ; i<N ; i++)
    {
        scanf("%d",&x[i]);
        if(i)
            y[i]=make_pair(x[i]/i,i);
    }
    Hab=N*(N-1)/2;
    Hab/=2;
    sort(y+1,y+N);
}

void process(void)
{
    int i, s=0, v;
    long long temp=0;

    for(i=1 ; i<N ; i++)
    {
        s+=y[i].second;
        if(Hab<=s)
        {
            v=i;
            break;
        }
    }
    for(i=1 ; i<N ; i++)
    {
        Ans+=abs((long long)i*y[v].first-x[i]);
        temp+=abs((long long)i*(y[v].first+1)-x[i]);
    }
    if(Ans>temp)
        Ans=temp;
}

void output(void)
{
    printf("%lld",Ans);
}

int main(void)
{
    input();
    process();
    output();

    return 0;
}

Subtask #1
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2260 KB Output is correct
2 Correct 0 ms 2260 KB Output is correct
3 Incorrect 0 ms 2260 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2260 KB Output is correct
2 Correct 0 ms 2260 KB Output is correct
3 Correct 0 ms 2260 KB Output is correct
4 Correct 0 ms 2260 KB Output is correct
5 Correct 0 ms 2260 KB Output is correct
6 Correct 0 ms 2260 KB Output is correct
7 Correct 0 ms 2260 KB Output is correct
8 Correct 0 ms 2260 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2260 KB Output is correct
2 Correct 0 ms 2260 KB Output is correct
3 Correct 4 ms 2260 KB Output is correct
4 Correct 0 ms 2260 KB Output is correct
5 Correct 4 ms 2260 KB Output is correct
6 Correct 0 ms 2260 KB Output is correct

Subtask #4
0.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -