# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447355 | jhwest2 | 역사적 조사 (JOI14_historical) | C++17 | 4072 ms | 9288 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>
#define va first
#define vb second
using namespace std;
typedef long long lint;
typedef pair<int, int> pint;
const int M = 1e5 + 10, SQ = 1000;
int n, q, A[M], Count[M];
lint Ans[M];
pair<pint, int> Qry[M];
vector<lint> V;
struct Set {
multiset<lint> St;
void insert(lint x) {
St.erase(St.find(Count[x] * V[x])); Count[x] += 1;
St.insert(Count[x] * V[x]);
}
void erase(lint x) {
St.erase(St.find(Count[x] * V[x])); Count[x] -= 1;
St.insert(Count[x] * V[x]);
}
lint query() {
return *prev(St.end());
}
} St;
# | 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... |