oj.uz

Submission #835791

# Submission time Handle Problem Language Result Execution time Memory
835791 2023-08-23T20:02:41 Z VMaksimoski008 Mountains (NOI20_mountains) C++14
66 / 100
 275 ms 41184 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

struct SegTree {
    int n;
    vector<int> tree;

    SegTree(int n) : n(n), tree(4*n+5) {}

    void update(int u, int tl, int tr, int pos, int val) {
        if(tl == tr) {
            tree[u] += val;
        } else {
            int tm = (tl + tr) / 2;
            if(pos <= tm)
                update(2*u, tl, tm, pos, val);
            else
                update(2*u+1, tm+1, tr, pos, val);
            tree[u] = tree[2*u] + tree[2*u+1];
        }
    }

    int query(int u, int tl, int tr, int l, int r) {
        if(tl > tr || l > tr || tl > r) return 0;
        if(l <= tl && tr <= r) return tree[u];
        int tm = (tl + tr) / 2;
        return query(2*u, tl, tm, l, r)
        + query(2*u+1, tm+1, tr, l, r);
    }

    void update(int pos, int val) {
        update(1, 0, n-1, pos, val);
    }

    int query(int l, int r) {
        return query(1, 0, n-1, l, r);
    }
};

int32_t main() {
    setIO();

    int n;
    cin >> n;
    vector<ll> v(n);
    for(ll &x : v) cin >> x;

    vector<ll> tmp(v);
    map<ll, int> key;
    sort(all(tmp));
    uniq(tmp);

    for(int i=0; i<tmp.size(); i++)
        key[tmp[i]] = i;
    
    vector<int> dp_left(n), dp_right(n);
    SegTree tree_left(tmp.size());
    SegTree tree_right(tmp.size());

    //calc dp left
    for(int i=0; i<n; i++) {
        int pos = key[v[i]];
        dp_left[i] = tree_left.query(0, pos-1);
        tree_left.update(pos, 1);
    }

    for(int i=n-1; i>=0; i--) {
        int pos = key[v[i]];
        dp_right[i] = tree_right.query(0, pos-1);
        tree_right.update(pos, 1);
    }

    ll ans = 0;
    for(int i=0; i<n; i++)
        ans += 1ll * (dp_left[i] * dp_right[i]);
    cout << '\n';
    cout << ans << '\n';
    return 0;
}

Compilation message

Mountains.cpp: In function 'int32_t main()':
Mountains.cpp:79:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |     for(int i=0; i<tmp.size(); i++)
      |                  ~^~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 257 ms 41184 KB Output is correct
3 Correct 273 ms 41092 KB Output is correct
4 Correct 259 ms 41108 KB Output is correct
5 Correct 264 ms 41088 KB Output is correct
6 Correct 275 ms 41096 KB Output is correct
7 Correct 258 ms 41052 KB Output is correct
8 Correct 256 ms 41040 KB Output is correct
9 Correct 199 ms 27536 KB Output is correct
10 Correct 198 ms 27628 KB Output is correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 7904 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 7904 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 324 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 10 ms 1608 KB Output is correct
12 Correct 10 ms 1608 KB Output is correct
13 Correct 10 ms 1620 KB Output is correct
14 Correct 11 ms 1688 KB Output is correct
15 Correct 11 ms 1608 KB Output is correct
16 Correct 11 ms 1620 KB Output is correct
17 Correct 11 ms 1612 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 6 ms 636 KB Output is correct
20 Correct 0 ms 212 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 7904 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 257 ms 41184 KB Output is correct
3 Correct 273 ms 41092 KB Output is correct
4 Correct 259 ms 41108 KB Output is correct
5 Correct 264 ms 41088 KB Output is correct
6 Correct 275 ms 41096 KB Output is correct
7 Correct 258 ms 41052 KB Output is correct
8 Correct 256 ms 41040 KB Output is correct
9 Correct 199 ms 27536 KB Output is correct
10 Correct 198 ms 27628 KB Output is correct
11 Incorrect 34 ms 7904 KB Output isn't correct
12 Halted 0 ms 0 KB -