제출 #758542

#제출 시각UTC-0아이디문제언어결과실행 시간메모리
7585422023-06-14 19:41:06HanksburgerBubble Sort 2 (JOI18_bubblesort2)C++17
100 / 100
1998 ms53576 KiB
#include "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
int seg[4000005], lazy[4000005];
vector<pair<int, int> > vec;
vector<int> ans;
void push(int i, int l, int r)
{
if (l<r)
{
seg[i*2]+=lazy[i];
seg[i*2+1]+=lazy[i];
lazy[i*2]+=lazy[i];
lazy[i*2+1]+=lazy[i];
lazy[i]=0;
}
}
void upd(int i, int l, int r, int ql, int qr, int val)
{
// cout << "update " << l << ' ' << r << ' ' << ql << ' ' << qr << ' ' << val << '\n';
// push(i, l, r);
if (ql<=l && r<=qr)
{
seg[i]+=val;
lazy[i]+=val;
return;
}
int mid=(l+r)/2;
if (ql<=mid && l<=qr)
upd(i*2, l, mid, ql, qr, val);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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...