oj.uz

답안 #549487

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
549487 2022-04-15T22:33:41 Z duality Fish 2 (JOI22_fish2) C++17
25 / 100
 4000 ms 140996 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#pragma GCC optimize("Ofast")

int N,A[100002];
LLI bit[100003],bit2[100003];
int update(int i,int num) {
    for (i++; i <= N; i += i & (-i)) bit[i] += num;
    return 0;
}
LLI query(int s,int e) {
    LLI sum = 0;
    for (e++; e > 0; e -= e & (-e)) sum += bit[e];
    for (; s > 0; s -= s & (-s)) sum -= bit[s];
    return sum;
}
set<int> layer[31];
int tree[1 << 18],pre[1 << 18],occ[1 << 18];
int build(int s,int e,int i) {
    if (s == e) {
        occ[i] = 1,tree[i] = pre[i] = 0;
        return 0;
    }

    int mid = (s+e) / 2;
    build(s,mid,2*i),build(mid+1,e,2*i+1);
    tree[i] = tree[2*i]+tree[2*i+1];
    pre[i] = min(pre[2*i],tree[2*i]+pre[2*i+1]);
    occ[i] = 0;
    if (pre[i] == pre[2*i]) occ[i] += occ[2*i];
    if (pre[i] == tree[2*i]+pre[2*i+1]) occ[i] += occ[2*i+1];
    return 0;
}
int update3(int i,int num) {
    int u = i+(1 << 17);
    tree[u] += num,pre[u] += num;
    while (u > 1) {
        u >>= 1;
        tree[u] = tree[u << 1]+tree[(u << 1)|1];
        pre[u] = min(pre[u << 1],tree[u << 1]+pre[(u << 1)|1]);
        occ[u] = 0;
        if (pre[u] == pre[u << 1]) occ[u] += occ[u << 1];
        if (pre[u] == tree[u << 1]+pre[(u << 1)|1]) occ[u] += occ[(u << 1)|1];
    }
    return 0;
}
int arr[1000];
int update(int s,int e,int as,int ae,int i,int num) {
    if (as <= ae) update3(as,num),update3(ae+1,-num);
    return 0;
}
pair<pii,int> query(int s,int e,int qs,int qe,int i) {
    if ((s >= qs) && (e <= qe)) return mp(mp(tree[i],pre[i]),occ[i]);

    int mid = (s+e) / 2;
    if (qe <= mid) return query(s,mid,qs,qe,2*i);
    else if (qs >= mid+1) return query(mid+1,e,qs,qe,2*i+1);
    else {
        auto l = query(s,mid,qs,qe,2*i),r = query(mid+1,e,qs,qe,2*i+1);
        pair<pii,int> p;
        p.first.first = l.first.first+r.first.first;
        p.first.second = min(l.first.second,l.first.first+r.first.second);
        p.second = 0;
        if (p.first.second == l.first.second) p.second += l.second;
        if (p.first.second == l.first.first+r.first.second) p.second += r.second;
        return p;
    }
}

