Submission #433183

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
4331832021-06-19 06:10:17benedict0724역사적 조사 (JOI14_historical)C++17
40 / 100
4090 ms9668 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int bucket = 316;
struct query
{
int s, e, i;
query() : query(0, 0, 0) {}
query(int _s, int _e, int _i) : s(_s), e(_e), i(_i) {}
bool operator < (const query &O)
{
if(s/bucket == O.s/bucket) return e < O.e;
return s/bucket < O.s/bucket;
}
};
ll X[100002], Y[100002], I[100002];
query Q[100002];
ll tree[400002];
void update(int i, int l, int r, int id, ll v)
{
if(l == r) { tree[i] += v; return; }
int m = (l + r)/2;
if(id <= m) update(i*2, l, m, id, v);
else update(i*2+1, m+1, r, id, v);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...