oj.uz

답안 #709005

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709005 2023-03-13T03:54:50 Z Sanzhar23 Diversity (CEOI21_diversity) C++14
4 / 100
 7000 ms 1496 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long	
#define pb push_back
#define bug cout << "bug" << endl
#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define all(x) x.begin(), x.end()
#define F first
#define S second
#define pll pair <ll, ll> 
#define pii pair <int, int> 
#define triple pair <pair <ll, ll> , ll>   
#define ull unsigned long long
#define ld long double
#define pinode pair <node*, node*>

const ll INF = 9e18 + 5;
const ll inf = 1e9 + 5;
const ll N = 3e5 + 5;
const ll shift = 2e6;
const ll mod = 998244353;
const ll mod2 = 1e9 + 9;
const ll M = 1e3 + 5;
const ll LOG = 21;
const ll sp = 263;
const ll sp2 = 9973;
const int block = 100;
const double eps = 1e-10;

int n, q;
int a[N], cnt[N];

int main(){
	speed;
	cin >> n >> q;
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		cnt[a[i]]++;
	}
	int l, r;
	cin >> l >> r;
	vector <pii> vt;
	for(int i = 1; i <= 300000; i++){
		if(cnt[i] != 0)
			vt.pb({cnt[i], i});
	}
	sort(all(vt));
	vector <int> nw;
	for(int i = 0; i < vt.size(); i++){
		int x = vt[i].S, col = vt[i].F;
		if(i % 2 == 0){
			for(int j = 0; j < col; j++){
				nw.pb(x);
			}	
		}
	}
	for(int i = vt.size() - 1; i >= 0; i--){
		int x = vt[i].S, col = vt[i].F;
		if(i % 2 == 1){
			for(int j = 0; j < col; j++){
				nw.pb(x);
			}
		}
	}
	int ans = 0;
	for(int i = 0; i < nw.size(); i++){
		set <int> st;
		for(int j = i; j < nw.size(); j++){
			st.insert(nw[j]);
			ans += (int) st.size();
		}
	}
	cout << ans << endl;
}
/*	
%I64d6


		
		



%I64d
*/

Compilation message

diversity.cpp: In function 'int main()':
diversity.cpp:51:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |  for(int i = 0; i < vt.size(); i++){
      |                 ~~^~~~~~~~~~~
diversity.cpp:68:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |  for(int i = 0; i < nw.size(); i++){
      |                 ~~^~~~~~~~~~~
diversity.cpp:70:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |   for(int j = i; j < nw.size(); j++){
      |                  ~~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 142 ms 588 KB Output is correct
4 Execution timed out 7081 ms 1496 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 142 ms 588 KB Output is correct
4 Execution timed out 7081 ms 1496 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 142 ms 588 KB Output is correct
4 Execution timed out 7081 ms 1496 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 142 ms 588 KB Output is correct
14 Execution timed out 7081 ms 1496 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 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 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 142 ms 588 KB Output is correct
14 Execution timed out 7081 ms 1496 KB Time limit exceeded
15 Halted 0 ms 0 KB -