oj.uz

Submission #968929

# Submission time Handle Problem Language Result Execution time Memory
968929 2024-04-24T09:48:08 Z marvinthang Diversity (CEOI21_diversity) C++17
64 / 100
 7000 ms 7120 KB 
/*************************************
*    author: marvinthang             *
*    created: 24.04.2024 16:30:43    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

const int MAX = 3e5 + 1;

int cnt[MAX];

void process(void) {
	int n, q; cin >> n >> q;
	vector <int> a(n); cin >> a;
	while (q--) {
		int l, r; cin >> l >> r; --l;
		FOR(i, l, r) ++cnt[a[i]];
		vector <int> val;
		FOR(i, l, r) if (cnt[a[i]]) {
			val.push_back(cnt[a[i]]);
			cnt[a[i]] = 0;
		}
		sort(ALL(val));
		int n = r - l, d = val.size();
		vector <int> f;
		for (int i = 0; i < d; i += 2) f.push_back(val[i]);
		for (int i = d - 1 - (d & 1); i > 0; i -= 2) f.push_back(val[i]);
		long long res = 0;
		int pref = 0;
		for (int x: f) {
			res += 1LL * x * (x + 1) / 2;
			res += 1LL * x * (n - x);
			res += 1LL * pref * (n - pref - x);
			pref += x;
		}
		cout << res << '\n';
	}
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("diversity");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

diversity.cpp: In function 'int main()':
diversity.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diversity.cpp:79:2: note: in expansion of macro 'file'
   79 |  file("diversity");
      |  ^~~~
diversity.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
diversity.cpp:79:2: note: in expansion of macro 'file'
   79 |  file("diversity");
      |  ^~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 984 KB Output is correct
5 Correct 9 ms 1628 KB Output is correct
6 Correct 13 ms 2136 KB Output is correct
7 Correct 18 ms 2148 KB Output is correct
8 Correct 13 ms 2140 KB Output is correct
9 Correct 13 ms 2148 KB Output is correct
10 Correct 13 ms 2208 KB Output is correct
11 Correct 13 ms 2140 KB Output is correct
12 Correct 13 ms 2140 KB Output is correct
13 Correct 13 ms 2140 KB Output is correct
14 Correct 13 ms 2268 KB Output is correct
15 Correct 16 ms 2136 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 984 KB Output is correct
5 Correct 9 ms 1628 KB Output is correct
6 Correct 13 ms 2136 KB Output is correct
7 Correct 18 ms 2148 KB Output is correct
8 Correct 13 ms 2140 KB Output is correct
9 Correct 13 ms 2148 KB Output is correct
10 Correct 13 ms 2208 KB Output is correct
11 Correct 13 ms 2140 KB Output is correct
12 Correct 13 ms 2140 KB Output is correct
13 Correct 13 ms 2140 KB Output is correct
14 Correct 13 ms 2268 KB Output is correct
15 Correct 16 ms 2136 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 1116 KB Output is correct
20 Correct 9 ms 1628 KB Output is correct
21 Correct 15 ms 2272 KB Output is correct
22 Correct 14 ms 2392 KB Output is correct
23 Correct 14 ms 2396 KB Output is correct
24 Correct 14 ms 2396 KB Output is correct
25 Correct 14 ms 2396 KB Output is correct
26 Correct 14 ms 2396 KB Output is correct
27 Correct 15 ms 2396 KB Output is correct
28 Correct 14 ms 2140 KB Output is correct
29 Correct 14 ms 2140 KB Output is correct
30 Correct 14 ms 2392 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 984 KB Output is correct
5 Correct 9 ms 1628 KB Output is correct
6 Correct 13 ms 2136 KB Output is correct
7 Correct 18 ms 2148 KB Output is correct
8 Correct 13 ms 2140 KB Output is correct
9 Correct 13 ms 2148 KB Output is correct
10 Correct 13 ms 2208 KB Output is correct
11 Correct 13 ms 2140 KB Output is correct
12 Correct 13 ms 2140 KB Output is correct
13 Correct 13 ms 2140 KB Output is correct
14 Correct 13 ms 2268 KB Output is correct
15 Correct 16 ms 2136 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 5 ms 1116 KB Output is correct
20 Correct 9 ms 1628 KB Output is correct
21 Correct 15 ms 2272 KB Output is correct
22 Correct 14 ms 2392 KB Output is correct
23 Correct 14 ms 2396 KB Output is correct
24 Correct 14 ms 2396 KB Output is correct
25 Correct 14 ms 2396 KB Output is correct
26 Correct 14 ms 2396 KB Output is correct
27 Correct 15 ms 2396 KB Output is correct
28 Correct 14 ms 2140 KB Output is correct
29 Correct 14 ms 2140 KB Output is correct
30 Correct 14 ms 2392 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 548 KB Output is correct
37 Correct 3 ms 856 KB Output is correct
38 Correct 3 ms 856 KB Output is correct
39 Correct 6 ms 1116 KB Output is correct
40 Correct 10 ms 1880 KB Output is correct
41 Correct 15 ms 2776 KB Output is correct
42 Correct 15 ms 2652 KB Output is correct
43 Correct 15 ms 2648 KB Output is correct
44 Correct 16 ms 2652 KB Output is correct
45 Correct 15 ms 2788 KB Output is correct
46 Correct 15 ms 2652 KB Output is correct
47 Correct 15 ms 2652 KB Output is correct
48 Correct 15 ms 2652 KB Output is correct
49 Correct 16 ms 2908 KB Output is correct
50 Correct 15 ms 2648 KB Output is correct
51 Correct 16 ms 2652 KB Output is correct
52 Correct 16 ms 2784 KB Output is correct
53 Correct 15 ms 2652 KB Output is correct
54 Correct 16 ms 2780 KB Output is correct
55 Correct 16 ms 2784 KB Output is correct
56 Correct 16 ms 2652 KB Output is correct
57 Correct 16 ms 2788 KB Output is correct
58 Correct 15 ms 2652 KB Output is correct
59 Correct 16 ms 2808 KB Output is correct
60 Correct 17 ms 2788 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 464 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 4 ms 984 KB Output is correct
15 Correct 9 ms 1628 KB Output is correct
16 Correct 13 ms 2136 KB Output is correct
17 Correct 18 ms 2148 KB Output is correct
18 Correct 13 ms 2140 KB Output is correct
19 Correct 13 ms 2148 KB Output is correct
20 Correct 13 ms 2208 KB Output is correct
21 Correct 13 ms 2140 KB Output is correct
22 Correct 13 ms 2140 KB Output is correct
23 Correct 13 ms 2140 KB Output is correct
24 Correct 13 ms 2268 KB Output is correct
25 Correct 16 ms 2136 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 5 ms 1116 KB Output is correct
30 Correct 9 ms 1628 KB Output is correct
31 Correct 15 ms 2272 KB Output is correct
32 Correct 14 ms 2392 KB Output is correct
33 Correct 14 ms 2396 KB Output is correct
34 Correct 14 ms 2396 KB Output is correct
35 Correct 14 ms 2396 KB Output is correct
36 Correct 14 ms 2396 KB Output is correct
37 Correct 15 ms 2396 KB Output is correct
38 Correct 14 ms 2140 KB Output is correct
39 Correct 14 ms 2140 KB Output is correct
40 Correct 14 ms 2392 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 2 ms 548 KB Output is correct
47 Correct 3 ms 856 KB Output is correct
48 Correct 3 ms 856 KB Output is correct
49 Correct 6 ms 1116 KB Output is correct
50 Correct 10 ms 1880 KB Output is correct
51 Correct 15 ms 2776 KB Output is correct
52 Correct 15 ms 2652 KB Output is correct
53 Correct 15 ms 2648 KB Output is correct
54 Correct 16 ms 2652 KB Output is correct
55 Correct 15 ms 2788 KB Output is correct
56 Correct 15 ms 2652 KB Output is correct
57 Correct 15 ms 2652 KB Output is correct
58 Correct 15 ms 2652 KB Output is correct
59 Correct 16 ms 2908 KB Output is correct
60 Correct 15 ms 2648 KB Output is correct
61 Correct 16 ms 2652 KB Output is correct
62 Correct 16 ms 2784 KB Output is correct
63 Correct 15 ms 2652 KB Output is correct
64 Correct 16 ms 2780 KB Output is correct
65 Correct 16 ms 2784 KB Output is correct
66 Correct 16 ms 2652 KB Output is correct
67 Correct 16 ms 2788 KB Output is correct
68 Correct 15 ms 2652 KB Output is correct
69 Correct 16 ms 2808 KB Output is correct
70 Correct 17 ms 2788 KB Output is correct
71 Correct 5 ms 856 KB Output is correct
72 Correct 3 ms 860 KB Output is correct
73 Correct 3 ms 892 KB Output is correct
74 Correct 4 ms 860 KB Output is correct
75 Correct 5 ms 892 KB Output is correct
76 Correct 6 ms 1368 KB Output is correct
77 Correct 6 ms 1372 KB Output is correct
78 Correct 6 ms 1236 KB Output is correct
79 Correct 6 ms 1372 KB Output is correct
80 Correct 6 ms 1244 KB Output is correct
81 Correct 16 ms 2344 KB Output is correct
82 Correct 12 ms 2396 KB Output is correct
83 Correct 12 ms 2268 KB Output is correct
84 Correct 12 ms 2392 KB Output is correct
85 Correct 12 ms 2396 KB Output is correct
86 Correct 14 ms 2652 KB Output is correct
87 Correct 14 ms 2520 KB Output is correct
88 Correct 14 ms 2656 KB Output is correct
89 Correct 14 ms 2652 KB Output is correct
90 Correct 14 ms 2652 KB Output is correct
91 Correct 22 ms 4828 KB Output is correct
92 Correct 26 ms 4792 KB Output is correct
93 Correct 23 ms 4832 KB Output is correct
94 Correct 22 ms 4828 KB Output is correct
95 Correct 22 ms 4828 KB Output is correct
96 Correct 28 ms 6616 KB Output is correct
97 Correct 27 ms 6604 KB Output is correct
98 Correct 26 ms 6616 KB Output is correct
99 Correct 26 ms 6488 KB Output is correct
100 Correct 27 ms 6620 KB Output is correct
101 Correct 26 ms 6604 KB Output is correct
102 Correct 27 ms 6616 KB Output is correct
103 Correct 27 ms 6608 KB Output is correct
104 Correct 26 ms 6516 KB Output is correct
105 Correct 27 ms 6608 KB Output is correct
106 Correct 29 ms 6880 KB Output is correct
107 Correct 26 ms 6864 KB Output is correct
108 Correct 26 ms 7120 KB Output is correct
109 Correct 27 ms 6872 KB Output is correct
110 Correct 28 ms 6864 KB Output is correct
111 Correct 28 ms 6868 KB Output is correct
112 Correct 28 ms 6864 KB Output is correct
113 Correct 27 ms 6860 KB Output is correct
114 Correct 29 ms 6868 KB Output is correct
115 Correct 27 ms 6872 KB Output is correct

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 464 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 4 ms 984 KB Output is correct
15 Correct 9 ms 1628 KB Output is correct
16 Correct 13 ms 2136 KB Output is correct
17 Correct 18 ms 2148 KB Output is correct
18 Correct 13 ms 2140 KB Output is correct
19 Correct 13 ms 2148 KB Output is correct
20 Correct 13 ms 2208 KB Output is correct
21 Correct 13 ms 2140 KB Output is correct
22 Correct 13 ms 2140 KB Output is correct
23 Correct 13 ms 2140 KB Output is correct
24 Correct 13 ms 2268 KB Output is correct
25 Correct 16 ms 2136 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 5 ms 1116 KB Output is correct
30 Correct 9 ms 1628 KB Output is correct
31 Correct 15 ms 2272 KB Output is correct
32 Correct 14 ms 2392 KB Output is correct
33 Correct 14 ms 2396 KB Output is correct
34 Correct 14 ms 2396 KB Output is correct
35 Correct 14 ms 2396 KB Output is correct
36 Correct 14 ms 2396 KB Output is correct
37 Correct 15 ms 2396 KB Output is correct
38 Correct 14 ms 2140 KB Output is correct
39 Correct 14 ms 2140 KB Output is correct
40 Correct 14 ms 2392 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 2 ms 548 KB Output is correct
47 Correct 3 ms 856 KB Output is correct
48 Correct 3 ms 856 KB Output is correct
49 Correct 6 ms 1116 KB Output is correct
50 Correct 10 ms 1880 KB Output is correct
51 Correct 15 ms 2776 KB Output is correct
52 Correct 15 ms 2652 KB Output is correct
53 Correct 15 ms 2648 KB Output is correct
54 Correct 16 ms 2652 KB Output is correct
55 Correct 15 ms 2788 KB Output is correct
56 Correct 15 ms 2652 KB Output is correct
57 Correct 15 ms 2652 KB Output is correct
58 Correct 15 ms 2652 KB Output is correct
59 Correct 16 ms 2908 KB Output is correct
60 Correct 15 ms 2648 KB Output is correct
61 Correct 16 ms 2652 KB Output is correct
62 Correct 16 ms 2784 KB Output is correct
63 Correct 15 ms 2652 KB Output is correct
64 Correct 16 ms 2780 KB Output is correct
65 Correct 16 ms 2784 KB Output is correct
66 Correct 16 ms 2652 KB Output is correct
67 Correct 16 ms 2788 KB Output is correct
68 Correct 15 ms 2652 KB Output is correct
69 Correct 16 ms 2808 KB Output is correct
70 Correct 17 ms 2788 KB Output is correct
71 Correct 5 ms 856 KB Output is correct
72 Correct 3 ms 860 KB Output is correct
73 Correct 3 ms 892 KB Output is correct
74 Correct 4 ms 860 KB Output is correct
75 Correct 5 ms 892 KB Output is correct
76 Correct 6 ms 1368 KB Output is correct
77 Correct 6 ms 1372 KB Output is correct
78 Correct 6 ms 1236 KB Output is correct
79 Correct 6 ms 1372 KB Output is correct
80 Correct 6 ms 1244 KB Output is correct
81 Correct 16 ms 2344 KB Output is correct
82 Correct 12 ms 2396 KB Output is correct
83 Correct 12 ms 2268 KB Output is correct
84 Correct 12 ms 2392 KB Output is correct
85 Correct 12 ms 2396 KB Output is correct
86 Correct 14 ms 2652 KB Output is correct
87 Correct 14 ms 2520 KB Output is correct
88 Correct 14 ms 2656 KB Output is correct
89 Correct 14 ms 2652 KB Output is correct
90 Correct 14 ms 2652 KB Output is correct
91 Correct 22 ms 4828 KB Output is correct
92 Correct 26 ms 4792 KB Output is correct
93 Correct 23 ms 4832 KB Output is correct
94 Correct 22 ms 4828 KB Output is correct
95 Correct 22 ms 4828 KB Output is correct
96 Correct 28 ms 6616 KB Output is correct
97 Correct 27 ms 6604 KB Output is correct
98 Correct 26 ms 6616 KB Output is correct
99 Correct 26 ms 6488 KB Output is correct
100 Correct 27 ms 6620 KB Output is correct
101 Correct 26 ms 6604 KB Output is correct
102 Correct 27 ms 6616 KB Output is correct
103 Correct 27 ms 6608 KB Output is correct
104 Correct 26 ms 6516 KB Output is correct
105 Correct 27 ms 6608 KB Output is correct
106 Correct 29 ms 6880 KB Output is correct
107 Correct 26 ms 6864 KB Output is correct
108 Correct 26 ms 7120 KB Output is correct
109 Correct 27 ms 6872 KB Output is correct
110 Correct 28 ms 6864 KB Output is correct
111 Correct 28 ms 6868 KB Output is correct
112 Correct 28 ms 6864 KB Output is correct
113 Correct 27 ms 6860 KB Output is correct
114 Correct 29 ms 6868 KB Output is correct
115 Correct 27 ms 6872 KB Output is correct
116 Correct 288 ms 1400 KB Output is correct
117 Correct 379 ms 1432 KB Output is correct
118 Correct 1098 ms 1792 KB Output is correct
119 Correct 1908 ms 2552 KB Output is correct
120 Correct 2675 ms 2384 KB Output is correct
121 Correct 3809 ms 2636 KB Output is correct
122 Correct 5313 ms 2664 KB Output is correct
123 Correct 5831 ms 3460 KB Output is correct
124 Execution timed out 7016 ms 3348 KB Time limit exceeded
125 Halted 0 ms 0 KB -