oj.uz

답안 #431678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
431678 2021-06-17T14:25:28 Z cpp219 Financial Report (JOI21_financial) C++14
100 / 100
 951 ms 27544 KB 
#pragma GCC optimization "O2"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")

#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 3e5 + 9;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;

ll n,D,a[N],dp[N],id[N],ans;
ll st[4*N],lab[N];

void upd(ll id,ll l,ll r,ll u,ll val){
    if (u < l||r < u) return;
    if (l == r){
        st[id] = val; return;
    }
    ll mid = (l + r)/2;
    upd(id*2,l,mid,u,val); upd(id*2 + 1,mid + 1,r,u,val);
    st[id] = max(st[id*2],st[id*2 + 1]);
}

ll Get(ll id,ll l,ll r,ll u,ll v){
    if (v < l||r < u) return 0;
    if (u <= l&&r <= v) return st[id];
    ll mid = (l + r)/2;
    return max(Get(id*2,l,mid,u,v),Get(id*2 + 1,mid + 1,r,u,v));
}

bool lf(ll x,ll y){
    return a[x] < a[y] || (a[x] == a[y] && x > y);
}

ll par[N],mn[N];

ll Find(ll u){
    if (lab[u] < 0) return u;
    return lab[u] = Find(lab[u]);
}

void Union(ll p,ll q){
    ll r = Find(p),s = Find(q);
    if (r == s) return;
    if (lab[r] > lab[s]) swap(r,s);
    lab[r] += lab[s]; lab[s] = r;
    mn[r] = min(mn[r],mn[s]);
}
set<ll> s;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    #define task "tst"
    if (fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        //freopen(task".out", "w", stdout);
    }
    cin>>n>>D;
    for (ll i = 1;i <= n;i++) cin>>a[i],id[i] = i,mn[i] = i;
    sort(id + 1,id + n + 1,lf); memset(lab,-1,sizeof(lab));
    for (ll i = 1;i <= n;i++){
        auto it = s.lower_bound(id[i]);
        if (it != s.end()){
            if (abs(id[i] - *it) <= D) Union(id[i],*it);
        }
        if (it != s.begin()){
            it--;
            if (abs(id[i] - *it) <= D) Union(id[i],*it);
        }
        s.insert(id[i]);
        ll L = mn[Find(id[i])]; dp[i] = Get(1,1,n,L,id[i] - 1) + 1;
        upd(1,1,n,id[i],dp[i]); ans = max(ans,dp[i]);
        //cout<<id[i]<<" "<<dp[i]<<" "<<L<<" "<<i - 1<<"\n";
    }
    cout<<ans;
}

Compilation message

Main.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization "O2"
      | 
