제출 #1318308

#제출 시각아이디문제언어결과실행 시간메모리
1318308spetrDiversity (CEOI21_diversity)C++20
0 / 100
0 ms332 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const ll mmod = 998244353; #define vl vector<long long> #define vll vector<vector<long long>> #define pl pair<long long, long long> #define vb vector<bool> int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); ll n, q; cin >> n >> q; vl nums (n); for (ll i = 0; i < n; i++){cin >> nums[i];} ll l, r; cin >> l >> r; vl dp (n, 1); sort(nums.begin(), nums.end()); for (ll i = 1; i < n; i++){ if (nums[i] == nums[i-1]){ dp[i] = dp[i-1]+1; } else{ dp[i] = dp[i-1] + 1 + i; } } ll suma = 0; for (ll i = 0; i < n; i++){suma += dp[i];} cout << suma << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...