# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24874 | evenharder | 역사적 조사 (JOI14_historical) | C++11 | 4000 ms | 15560 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::map<int, long long int> m; // amount
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;
void calc()
{
int sq=(int)(ceil(sqrt(n+1)));
std::sort(vq.begin(), vq.end(), [&] (query A, query B) {
return A.l/sq == B.l/sq ? A.r < B.r : A.l < B.l;
});
int l=1;
int r=0;
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... |