oj.uz

Submission #8096

# Submission time Handle Problem Language Result Execution time Memory
8096 2014-08-29T16:42:00 Z gs14004 전봇대 (KOI13_pole) C++
100 / 100
 32 ms 2648 KB 
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long lint;

struct pole{lint a,i;}d[100005];
int cmp(pole a, pole b){return a.a * b.i < b.a * a.i;}

lint n;
lint trial(int piv){
    lint res = 0;
    for (int i=0; i<n; i++) {
        res += max(d[i].a - piv * d[i].i, piv * d[i].i - d[i].a);
    }
    return res;
}

int main(){
    scanf("%lld",&n);
    for (int i=0; i<n; i++) {
        scanf("%lld",&d[i].a);
        d[i].i = i;
    }
    int s = 0, e = 1e9;
    while (s != e) {
        int m = (s+e)>>1;
        if(trial(m) > trial(m+1)) s = m+1;
        else e = m;
    }
    printf("%lld",trial(s));
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2648 KB Output is correct
2 Correct 0 ms 2648 KB Output is correct
3 Correct 0 ms 2648 KB Output is correct
4 Correct 0 ms 2648 KB Output is correct
5 Correct 0 ms 2648 KB Output is correct
6 Correct 0 ms 2648 KB Output is correct
7 Correct 0 ms 2648 KB Output is correct
8 Correct 0 ms 2648 KB Output is correct
9 Correct 0 ms 2648 KB Output is correct
10 Correct 0 ms 2648 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2648 KB Output is correct
2 Correct 0 ms 2648 KB Output is correct
3 Correct 4 ms 2648 KB Output is correct
4 Correct 4 ms 2648 KB Output is correct
5 Correct 4 ms 2648 KB Output is correct
6 Correct 0 ms 2648 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2648 KB Output is correct
2 Correct 28 ms 2648 KB Output is correct
3 Correct 32 ms 2648 KB Output is correct
4 Correct 16 ms 2648 KB Output is correct
5 Correct 28 ms 2648 KB Output is correct
6 Correct 28 ms 2648 KB Output is correct