oj.uz

답안 #252736

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252736 2020-07-26T07:58:40 Z kartel Vudu (COCI15_vudu) C++14
42 / 140
 1000 ms 15992 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
//#define F first
//#define S second
#define pb push_back
#define N +1000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define Max_S int(3e6)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

ll pr[N], i, n, j, ans, a[N], p;

int main()
{
    cout.precision(2);
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++) cin >> a[i], pr[i] = pr[i - 1] + a[i];
    cin >> p;

    for (j = 1; j <= n; j++)
    {
        for (i = 1; i <= j; i++)
            if (pr[j] - j * p >= pr[i - 1] - i * p + p)
                ans++;
    }
    cout << ans;
}
//
//00000
//00110
//00111
//00011
//00000

Subtask #1
42.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 524 KB Output is correct
2 Correct 21 ms 384 KB Output is correct
3 Correct 20 ms 384 KB Output is correct
4 Execution timed out 1084 ms 15480 KB Time limit exceeded
5 Execution timed out 1092 ms 8844 KB Time limit exceeded
6 Execution timed out 1092 ms 13688 KB Time limit exceeded
7 Execution timed out 1091 ms 14332 KB Time limit exceeded
8 Execution timed out 1089 ms 12408 KB Time limit exceeded
9 Execution timed out 1077 ms 15992 KB Time limit exceeded
10 Execution timed out 1076 ms 13924 KB Time limit exceeded