oj.uz

답안 #673143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
673143 2022-12-19T19:59:44 Z KiriLL1ca Izbori (COCI22_izbori) C++17
40 / 110
 3000 ms 7876 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fr first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pw(x) (1ll << x)
#define sz(x) (int)((x).size())
#define pb push_back
#define endl '\n'
#define mp make_pair
#define vec vector

using namespace std;
using namespace __gnu_pbds;

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

template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T>
using oset = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;



struct fen {
        vector <int> t;
        int norm;
        fen (int n = 0) : norm(n >> 1), t(n + 100) {}
        inline void upd (int i, int x) { for (i += norm; i < sz(t); i += (i & -i)) t[i] += x; }
        inline int get (int i) { int res = 0; for (i += norm; i; i -= (i & -i)) res += t[i]; return res; }
        inline int get (int l, int r) { return get(r) - get(l - 1); }
};

inline void solve () {
        int n; cin >> n;
        vector <int> a (n + 1);
        for (int i = 1; i <= n; ++i) cin >> a[i], --a[i];
        map <int, vector <int>> mp;
        for (int i = 1; i <= n; ++i) mp[a[i]].pb(i);

        const int N = n * 4 + 100;
        const int B = 0;
        ll ans = 0;

        /// O(n^2) ! test

        for (auto &[_, pos] : mp) {
                if (sz(pos) > B) {
                        vector <int> c (n + 1);
                        fen t (N); t.upd(0, 1);
                        for (int i = 1; i <= n; ++i) c[i] = c[i - 1] + (a[i] == _ ? +1 : 0);
                        for (int i = 1; i <= n; ++i) {
                                ans += t.get(2 * c[i] - i - 1);
                                t.upd(2 * c[i] - i, 1);
                        }
                }
                else {

                }
        }
        cout << ans;
}

signed main() {
        ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
        #ifdef LOCAL
                freopen("input.txt", "r", stdin);
                freopen("output.txt", "w", stdout);
        #endif
        int t = 1; // cin >> t;
        while (t--) solve();
        return 0;
}

Compilation message

Main.cpp: In constructor 'fen::fen(int)':
Main.cpp:33:13: warning: 'fen::norm' will be initialized after [-Wreorder]
   33 |         int norm;
      |             ^~~~
Main.cpp:32:22: warning:   'std::vector<int> fen::t' [-Wreorder]
   32 |         vector <int> t;
      |                      ^
Main.cpp:34:9: warning:   when initialized here [-Wreorder]
   34 |         fen (int n = 0) : norm(n >> 1), t(n + 100) {}
      |         ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 16 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 4384 KB Output is correct
2 Correct 23 ms 5520 KB Output is correct
3 Correct 14 ms 3376 KB Output is correct
4 Correct 26 ms 5816 KB Output is correct
5 Correct 27 ms 6088 KB Output is correct
6 Correct 33 ms 6408 KB Output is correct
7 Correct 32 ms 6316 KB Output is correct
8 Correct 35 ms 6340 KB Output is correct
9 Correct 26 ms 6344 KB Output is correct
10 Correct 27 ms 6352 KB Output is correct
11 Correct 18 ms 6220 KB Output is correct

Subtask #4
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 16 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 19 ms 4384 KB Output is correct
19 Correct 23 ms 5520 KB Output is correct
20 Correct 14 ms 3376 KB Output is correct
21 Correct 26 ms 5816 KB Output is correct
22 Correct 27 ms 6088 KB Output is correct
23 Correct 33 ms 6408 KB Output is correct
24 Correct 32 ms 6316 KB Output is correct
25 Correct 35 ms 6340 KB Output is correct
26 Correct 26 ms 6344 KB Output is correct
27 Correct 27 ms 6352 KB Output is correct
28 Correct 18 ms 6220 KB Output is correct
29 Correct 29 ms 7876 KB Output is correct
30 Execution timed out 3079 ms 5156 KB Time limit exceeded
31 Halted 0 ms 0 KB -