oj.uz

Submission #236746

# Submission time Handle Problem Language Result Execution time Memory
236746 2020-06-03T07:46:48 Z Vimmer Krov (COCI17_krov) C++14
70 / 140
 1500 ms 768 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 2> a2;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int n, a[N];

ll calc(ll x, int pos)
{
    if (x - pos <= 0) return 1e18;

    ll sum = 0;

    for (int i = 0; i < pos; i++) sum += abs(a[i] - (x - abs(pos - i)));

    for (int i = pos + 1; i < n; i++) sum += abs(a[i] - (x - abs(pos - i)));

    return sum + abs(x - a[pos]);
}

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;

    for (int i = 0; i < n; i++) cin >> a[i];

    ll ans = 1e18;

    for (int i = 0; i < n; i++)
    {
        int l = 0, r = 1e9;

        while (l + 10 < r)
        {
            int mdl = l + (r - l) / 3;

            int mdr = r - (r - l) / 3;

            if (calc(mdl, i) > calc(mdr, i)) l = mdl; else r = mdr;
        }

        for (int x = l; x <= r; x++) ans = min(ans, calc(x, i));
    }

    cout << ans << endl;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 384 KB Output is correct
2 Correct 190 ms 388 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 384 KB Output is correct
2 Correct 174 ms 392 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 360 ms 504 KB Output is correct
2 Correct 387 ms 396 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 656 ms 384 KB Output is correct
2 Correct 703 ms 396 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1231 ms 400 KB Output is correct
2 Correct 900 ms 400 KB Output is correct

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1583 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1585 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1592 ms 512 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1590 ms 640 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1593 ms 768 KB Time limit exceeded
2 Halted 0 ms 0 KB -