oj.uz

Submission #862316

# Submission time Handle Problem Language Result Execution time Memory
862316 2023-10-18T03:39:34 Z imarn Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 224 ms 33804 KB 
#include "bits/stdc++.h"
#define f first
#define s second
#define ll long long
#define pb push_back
#define pii pair<ll,ll>
using namespace std;
const int N=2e5+5;
unordered_map<int,vector<int>>dp;
ll t[4*N],lz[4*N];
void push(int i,int l,int r){
    if(lz[i]){
        t[i]=lz[i];
        if(l<r){
            lz[2*i]=lz[i];
            lz[2*i+1]=lz[i];
        }
    }lz[i]=0;
}
void upd(int i,int l,int r,int tl,int tr,int v){
    push(i,l,r);
    if(r<tl||l>tr)return;
    if(r<=tr&&l>=tl){
        lz[i]=v;push(i,l,r);return;
    }int m=(l+r)>>1;
    upd(2*i,l,m,tl,tr,v);
    upd(2*i+1,m+1,r,tl,tr,v);
    t[i]=max(t[2*i],t[2*i+1]);
}
int qr(int i,int l,int r,int idx){
    push(i,l,r);
    if(r<idx||l>idx)return 0;
    if(l==r)return t[i];
    int m=(l+r)>>1;
    return max(qr(2*i,l,m,idx),qr(2*i+1,m+1,r,idx));
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;cin>>n;
    int a[n+1];
    for(int i=1;i<=n;i++)cin>>a[i];
    dp[a[1]].pb(1);upd(1,1,n,1,1,a[1]);
    for(int i=2;i<=n;i++){
        if(dp.find(a[i])!=dp.end()){
            while(!dp[a[i]].empty()&&qr(1,1,n,dp[a[i]].back())!=a[i])dp[a[i]].pop_back();
            if(!dp[a[i]].empty()){
            upd(1,1,n,dp[a[i]].back(),i-1,a[i]);
            }
        }upd(1,1,n,i,i,a[i]);
        dp[a[i]].pb(i);
    }
    for(int i=1;i<=n;i++)cout<<qr(1,1,n,i)<<"\n";
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2512 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2532 KB Output is correct
16 Correct 2 ms 2392 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 2 ms 2648 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 2 ms 2460 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2396 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 2 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2392 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 0 ms 2512 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 2 ms 2536 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 134 ms 13004 KB Output is correct
18 Correct 134 ms 13000 KB Output is correct
19 Correct 170 ms 12732 KB Output is correct
20 Correct 137 ms 12756 KB Output is correct
21 Correct 138 ms 12752 KB Output is correct
22 Correct 157 ms 12752 KB Output is correct
23 Correct 138 ms 12756 KB Output is correct
24 Correct 143 ms 13200 KB Output is correct
25 Correct 138 ms 12756 KB Output is correct
26 Correct 137 ms 12756 KB Output is correct
27 Correct 138 ms 12736 KB Output is correct
28 Correct 138 ms 12756 KB Output is correct
29 Correct 123 ms 12644 KB Output is correct
30 Correct 134 ms 13004 KB Output is correct
31 Correct 135 ms 13004 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2512 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2532 KB Output is correct
16 Correct 2 ms 2392 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 2 ms 2648 KB Output is correct
19 Correct 2 ms 2648 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 2 ms 2460 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2396 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 2 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2392 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 0 ms 2396 KB Output is correct
33 Correct 0 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 2 ms 2392 KB Output is correct
36 Correct 0 ms 2512 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 0 ms 2396 KB Output is correct
39 Correct 2 ms 2536 KB Output is correct
40 Correct 2 ms 2396 KB Output is correct
41 Correct 2 ms 2396 KB Output is correct
42 Correct 2 ms 2396 KB Output is correct
43 Correct 2 ms 2396 KB Output is correct
44 Correct 2 ms 2396 KB Output is correct
45 Correct 2 ms 2396 KB Output is correct
46 Correct 2 ms 2396 KB Output is correct
47 Correct 134 ms 13004 KB Output is correct
48 Correct 134 ms 13000 KB Output is correct
49 Correct 170 ms 12732 KB Output is correct
50 Correct 137 ms 12756 KB Output is correct
51 Correct 138 ms 12752 KB Output is correct
52 Correct 157 ms 12752 KB Output is correct
53 Correct 138 ms 12756 KB Output is correct
54 Correct 143 ms 13200 KB Output is correct
55 Correct 138 ms 12756 KB Output is correct
56 Correct 137 ms 12756 KB Output is correct
57 Correct 138 ms 12736 KB Output is correct
58 Correct 138 ms 12756 KB Output is correct
59 Correct 123 ms 12644 KB Output is correct
60 Correct 134 ms 13004 KB Output is correct
61 Correct 135 ms 13004 KB Output is correct
62 Correct 156 ms 16380 KB Output is correct
63 Correct 146 ms 33688 KB Output is correct
64 Correct 156 ms 33716 KB Output is correct
65 Correct 152 ms 15552 KB Output is correct
66 Correct 149 ms 15484 KB Output is correct
67 Correct 172 ms 15800 KB Output is correct
68 Correct 162 ms 15820 KB Output is correct
69 Correct 152 ms 15756 KB Output is correct
70 Correct 175 ms 15728 KB Output is correct
71 Correct 151 ms 15856 KB Output is correct
72 Correct 151 ms 15568 KB Output is correct
73 Correct 136 ms 24344 KB Output is correct
74 Correct 224 ms 24584 KB Output is correct
75 Correct 141 ms 33804 KB Output is correct
76 Correct 159 ms 33660 KB Output is correct
77 Correct 140 ms 33656 KB Output is correct
78 Correct 163 ms 33656 KB Output is correct