int check(int l,int r,int m = -1) {
    if ((m != -1) && ((l > m) || (r < m))) return 0;
    else return (l < r-1) && (min(A[l],A[r]) > query(l+1,r-1));
}
int update2(int p,int a) {
    int i;
    for (i = 0; i < 31; i++) {
        auto it = layer[i].lower_bound(p);
        if (it == layer[i].end()) continue;
        if ((it != layer[i].begin()) && check(*prev(it),*it,p)) update(0,N-1,*prev(it)+1,*it-1,0,-1);
        if ((next(it) != layer[i].end()) && check(*it,*next(it),p)) update(0,N-1,*it+1,*next(it)-1,0,-1);
        if ((it != layer[i].begin()) && (next(it) != layer[i].end()) && check(*prev(it),*next(it),p))
            update(0,N-1,*prev(it)+1,*next(it)-1,0,-1);
        if ((it != layer[i].begin()) && (prev(it) != layer[i].begin()) && check(*prev(prev(it)),*it,p))
            update(0,N-1,*prev(prev(it))+1,*it-1,0,-1);
        if ((next(it) != layer[i].end()) && (next(next(it)) != layer[i].end()) && check(*it,*next(next(it)),p))
            update(0,N-1,*it+1,*next(next(it))-1,0,-1);
        if (*it == p) layer[i].erase(it);
    }
    update(p,a-A[p]),A[p] = a;
    for (i = 0; i < 31; i++) {
        if (i <= __lg(A[p])) layer[i].insert(p);
        auto it = layer[i].lower_bound(p);
        if (it == layer[i].end()) continue;
        if ((it != layer[i].begin()) && check(*prev(it),*it,p)) update(0,N-1,*prev(it)+1,*it-1,0,1);
        if ((next(it) != layer[i].end()) && check(*it,*next(it),p)) update(0,N-1,*it+1,*next(it)-1,0,1);
        if ((it != layer[i].begin()) && (next(it) != layer[i].end()) && check(*prev(it),*next(it),p))
            update(0,N-1,*prev(it)+1,*next(it)-1,0,1);
        if ((it != layer[i].begin()) && (prev(it) != layer[i].begin()) && check(*prev(prev(it)),*it,p))
            update(0,N-1,*prev(prev(it))+1,*it-1,0,1);
        if ((next(it) != layer[i].end()) && (next(next(it)) != layer[i].end()) && check(*it,*next(next(it)),p))
            update(0,N-1,*it+1,*next(next(it))-1,0,1);
    }
    return 0;
}
int main() {
    int i;
    int Q;
    scanf("%d",&N);
    mt19937 gen;
    clock_t init = clock();
    for (i = 1; i <= N; i++) scanf("%d",&A[i]);
    A[0] = A[N+1] = 1.1e9,N += 2;

    int j;
    for (i = 0; i < N; i++) {
        for (j = 0; j <= __lg(A[i]); j++) layer[j].insert(i);
    }
    for (i = 0; i < N; i++) update(i,A[i]);
    build(0,(1 << 17)-1,1);
    for (i = 0; i < 31; i++) {
        for (auto it = layer[i].begin(); it != layer[i].end(); it++) {
            if (it != layer[i].begin()) {
                if (check(*prev(it),*it)) update(0,N-1,*prev(it)+1,*it-1,0,1);
                if (next(it) != layer[i].end()) {
                    if (check(*prev(it),*next(it))) update(0,N-1,*prev(it)+1,*next(it)-1,0,1);
                }
            }
        }
    }

    int T,X,Y,L,R;
    scanf("%d",&Q);
    for (i = 0; i < Q; i++) {
        scanf("%d",&T);
        //T = 1;
        if (T == 1) {
            //X = uniform_int_distribution<int>(1,N-2)(gen),Y = uniform_int_distribution<int>(1,1e9)(gen);
            scanf("%d %d",&X,&Y);
            update2(X,Y);
        }
        else {
            scanf("%d %d",&L,&R);
            //L = 1+(rand() % N),R = 1+(rand() % N); if (L > R) swap(L,R);
            int l = A[L-1],r = A[R+1];
            update2(L-1,1.1e9),update2(R+1,1.1e9);
            auto p = query(0,(1 << 17)-1,L,R,1);
            printf("%d\n",p.second);
            update2(L-1,l),update2(R+1,r);
        }
    }
    //cerr<<(double)(clock()-init)/CLOCKS_PER_SEC<<endl;

    return 0;
}

Compilation message

fish2.cpp: In function 'int main()':
fish2.cpp:164:13: warning: unused variable 'init' [-Wunused-variable]
  164 |     clock_t init = clock();
      |             ^~~~
fish2.cpp:162:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  162 |     scanf("%d",&N);
      |     ~~~~~^~~~~~~~~
fish2.cpp:165:35: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  165 |     for (i = 1; i <= N; i++) scanf("%d",&A[i]);
      |                              ~~~~~^~~~~~~~~~~~
fish2.cpp:186:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  186 |     scanf("%d",&Q);
      |     ~~~~~^~~~~~~~~
fish2.cpp:188:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  188 |         scanf("%d",&T);
      |         ~~~~~^~~~~~~~~
fish2.cpp:192:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  192 |             scanf("%d %d",&X,&Y);
      |             ~~~~~^~~~~~~~~~~~~~~
fish2.cpp:196:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  196 |             scanf("%d %d",&L,&R);
      |             ~~~~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3412 KB Output is correct
