| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 24875 | evenharder | 역사적 조사 (JOI14_historical) | C11 | 0 ms | 0 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 <cstdio>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <functional>
struct query{
int l,r,n;
long long int ans;
query(int l=0, int r=0, int n=0) : l(l), r(r), n(n) {ans=0LL;}
};
std::multiset<long long int, std::greater<long long int> > s;
std::vector<query> vq;
const int MAX_N=100000;
int x[MAX_N+1];
int n,q;
int root[MAX_N+1];
long long int cnt[MAX_N+1];
void setRoot()
{
std::map<int, int> m;
for(int i=1;i<=n;i++)
{
if(m[x[i]]==0)
{
root[i]=i;