oj.uz

Submission #536004

# Submission time Handle Problem Language Result Execution time Memory
536004 2022-03-12T05:41:56 Z browntoad Group Photo (JOI21_ho_t3) C++14
100 / 100
 1832 ms 1134552 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define RREP1(i,n) for (int i=(n); i>=1; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=5005;
const double PI=acos(-1);
 
ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================

int costa[maxn][maxn], costb[maxn][maxn], F[maxn][maxn], P[maxn][maxn], S[maxn][maxn];
int tagP[maxn][maxn], tagS[maxn][maxn];
vector<int> dp(maxn);
signed main (){
    IOS();
    int n; cin>>n;
    vector<int> vc(n+1);
    REP1(i,n) cin>>vc[i];
    REP1(i,n){
        FOR(j,i+1,n+1){
            tagP[vc[i]][vc[j]]++;
            tagS[vc[j]][vc[i]]++;
        }
    }
    REP1(j,n){
        REP1(i,n){
            P[i][j]=P[i-1][j]+tagP[i][j];
        }
    }
    REP1(i,n){
        RREP1(j,n){
            S[i][j]=S[i][j+1]+tagS[i][j];
        }
    }
    REP1(i,n){
        FOR(j,i,n+1){
            F[i][j]=P[j][j]-P[i-1][j];
        }
    }
    REP1(i,n){
        FOR(j,i,n+1){
            if (i==j){
                costa[i][j]=0;
                continue;
            }
            costa[i][j]=costa[i][j-1]+F[i][j];
        }
    }
    RREP1(i,n){
        FOR(j,i,n+1){
            if (i==j) {
                costb[i][j]=S[i][j+1];
                continue;
            }
            costb[i][j]=costb[i+1][j]+S[i][j+1];
        }
    }
    /*REP1(i,n){
        FOR(j,i,n+1){
            cout<<costb[i][j]<<' ';
        }
        cout<<endl;
    }
    */
    REP1(i,n){
        dp[i]=inf;
        REP(j,i){
            dp[i]=min(dp[i], dp[j]+costa[j+1][i]+costb[j+1][i]);
        }
    }
    cout<<dp[n]<<endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 628 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 628 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 888 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 880 KB Output is correct
15 Correct 1 ms 880 KB Output is correct
16 Correct 1 ms 880 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 888 KB Output is correct
20 Correct 1 ms 852 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 628 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 888 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 880 KB Output is correct
15 Correct 1 ms 880 KB Output is correct
16 Correct 1 ms 880 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 888 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 4 ms 7636 KB Output is correct
22 Correct 4 ms 7640 KB Output is correct
23 Correct 4 ms 7672 KB Output is correct
24 Correct 4 ms 7664 KB Output is correct
25 Correct 4 ms 7656 KB Output is correct
26 Correct 4 ms 7744 KB Output is correct
27 Correct 4 ms 7668 KB Output is correct
28 Correct 4 ms 7668 KB Output is correct
29 Correct 4 ms 7764 KB Output is correct
30 Correct 5 ms 7764 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 628 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 888 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 880 KB Output is correct
15 Correct 1 ms 880 KB Output is correct
16 Correct 1 ms 880 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 888 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 4 ms 7636 KB Output is correct
22 Correct 4 ms 7640 KB Output is correct
23 Correct 4 ms 7672 KB Output is correct
24 Correct 4 ms 7664 KB Output is correct
25 Correct 4 ms 7656 KB Output is correct
26 Correct 4 ms 7744 KB Output is correct
27 Correct 4 ms 7668 KB Output is correct
28 Correct 4 ms 7668 KB Output is correct
29 Correct 4 ms 7764 KB Output is correct
30 Correct 5 ms 7764 KB Output is correct
31 Correct 40 ms 50212 KB Output is correct
32 Correct 47 ms 50476 KB Output is correct
33 Correct 40 ms 50416 KB Output is correct
34 Correct 35 ms 50508 KB Output is correct
35 Correct 36 ms 50584 KB Output is correct
36 Correct 35 ms 50508 KB Output is correct
37 Correct 36 ms 50432 KB Output is correct
38 Correct 35 ms 50376 KB Output is correct
39 Correct 35 ms 50504 KB Output is correct
40 Correct 39 ms 50472 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 500 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 628 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 852 KB Output is correct
12 Correct 1 ms 888 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 880 KB Output is correct
15 Correct 1 ms 880 KB Output is correct
16 Correct 1 ms 880 KB Output is correct
17 Correct 1 ms 852 KB Output is correct
18 Correct 1 ms 852 KB Output is correct
19 Correct 1 ms 888 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 4 ms 7636 KB Output is correct
22 Correct 4 ms 7640 KB Output is correct
23 Correct 4 ms 7672 KB Output is correct
24 Correct 4 ms 7664 KB Output is correct
25 Correct 4 ms 7656 KB Output is correct
26 Correct 4 ms 7744 KB Output is correct
27 Correct 4 ms 7668 KB Output is correct
28 Correct 4 ms 7668 KB Output is correct
29 Correct 4 ms 7764 KB Output is correct
30 Correct 5 ms 7764 KB Output is correct
31 Correct 40 ms 50212 KB Output is correct
32 Correct 47 ms 50476 KB Output is correct
33 Correct 40 ms 50416 KB Output is correct
34 Correct 35 ms 50508 KB Output is correct
35 Correct 36 ms 50584 KB Output is correct
36 Correct 35 ms 50508 KB Output is correct
37 Correct 36 ms 50432 KB Output is correct
38 Correct 35 ms 50376 KB Output is correct
39 Correct 35 ms 50504 KB Output is correct
40 Correct 39 ms 50472 KB Output is correct
41 Correct 1832 ms 1133392 KB Output is correct
42 Correct 1613 ms 1133776 KB Output is correct
43 Correct 1606 ms 1134120 KB Output is correct
44 Correct 1557 ms 1133896 KB Output is correct
45 Correct 1589 ms 1134188 KB Output is correct
46 Correct 1591 ms 1134444 KB Output is correct
47 Correct 1569 ms 1134236 KB Output is correct
48 Correct 1586 ms 1134364 KB Output is correct
49 Correct 1556 ms 1134248 KB Output is correct
50 Correct 1561 ms 1134284 KB Output is correct
51 Correct 1585 ms 1134552 KB Output is correct
52 Correct 1589 ms 1134444 KB Output is correct
53 Correct 1613 ms 1134484 KB Output is correct
54 Correct 1587 ms 1134444 KB Output is correct
55 Correct 1605 ms 1134396 KB Output is correct