2 Correct 4 ms 3412 KB Output is correct
3 Correct 5 ms 3412 KB Output is correct
4 Correct 5 ms 3352 KB Output is correct
5 Correct 46 ms 3752 KB Output is correct
6 Correct 70 ms 3612 KB Output is correct
7 Correct 37 ms 3604 KB Output is correct
8 Correct 120 ms 3412 KB Output is correct
9 Correct 72 ms 3548 KB Output is correct
10 Correct 40 ms 4072 KB Output is correct
11 Correct 66 ms 4052 KB Output is correct
12 Correct 47 ms 3776 KB Output is correct
13 Correct 101 ms 3484 KB Output is correct
14 Correct 19 ms 3668 KB Output is correct
15 Correct 64 ms 3748 KB Output is correct
16 Correct 67 ms 3540 KB Output is correct
17 Correct 53 ms 3644 KB Output is correct
18 Correct 109 ms 3504 KB Output is correct
19 Correct 55 ms 3812 KB Output is correct
20 Correct 102 ms 3796 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3284 KB Output is correct
2 Correct 828 ms 74860 KB Output is correct
3 Correct 332 ms 34976 KB Output is correct
4 Correct 829 ms 75060 KB Output is correct
5 Correct 352 ms 36800 KB Output is correct
6 Correct 1746 ms 140916 KB Output is correct
7 Correct 93 ms 14028 KB Output is correct
8 Correct 1710 ms 140996 KB Output is correct
9 Correct 95 ms 14116 KB Output is correct
10 Correct 795 ms 76976 KB Output is correct
11 Correct 255 ms 29360 KB Output is correct
12 Correct 173 ms 22080 KB Output is correct
13 Correct 168 ms 22168 KB Output is correct
14 Correct 1197 ms 77800 KB Output is correct
15 Correct 1112 ms 77788 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3412 KB Output is correct
2 Correct 4 ms 3412 KB Output is correct
3 Correct 5 ms 3412 KB Output is correct
4 Correct 5 ms 3352 KB Output is correct
5 Correct 46 ms 3752 KB Output is correct
6 Correct 70 ms 3612 KB Output is correct
7 Correct 37 ms 3604 KB Output is correct
8 Correct 120 ms 3412 KB Output is correct
9 Correct 72 ms 3548 KB Output is correct
10 Correct 40 ms 4072 KB Output is correct
11 Correct 66 ms 4052 KB Output is correct
12 Correct 47 ms 3776 KB Output is correct
13 Correct 101 ms 3484 KB Output is correct
14 Correct 19 ms 3668 KB Output is correct
15 Correct 64 ms 3748 KB Output is correct
16 Correct 67 ms 3540 KB Output is correct
17 Correct 53 ms 3644 KB Output is correct
18 Correct 109 ms 3504 KB Output is correct
19 Correct 55 ms 3812 KB Output is correct
20 Correct 102 ms 3796 KB Output is correct
21 Correct 4 ms 3284 KB Output is correct
22 Correct 828 ms 74860 KB Output is correct
23 Correct 332 ms 34976 KB Output is correct
24 Correct 829 ms 75060 KB Output is correct
25 Correct 352 ms 36800 KB Output is correct
26 Correct 1746 ms 140916 KB Output is correct
27 Correct 93 ms 14028 KB Output is correct
28 Correct 1710 ms 140996 KB Output is correct
29 Correct 95 ms 14116 KB Output is correct
30 Correct 795 ms 76976 KB Output is correct
31 Correct 255 ms 29360 KB Output is correct
32 Correct 173 ms 22080 KB Output is correct
33 Correct 168 ms 22168 KB Output is correct
34 Correct 1197 ms 77800 KB Output is correct
35 Correct 1112 ms 77788 KB Output is correct
36 Correct 989 ms 77900 KB Output is correct
37 Correct 507 ms 35652 KB Output is correct
38 Correct 524 ms 35536 KB Output is correct
39 Correct 947 ms 77760 KB Output is correct
40 Correct 519 ms 35360 KB Output is correct
41 Correct 1847 ms 140756 KB Output is correct
42 Correct 1842 ms 140724 KB Output is correct
43 Correct 262 ms 14376 KB Output is correct
44 Correct 288 ms 14172 KB Output is correct
45 Correct 911 ms 73096 KB Output is correct
46 Correct 921 ms 74992 KB Output is correct
47 Correct 338 ms 25944 KB Output is correct
48 Correct 268 ms 22444 KB Output is correct
49 Correct 371 ms 22096 KB Output is correct
50 Correct 1325 ms 77828 KB Output is correct
51 Correct 1236 ms 77660 KB Output is correct
52 Correct 1360 ms 77516 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3284 KB Output is correct
2 Correct 828 ms 74860 KB Output is correct
3 Correct 332 ms 34976 KB Output is correct
4 Correct 829 ms 75060 KB Output is correct
5 Correct 352 ms 36800 KB Output is correct
6 Correct 1746 ms 140916 KB Output is correct
7 Correct 93 ms 14028 KB Output is correct
8 Correct 1710 ms 140996 KB Output is correct
9 Correct 95 ms 14116 KB Output is correct
10 Correct 795 ms 76976 KB Output is correct
11 Correct 255 ms 29360 KB Output is correct
12 Correct 173 ms 22080 KB Output is correct
13 Correct 168 ms 22168 KB Output is correct
14 Correct 1197 ms 77800 KB Output is correct
15 Correct 1112 ms 77788 KB Output is correct
16 Correct 5 ms 3284 KB Output is correct
17 Execution timed out 4043 ms 36160 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3284 KB Output is correct
2 Correct 828 ms 74860 KB Output is correct
3 Correct 332 ms 34976 KB Output is correct
4 Correct 829 ms 75060 KB Output is correct
5 Correct 352 ms 36800 KB Output is correct
6 Correct 1746 ms 140916 KB Output is correct
7 Correct 93 ms 14028 KB Output is correct
8 Correct 1710 ms 140996 KB Output is correct
9 Correct 95 ms 14116 KB Output is correct
10 Correct 795 ms 76976 KB Output is correct
11 Correct 255 ms 29360 KB Output is correct
12 Correct 173 ms 22080 KB Output is correct
13 Correct 168 ms 22168 KB Output is correct
14 Correct 1197 ms 77800 KB Output is correct
15 Correct 1112 ms 77788 KB Output is correct
16 Correct 5 ms 3284 KB Output is correct
17 Execution timed out 4050 ms 75056 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3412 KB Output is correct
2 Correct 4 ms 3412 KB Output is correct
3 Correct 5 ms 3412 KB Output is correct
4 Correct 5 ms 3352 KB Output is correct
5 Correct 46 ms 3752 KB Output is correct
6 Correct 70 ms 3612 KB Output is correct
7 Correct 37 ms 3604 KB Output is correct
8 Correct 120 ms 3412 KB Output is correct
9 Correct 72 ms 3548 KB Output is correct
10 Correct 40 ms 4072 KB Output is correct
11 Correct 66 ms 4052 KB Output is correct
12 Correct 47 ms 3776 KB Output is correct
13 Correct 101 ms 3484 KB Output is correct
14 Correct 19 ms 3668 KB Output is correct
15 Correct 64 ms 3748 KB Output is correct
16 Correct 67 ms 3540 KB Output is correct
17 Correct 53 ms 3644 KB Output is correct
18 Correct 109 ms 3504 KB Output is correct
19 Correct 55 ms 3812 KB Output is correct
20 Correct 102 ms 3796 KB Output is correct
21 Correct 4 ms 3284 KB Output is correct
22 Correct 828 ms 74860 KB Output is correct
23 Correct 332 ms 34976 KB Output is correct
24 Correct 829 ms 75060 KB Output is correct
25 Correct 352 ms 36800 KB Output is correct
26 Correct 1746 ms 140916 KB Output is correct
27 Correct 93 ms 14028 KB Output is correct
28 Correct 1710 ms 140996 KB Output is correct
29 Correct 95 ms 14116 KB Output is correct
30 Correct 795 ms 76976 KB Output is correct
31 Correct 255 ms 29360 KB Output is correct
32 Correct 173 ms 22080 KB Output is correct
33 Correct 168 ms 22168 KB Output is correct
34 Correct 1197 ms 77800 KB Output is correct
35 Correct 1112 ms 77788 KB Output is correct
36 Correct 989 ms 77900 KB Output is correct
37 Correct 507 ms 35652 KB Output is correct
38 Correct 524 ms 35536 KB Output is correct
39 Correct 947 ms 77760 KB Output is correct
40 Correct 519 ms 35360 KB Output is correct
41 Correct 1847 ms 140756 KB Output is correct
42 Correct 1842 ms 140724 KB Output is correct
43 Correct 262 ms 14376 KB Output is correct
44 Correct 288 ms 14172 KB Output is correct
45 Correct 911 ms 73096 KB Output is correct
46 Correct 921 ms 74992 KB Output is correct
47 Correct 338 ms 25944 KB Output is correct
48 Correct 268 ms 22444 KB Output is correct
49 Correct 371 ms 22096 KB Output is correct
50 Correct 1325 ms 77828 KB Output is correct
51 Correct 1236 ms 77660 KB Output is correct
52 Correct 1360 ms 77516 KB Output is correct
53 Correct 5 ms 3284 KB Output is correct
54 Execution timed out 4043 ms 36160 KB Time limit exceeded
55 Halted 0 ms 0 KB -