# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
486371 | leinad2 | 역사적 조사 (JOI14_historical) | C++17 | 4077 ms | 8820 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int n, q, i, j, k, a, b, B, inv[100010], A[100010], cnt[100010];
vector<int>comp;
long long ans[100010];
struct query
{
int i, l, r;
};
vector<query>Q;
multiset<long long>s;
bool cmp(query a, query b)
{
if(a.l/B==b.l/B)return a.r<b.r;
else return a.l/B<b.l/B;
}
void add(int i)
{
s.erase(s.find(1LL*cnt[A[i]]*inv[A[i]]));
cnt[A[i]]++;
s.insert(1LL*cnt[A[i]]*inv[A[i]]);
}
void del(int i)
{
s.erase(s.find(1LL*cnt[A[i]]*inv[A[i]]));
cnt[A[i]]--;
s.insert(1LL*cnt[A[i]]*inv[A[i]]);
}
main()
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |