oj.uz

Submission #848247

# Submission time Handle Problem Language Result Execution time Memory
848247 2023-09-11T19:21:17 Z TB_ Vudu (COCI15_vudu) C++17
28 / 140
 1000 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

#include <bits/extc++.h>
using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(ll i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;



int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    ll n, p, current = 0;
    cin >> n;
    vl v(n+1, 0);
    fo(i, n) cin >> v[i+1];
    cin >> p;

    ordered_multiset<ll> pos, neg;
    fo(i, n) v[i+1] = v[i]+v[i+1]-p;
    fo(i, n+1) pos.insert(v[i]);
    ll ans = 0;
    fo(i, n){
        current = v[i];
        neg.insert(v[i]);
        // deb2((ll)neg.order_of_key(*lower_bound(all(neg), current))-i, n-(ll)pos.order_of_key(*lower_bound(all(pos), current)));
        ans += (ll)neg.order_of_key(*lower_bound(all(neg), current))-(i)+n-(ll)pos.order_of_key(*lower_bound(all(pos), current));
    }
    cout << ans;


    return 0;
}

Subtask #1
28.0 / 140.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1055 ms 1636 KB Time limit exceeded
2 Correct 753 ms 1516 KB Output is correct
3 Correct 686 ms 1204 KB Output is correct
4 Runtime error 413 ms 65536 KB Execution killed with signal 9
5 Execution timed out 1098 ms 44112 KB Time limit exceeded
6 Execution timed out 1030 ms 65536 KB Time limit exceeded
7 Execution timed out 1093 ms 65536 KB Time limit exceeded
8 Execution timed out 1040 ms 62044 KB Time limit exceeded
9 Runtime error 319 ms 65536 KB Execution killed with signal 9
10 Execution timed out 1049 ms 65536 KB Time limit exceeded