oj.uz

Submission #952971

# Submission time Handle Problem Language Result Execution time Memory
952971 2024-03-25T08:05:23 Z Sacharlemagne Diversity (CEOI21_diversity) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
	//ios_base::sync_with_stdio(false); cin.tie(nullptr);
	int n,q; cin >> n >> q;
	vector<int> vv(n); for (int i = 0; i<n; ++i) cin >> vv[i];
	while (q--) {
		long long fin = 4e18;
		int L, R;
		cin >> L >> R;
		--L; --R;
		vector<int> v(R-L+1); for (int i = 0; i<R-L+1; ++i) v[i] = vv[i+L];
		do {

			//int l,r; cin >> l >> r; --l;
			long long ans = 0;
			for (int i = 0; i < n; ++i) {
				set<int> s;
				for (int j = i; j < n; ++j) {
					s.insert(v[j]);
					ans += s.size();
				}
			}
			fin = min(fin, ans);

		} while (1 != 1);
		cout << fin;
	}
	return 0;
}
/*
 *
 */

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 8.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -