oj.uz

Submission #542469

# Submission time Handle Problem Language Result Execution time Memory
542469 2022-03-26T18:39:10 Z Olympia Vudu (COCI15_vudu) C++17
42 / 140
 1000 ms 65536 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <queue>
#include <limits.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

using namespace __gnu_pbds;
using namespace std;

typedef
tree<
pair<int,int>,
null_type,
less<pair<int,int>>,
rb_tree_tag,
tree_order_statistics_node_update>
        ordered_set;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N; cin >> N;
    vector<int> pref = {0}; for (int i = 0; i < N; i++) {int x; cin >> x; pref.push_back(pref.back() + x);}
    int P; cin >> P;
    int64_t c = 0;
    ordered_set s;
    for (int r = 0; r < N; r++) {
        s.insert({pref[r] - P * r, r});
        c += (int64_t)s.order_of_key(make_pair(pref[r + 1] - P * (r + 1) + 1, -1));
    }
    cout << c;
}

Compilation message

vudu.cpp:17: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   17 | #pragma GCC optimization ("O3")
      | 
vudu.cpp:18: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   18 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
42.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 852 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Execution timed out 1094 ms 64480 KB Time limit exceeded
5 Incorrect 558 ms 36656 KB Output isn't correct
6 Incorrect 935 ms 57272 KB Output isn't correct
7 Incorrect 982 ms 59592 KB Output isn't correct
8 Incorrect 816 ms 51652 KB Output isn't correct
9 Execution timed out 1038 ms 65536 KB Time limit exceeded
10 Incorrect 948 ms 57968 KB Output isn't correct