oj.uz

Submission #443699

# Submission time Handle Problem Language Result Execution time Memory
443699 2021-07-11T12:57:56 Z zaneyu Group Photo (JOI21_ho_t3) C++14
100 / 100
 594 ms 67584 KB 
/*input
9
6 1 3 4 9 5 7 8 2
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+9;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=5e3+5;
const int maxlg=__lg(maxn)+2;
int cnt[maxn][maxn];
int dp[maxn];
int pos[maxn],bit[maxn],pref[maxn];
inline void upd(int p){
    while(p<maxn){
        bit[p]++;
        p+=lowb(p);
    }
}
int query(int p){
    int ans=0;
    while(p){
        ans+=bit[p];
        p-=lowb(p);
    }
    return ans;
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    REP1(i,n){
        int x;
        cin>>x;
        pos[x]=i;
    }
    REP1(i,n){
        REP(j,maxn) bit[j]=0,pref[j]=0;
        REP1(j,i-1) pref[pos[j]]++;
        REP1(j,n) pref[j]+=pref[j-1];
        for(int j=i;j<=n;j++){
            cnt[i][j]=cnt[i][j-1];
            cnt[i][j]+=query(pos[j])+i-1-pref[pos[j]];
            upd(pos[j]);
        }
    }
    REP1(i,n){
        dp[i]=INF;
        REP1(j,i){
            MNTO(dp[i],dp[j-1]+cnt[j][i]);
        }
    }
    cout<<dp[n];
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 1100 KB Output is correct
22 Correct 3 ms 1228 KB Output is correct
23 Correct 2 ms 1092 KB Output is correct
24 Correct 2 ms 1220 KB Output is correct
25 Correct 2 ms 1228 KB Output is correct
26 Correct 2 ms 1228 KB Output is correct
27 Correct 2 ms 1324 KB Output is correct
28 Correct 2 ms 1228 KB Output is correct
29 Correct 2 ms 1228 KB Output is correct
30 Correct 2 ms 1228 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 1100 KB Output is correct
22 Correct 3 ms 1228 KB Output is correct
23 Correct 2 ms 1092 KB Output is correct
24 Correct 2 ms 1220 KB Output is correct
25 Correct 2 ms 1228 KB Output is correct
26 Correct 2 ms 1228 KB Output is correct
27 Correct 2 ms 1324 KB Output is correct
28 Correct 2 ms 1228 KB Output is correct
29 Correct 2 ms 1228 KB Output is correct
30 Correct 2 ms 1228 KB Output is correct
31 Correct 16 ms 4812 KB Output is correct
32 Correct 16 ms 4812 KB Output is correct
33 Correct 15 ms 4736 KB Output is correct
34 Correct 16 ms 4852 KB Output is correct
35 Correct 16 ms 4764 KB Output is correct
36 Correct 16 ms 4784 KB Output is correct
37 Correct 16 ms 4812 KB Output is correct
38 Correct 16 ms 4784 KB Output is correct
39 Correct 16 ms 4904 KB Output is correct
40 Correct 15 ms 4752 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 448 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 432 KB Output is correct
18 Correct 1 ms 432 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 2 ms 1100 KB Output is correct
22 Correct 3 ms 1228 KB Output is correct
23 Correct 2 ms 1092 KB Output is correct
24 Correct 2 ms 1220 KB Output is correct
25 Correct 2 ms 1228 KB Output is correct
26 Correct 2 ms 1228 KB Output is correct
27 Correct 2 ms 1324 KB Output is correct
28 Correct 2 ms 1228 KB Output is correct
29 Correct 2 ms 1228 KB Output is correct
30 Correct 2 ms 1228 KB Output is correct
31 Correct 16 ms 4812 KB Output is correct
32 Correct 16 ms 4812 KB Output is correct
33 Correct 15 ms 4736 KB Output is correct
34 Correct 16 ms 4852 KB Output is correct
35 Correct 16 ms 4764 KB Output is correct
36 Correct 16 ms 4784 KB Output is correct
37 Correct 16 ms 4812 KB Output is correct
38 Correct 16 ms 4784 KB Output is correct
39 Correct 16 ms 4904 KB Output is correct
40 Correct 15 ms 4752 KB Output is correct
41 Correct 582 ms 67240 KB Output is correct
42 Correct 572 ms 67268 KB Output is correct
43 Correct 584 ms 67344 KB Output is correct
44 Correct 584 ms 67256 KB Output is correct
45 Correct 580 ms 67456 KB Output is correct
46 Correct 592 ms 67388 KB Output is correct
47 Correct 594 ms 67316 KB Output is correct
48 Correct 578 ms 67396 KB Output is correct
49 Correct 570 ms 67372 KB Output is correct
50 Correct 586 ms 67396 KB Output is correct
51 Correct 572 ms 67396 KB Output is correct
52 Correct 579 ms 67380 KB Output is correct
53 Correct 591 ms 67316 KB Output is correct
54 Correct 577 ms 67584 KB Output is correct
55 Correct 575 ms 67296 KB Output is correct