Submission #613611

#TimeUsernameProblemLanguageResultExecution timeMemory
613611yuto1115Diversity (CEOI21_diversity)C++17
64 / 100
210 ms16368 KiB
#include <bits/stdc++.h> #define rep(i, n) for(ll i = 0; i < ll(n); ++i) #define rep2(i, s, n) for(ll i = ll(s); i < ll(n); ++i) #define rrep(i, n) for(ll i = ll(n) - 1; i >= 0; --i) #define rrep2(i, n, t) for(ll i = ll(n) - 1; i >= ll(t); --i) #define pb push_back #define eb emplace_back #define all(a) a.begin(), a.end() #define SZ(a) int(a.size()) using namespace std; using ll = long long; using P = pair<int, int>; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; using vp = vector<P>; using vvp = vector<vp>; using vb = vector<bool>; using vvb = vector<vb>; using vs = vector<string>; const int inf = 1001001001; const ll linf = 1001001001001001001; template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr), cout.tie(nullptr); int n, q; cin >> n >> q; vi a(n); map<int, int> mp; for (int &i: a) { cin >> i; ++mp[i]; } vi ls; for (auto[f, s]: mp) ls.pb(s); sort(all(ls)); ls.pop_back(); vi v(2); ll ans = 0; for (int i: ls) { if (v[0] > v[1]) swap(v[0], v[1]); v[0] += i; ans += (ll) v[0] * (n - v[0]); } rep(i, 2) assert(v[i] <= n / 2); ans += (ll) n * (n + 1) / 2; cout << ans << endl; }
#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...