# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114348 | onjo0127 | Employment (JOI16_employment) | C++11 | 242 ms | 13188 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 query {
int ty, a, b;
} B[200009];
vector<int> S;
int A[200009], C[200009], F[400009];
int f(int x) {
return (int)S.size() - (lower_bound(S.begin(), S.end(), x) - S.begin());
}
void upd(int x, int y) { for(int i=x; i<=(int)S.size(); i+=(i&-i)) F[i] += y; }
int get(int x) {int s = 0; for(int i=x; i>=1; i-=(i&-i)) s += F[i]; return s; }
void update(int id, int nw) {
upd(A[id], -C[id]);
A[id] = nw;
if(A[id-1] <= A[id] && A[id+1] < A[id]) C[id] = -1;
else if(A[id-1] > A[id] && A[id+1] >= A[id]) C[id] = +1;
else C[id] = 0;
upd(A[id], C[id]);
}
int main() {
int N, M; scanf("%d%d",&N,&M);
for(int i=1; i<=N; i++) {
scanf("%d",&A[i]);
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... |