# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42345 | dqhungdl | 역사적 조사 (JOI14_historical) | C++14 | 4069 ms | 11676 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;
struct data
{
int l,r,id;
};
const int block=300;
data Q[100005];
int n,T,a[100005];
int64_t rs[100005];
map<int,int64_t> Free;
multiset<int64_t> s;
bool cmp(data x1,data x2)
{
if(x1.l/block==x2.l/block)
return x1.r<x2.r;
return x1.l/block<x2.l/block;
}
int main()
{
ios_base::sync_with_stdio(false);
//freopen("TEST.INP","r",stdin);
cin>>n>>T;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=T;i++)
# | 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... |