# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230068 | dantoh000 | 역사적 조사 (JOI14_historical) | C++14 | 363 ms | 10704 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;
typedef tuple<int,int,int> iii;
typedef long long ll;
const int N = 100005;
const int BK = 300;
int n,q;
int ct[N];
int a[N];
vector<int> v;
unordered_map<int,int> ID;
ll ans[N];
ll cur = 0;
vector<iii> qu[N/BK+1];
int add[N];
bool cmp(iii a, iii b){
return (get<1>(a) < get<1>(b));
}
void ADD(int id){
//printf("adding %d\n",id);
ct[a[id]]++;
cur = max(cur,(ll)ct[a[id]]*v[a[id]]);
}
void remove(int id){
//printf("removing %d\n",id);
ct[a[id]]--;
}
int main(){
scanf("%d%d",&n,&q);
for (int i = 1 ; i <= n; i++) {
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... |