Main.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
Main.cpp: In function 'int main()':
Main.cpp:59:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 2 ms 1484 KB Output is correct
5 Correct 1 ms 1472 KB Output is correct
6 Correct 2 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1520 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 1 ms 1484 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 1 ms 1496 KB Output is correct
15 Correct 1 ms 1484 KB Output is correct
16 Correct 1 ms 1484 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 1 ms 1484 KB Output is correct
19 Correct 1 ms 1504 KB Output is correct
20 Correct 1 ms 1484 KB Output is correct
21 Correct 1 ms 1484 KB Output is correct
22 Correct 1 ms 1484 KB Output is correct
23 Correct 1 ms 1484 KB Output is correct
24 Correct 1 ms 1484 KB Output is correct
25 Correct 2 ms 1484 KB Output is correct
26 Correct 1 ms 1484 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 2 ms 1484 KB Output is correct
5 Correct 1 ms 1472 KB Output is correct
6 Correct 2 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1520 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 1 ms 1484 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 1 ms 1496 KB Output is correct
15 Correct 1 ms 1484 KB Output is correct
16 Correct 1 ms 1484 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 1 ms 1484 KB Output is correct
19 Correct 1 ms 1504 KB Output is correct
20 Correct 1 ms 1484 KB Output is correct
21 Correct 1 ms 1484 KB Output is correct
22 Correct 1 ms 1484 KB Output is correct
23 Correct 1 ms 1484 KB Output is correct
24 Correct 1 ms 1484 KB Output is correct
25 Correct 2 ms 1484 KB Output is correct
26 Correct 1 ms 1484 KB Output is correct
27 Correct 2 ms 1432 KB Output is correct
28 Correct 1 ms 1484 KB Output is correct
29 Correct 1 ms 1484 KB Output is correct
30 Correct 1 ms 1484 KB Output is correct
31 Correct 1 ms 1484 KB Output is correct
32 Correct 1 ms 1484 KB Output is correct
33 Correct 2 ms 1484 KB Output is correct
34 Correct 2 ms 1484 KB Output is correct
35 Correct 2 ms 1484 KB Output is correct
36 Correct 2 ms 1484 KB Output is correct
37 Correct 1 ms 1484 KB Output is correct
38 Correct 2 ms 1484 KB Output is correct
39 Correct 2 ms 1484 KB Output is correct
40 Correct 2 ms 1484 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 2 ms 1484 KB Output is correct
5 Correct 1 ms 1472 KB Output is correct
6 Correct 2 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1520 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 1 ms 1484 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 1 ms 1496 KB Output is correct
15 Correct 1 ms 1484 KB Output is correct
16 Correct 1 ms 1484 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 1 ms 1484 KB Output is correct
19 Correct 1 ms 1504 KB Output is correct
20 Correct 1 ms 1484 KB Output is correct
21 Correct 1 ms 1484 KB Output is correct
22 Correct 1 ms 1484 KB Output is correct
23 Correct 1 ms 1484 KB Output is correct
24 Correct 1 ms 1484 KB Output is correct
25 Correct 2 ms 1484 KB Output is correct
26 Correct 1 ms 1484 KB Output is correct
27 Correct 2 ms 1432 KB Output is correct
28 Correct 1 ms 1484 KB Output is correct
29 Correct 1 ms 1484 KB Output is correct
30 Correct 1 ms 1484 KB Output is correct
31 Correct 1 ms 1484 KB Output is correct
32 Correct 1 ms 1484 KB Output is correct
33 Correct 2 ms 1484 KB Output is correct
34 Correct 2 ms 1484 KB Output is correct
35 Correct 2 ms 1484 KB Output is correct
36 Correct 2 ms 1484 KB Output is correct
37 Correct 1 ms 1484 KB Output is correct
38 Correct 2 ms 1484 KB Output is correct
39 Correct 2 ms 1484 KB Output is correct
40 Correct 2 ms 1484 KB Output is correct
41 Correct 8 ms 1992 KB Output is correct
42 Correct 8 ms 1996 KB Output is correct
43 Correct 8 ms 2004 KB Output is correct
44 Correct 9 ms 1980 KB Output is correct
45 Correct 9 ms 1996 KB Output is correct
46 Correct 10 ms 1976 KB Output is correct
47 Correct 9 ms 2052 KB Output is correct
48 Correct 9 ms 2000 KB Output is correct
49 Correct 8 ms 2076 KB Output is correct
50 Correct 8 ms 1996 KB Output is correct
51 Correct 9 ms 2016 KB Output is correct
52 Correct 8 ms 1996 KB Output is correct
53 Correct 6 ms 1996 KB Output is correct
54 Correct 6 ms 1996 KB Output is correct
55 Correct 8 ms 2080 KB Output is correct
56 Correct 7 ms 1996 KB Output is correct
57 Correct 7 ms 2072 KB Output is correct
58 Correct 7 ms 2060 KB Output is correct
59 Correct 8 ms 1992 KB Output is correct
60 Correct 8 ms 2084 KB Output is correct
61 Correct 7 ms 2004 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 305 ms 27280 KB Output is correct
2 Correct 333 ms 26904 KB Output is correct
3 Correct 583 ms 27220 KB Output is correct
4 Correct 655 ms 27264 KB Output is correct
5 Correct 520 ms 27248 KB Output is correct
6 Correct 720 ms 27200 KB Output is correct
7 Correct 316 ms 27108 KB Output is correct
8 Correct 297 ms 27152 KB Output is correct
9 Correct 286 ms 27216 KB Output is correct
10 Correct 284 ms 27256 KB Output is correct
11 Correct 410 ms 27272 KB Output is correct
12 Correct 470 ms 27280 KB Output is correct
13 Correct 654 ms 27344 KB Output is correct
14 Correct 708 ms 27276 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 309 ms 27544 KB Output is correct
2 Correct 544 ms 27236 KB Output is correct
3 Correct 635 ms 27248 KB Output is correct
4 Correct 816 ms 27268 KB Output is correct
5 Correct 714 ms 27256 KB Output is correct
6 Correct 774 ms 27184 KB Output is correct
7 Correct 336 ms 27264 KB Output is correct
8 Correct 309 ms 27272 KB Output is correct
9 Correct 298 ms 27056 KB Output is correct
10 Correct 511 ms 27136 KB Output is correct
11 Correct 898 ms 27180 KB Output is correct
12 Correct 618 ms 27208 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1484 KB Output is correct
2 Correct 1 ms 1484 KB Output is correct
3 Correct 1 ms 1484 KB Output is correct
4 Correct 2 ms 1484 KB Output is correct
5 Correct 1 ms 1472 KB Output is correct
6 Correct 2 ms 1484 KB Output is correct
7 Correct 1 ms 1484 KB Output is correct
8 Correct 1 ms 1484 KB Output is correct
9 Correct 1 ms 1520 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 1 ms 1484 KB Output is correct
12 Correct 1 ms 1484 KB Output is correct
13 Correct 1 ms 1484 KB Output is correct
14 Correct 1 ms 1496 KB Output is correct
15 Correct 1 ms 1484 KB Output is correct
16 Correct 1 ms 1484 KB Output is correct
17 Correct 1 ms 1484 KB Output is correct
18 Correct 1 ms 1484 KB Output is correct
19 Correct 1 ms 1504 KB Output is correct
20 Correct 1 ms 1484 KB Output is correct
21 Correct 1 ms 1484 KB Output is correct
22 Correct 1 ms 1484 KB Output is correct
23 Correct 1 ms 1484 KB Output is correct
24 Correct 1 ms 1484 KB Output is correct
25 Correct 2 ms 1484 KB Output is correct
26 Correct 1 ms 1484 KB Output is correct
27 Correct 2 ms 1432 KB Output is correct
28 Correct 1 ms 1484 KB Output is correct
29 Correct 1 ms 1484 KB Output is correct
30 Correct 1 ms 1484 KB Output is correct
31 Correct 1 ms 1484 KB Output is correct
32 Correct 1 ms 1484 KB Output is correct
33 Correct 2 ms 1484 KB Output is correct
34 Correct 2 ms 1484 KB Output is correct
35 Correct 2 ms 1484 KB Output is correct
36 Correct 2 ms 1484 KB Output is correct
37 Correct 1 ms 1484 KB Output is correct
38 Correct 2 ms 1484 KB Output is correct
39 Correct 2 ms 1484 KB Output is correct
40 Correct 2 ms 1484 KB Output is correct
41 Correct 8 ms 1992 KB Output is correct
42 Correct 8 ms 1996 KB Output is correct
43 Correct 8 ms 2004 KB Output is correct
44 Correct 9 ms 1980 KB Output is correct
45 Correct 9 ms 1996 KB Output is correct
46 Correct 10 ms 1976 KB Output is correct
47 Correct 9 ms 2052 KB Output is correct
48 Correct 9 ms 2000 KB Output is correct
49 Correct 8 ms 2076 KB Output is correct
50 Correct 8 ms 1996 KB Output is correct
51 Correct 9 ms 2016 KB Output is correct
52 Correct 8 ms 1996 KB Output is correct
53 Correct 6 ms 1996 KB Output is correct
54 Correct 6 ms 1996 KB Output is correct
55 Correct 8 ms 2080 KB Output is correct
56 Correct 7 ms 1996 KB Output is correct
57 Correct 7 ms 2072 KB Output is correct
58 Correct 7 ms 2060 KB Output is correct
59 Correct 8 ms 1992 KB Output is correct
60 Correct 8 ms 2084 KB Output is correct
61 Correct 7 ms 2004 KB Output is correct
62 Correct 305 ms 27280 KB Output is correct
63 Correct 333 ms 26904 KB Output is correct
64 Correct 583 ms 27220 KB Output is correct
65 Correct 655 ms 27264 KB Output is correct
66 Correct 520 ms 27248 KB Output is correct
67 Correct 720 ms 27200 KB Output is correct
68 Correct 316 ms 27108 KB Output is correct
69 Correct 297 ms 27152 KB Output is correct
70 Correct 286 ms 27216 KB Output is correct
71 Correct 284 ms 27256 KB Output is correct
72 Correct 410 ms 27272 KB Output is correct
73 Correct 470 ms 27280 KB Output is correct
74 Correct 654 ms 27344 KB Output is correct
75 Correct 708 ms 27276 KB Output is correct
76 Correct 309 ms 27544 KB Output is correct
77 Correct 544 ms 27236 KB Output is correct
78 Correct 635 ms 27248 KB Output is correct
79 Correct 816 ms 27268 KB Output is correct
80 Correct 714 ms 27256 KB Output is correct
81 Correct 774 ms 27184 KB Output is correct
82 Correct 336 ms 27264 KB Output is correct
83 Correct 309 ms 27272 KB Output is correct
84 Correct 298 ms 27056 KB Output is correct
85 Correct 511 ms 27136 KB Output is correct
86 Correct 898 ms 27180 KB Output is correct
87 Correct 618 ms 27208 KB Output is correct
88 Correct 772 ms 27180 KB Output is correct
89 Correct 864 ms 27236 KB Output is correct
90 Correct 855 ms 27304 KB Output is correct
91 Correct 875 ms 27176 KB Output is correct
92 Correct 483 ms 27276 KB Output is correct
93 Correct 782 ms 27156 KB Output is correct
94 Correct 785 ms 27256 KB Output is correct
95 Correct 719 ms 27264 KB Output is correct
96 Correct 753 ms 27256 KB Output is correct
97 Correct 833 ms 27276 KB Output is correct
98 Correct 902 ms 27284 KB Output is correct
99 Correct 865 ms 27280 KB Output is correct
100 Correct 816 ms 27228 KB Output is correct
101 Correct 335 ms 27176 KB Output is correct
102 Correct 321 ms 27252 KB Output is correct
103 Correct 383 ms 27200 KB Output is correct
104 Correct 379 ms 27280 KB Output is correct
105 Correct 600 ms 27192 KB Output is correct
106 Correct 383 ms 27240 KB Output is correct
107 Correct 558 ms 27264 KB Output is correct
108 Correct 776 ms 27184 KB Output is correct
109 Correct 482 ms 27284 KB Output is correct
110 Correct 885 ms 27248 KB Output is correct
111 Correct 951 ms 27240 KB Output is correct
112 Correct 492 ms 27280 KB Output is correct
113 Correct 759 ms 27340 KB Output is correct
114 Correct 819 ms 27188 KB Output is correct
115 Correct 370 ms 27188 KB Output is correct
116 Correct 355 ms 27272 KB Output is correct
117 Correct 426 ms 27200 KB Output is correct
118 Correct 405 ms 27180 KB Output is correct
119 Correct 424 ms 27188 KB Output is correct
120 Correct 428 ms 27208 KB Output is correct