# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151689 | daoquanglinh2007 | Matching (CEOI11_mat) | C++20 | 790 ms | 32548 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int unsigned int
#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define isz(a) (int)(a).size()
const int NM = 1e6;
int n, m, p[NM+5], h[NM+5], pw[NM+5];
vector <int> arr, ans;
pii st[4*NM+5];
void update(int id, int l, int r, int i, int val){
if (i < l || i > r) return;
if (l == r){
st[id].fi = val > 0;
st[id].se = val;
return;
}
int mid = (l+r)/2;
update(2*id, l, mid, i, val);
update(2*id+1, mid+1, r, i, val);
st[id] = mp(st[2*id].fi+st[2*id+1].fi, st[2*id].se*pw[st[2*id+1].fi]+st[2*id+1].se);
}
signed main(){
# | 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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |