Submission #655930

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
655930	2022-11-06T06:07:32 Z	Do_you_copy	Vudu (COCI15_vudu)	C++17	140 / 140	373 ms	31748 KB

vudu

/*
    Procrastination is the art of keeping up with yesterday
*/
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
#define int long long
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair <int, int>;
mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 1;
//const int Mod = 1e9 + 7;
//const int inf =
int n, p;
int a[maxN];
int pre[maxN];
vector <int> node;
int bit[maxN];

void update(int x, int val){
    for (; x <= node.size(); x += x & -x)
        bit[x] += val;
}

int get(int x){
    int res = 0;
    for (; x; x -= x & -x)
        res += bit[x];
    return res;
}

void Init(){
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    cin >> p;
    for (int i = 1; i <= n; ++i){
        a[i] -= p;
        pre[i] = pre[i - 1] + a[i];
        node.pb(pre[i]);
    }
    int ans = 0;
    node.pb(0);
    sort(node.begin(), node.end());
    node.resize(unique(node.begin(), node.end()) - node.begin());
    update(upper_bound(node.begin(), node.end(), 0) - node.begin(), 1);
    for (int i = 1; i <= n; ++i){
        auto k = upper_bound(node.begin(), node.end(), pre[i]) - node.begin();
        ans += get(k);
        //cerr << k << " " << get(k) << " ";
        k = upper_bound(node.begin(), node.end(), pre[i]) - node.begin();
        update(k, 1);
        //cerr << k << "\n";
    }
    cout << ans;
}

#define debug
#define taskname "test"
signed main(){
    faster
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    int tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }
    if (fopen("timeout.txt", "r")){
        ofstream timeout("timeout.txt");
        timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000);
        timeout.close();
        #ifndef debug
        cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n";
        #endif // debug
    }
}

Compilation message

vudu.cpp: In function 'void update(long long int, long long int)':
vudu.cpp:25:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for (; x <= node.size(); x += x & -x)
      |            ~~^~~~~~~~~~~~~~
vudu.cpp: In function 'int main()':
vudu.cpp:67:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
vudu.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

140.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	596 KB	Output is correct
2	Correct	2 ms	596 KB	Output is correct
3	Correct	2 ms	596 KB	Output is correct
4	Correct	373 ms	30640 KB	Output is correct
5	Correct	193 ms	17672 KB	Output is correct
6	Correct	302 ms	27456 KB	Output is correct
7	Correct	332 ms	28344 KB	Output is correct
8	Correct	262 ms	24620 KB	Output is correct
9	Correct	345 ms	31748 KB	Output is correct
10	Correct	296 ms	27524 KB	Output is correct