Submission #955407

#TimeUsernameProblemLanguageResultExecution timeMemory
955407yoav_sDiversity (CEOI21_diversity)C++17
0 / 100
2 ms2652 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<ll> v; typedef vector<v> vv; typedef vector<vv> vvv; typedef pair<ll,ll> p; typedef vector<p> vp; typedef vector<vp> vvp; typedef vector<vvp> vvvp; typedef pair<ll, p> tri; typedef vector<tri> vtri; typedef vector<vtri> vvtri; typedef vector<vvtri> vvvtri; typedef vector<bool> vb; typedef vector<vb> vvb; typedef vector<vvb> vvvb; #define f first #define s second #define pb push_back #define eb emplace_back #define all(v) (v).begin(),(v).end() const ll INF = 1e18; const ll mod = 1e9 + 7; const ll maxValue = 3e5; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); ll N, Q; cin >> N >> Q; v a(N); for (ll i = 0; i < N; i++) cin >> a[i]; sort(all(a)); v histogram(maxValue + 1, 0); ll res = 0; for (ll i= 0; i < N; i++) { ll uniqueCount = 0; v changed; for (ll j = i; j < N; j++) { histogram[a[j]]++; changed.pb(a[j]); if (histogram[a[j]] == 1) uniqueCount++; res += uniqueCount; } for (ll x : changed) histogram[x] = 0; } cout << res << "\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...