oj.uz

Submission #66406

# Submission time Handle Problem Language Result Execution time Memory
66406 2018-08-10T11:56:53 Z forestryks Vudu (COCI15_vudu) C++14
42 / 140
 1000 ms 64716 KB 
///////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;

// #define int long long

#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define FILE_IO(x) freopen((string(x) + ".in").c_str(), "r", stdin); freopen((string(x) + ".out").c_str(), "w", stdout)
#define f first
#define s second
#define x1 x1qwer
#define y1 y1qwer
#define right right123
#define left left123
#define foreach(it, v) for (auto it : v)
#define rep(it, n) for (int it = 0; it < n; ++it)
#define forin(it, l, r) for (int it = l; it < r; ++it)
#define all(x) x.begin(), x.end()

typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double DINF = numeric_limits<double>::infinity();
const ll MOD = 1e9 + 7;
const double EPS = 1e-7;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
mt19937 mmtw_(MOD);
uniform_int_distribution<ll> rd_;
ll randomll() { return rd_(mmtw_);}
ll rnd(ll x, ll y) { return rd_(mmtw_) % (y - x + 1) + x; }
template <class T> T fact(T n) { if (n == 1) return 1; return n * fact(n - 1); }
////////////////////////////////////////////////////////////////////////////////////////////////

const int MAXN = 1e6 + 5;

int n;
ll a[MAXN];
ll p;

int main() {
    FAST_IO;
    cin >> n;
    rep(i, n) {
        cin >> a[i + 1];
    }
    cin >> p;

    partial_sum(a, a + n + 1, a);

    ll res = 0;
    for (int r = 0; r <= n; ++r) {
        for (int l = 0; l < r; ++l) {
            if (a[r] - p * r >= a[l] - p * l) {
                res++;
            }
        }
    }

    cout << res << endl;
}

Subtask #1
42.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 376 KB Output is correct
2 Correct 26 ms 516 KB Output is correct
3 Correct 30 ms 664 KB Output is correct
4 Execution timed out 1079 ms 17508 KB Time limit exceeded
5 Execution timed out 1073 ms 19496 KB Time limit exceeded
6 Execution timed out 1031 ms 30220 KB Time limit exceeded
7 Execution timed out 1084 ms 39384 KB Time limit exceeded
8 Execution timed out 1084 ms 45780 KB Time limit exceeded
9 Execution timed out 1080 ms 57220 KB Time limit exceeded
10 Execution timed out 1083 ms 64716 KB Time limit exceeded