oj.uz

Submission #535163

# Submission time Handle Problem Language Result Execution time Memory
535163 2022-03-09T14:27:25 Z browntoad Group Photo (JOI21_ho_t3) C++14
5 / 100
 5000 ms 312 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 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=1e6;
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);
}
 
//=======================================================================================
 

signed main (){
    IOS();
    int n; cin>>n;
    vector<int> vc(n+1);
    REP1(i,n) cin>>vc[i];
    vector<int> cur(n);
    REP(i,n) cur[i]=i+1;
    int ans=inf;
    int intot=0;
    vector<int> c(n+1), inv(n+1);
    RREP(i,n){
        inv[vc[i]]=i;
        intot+=c[vc[i]];
        FOR(j, vc[i]+1, n+1){
            c[j]++;
        }
    }
    do{
        bool gg=0;
        REP(i,n-1){
            if (vc[cur[i]]-vc[cur[i+1]]>=2){
                gg=1;
                break;
            }
        }
        if (!gg){
            vector<int> cnt(n+1);
            int tot=0;
            RREP(i,n){
                tot+=cnt[cur[i]];
                FOR(j, cur[i]+1, n+1){
                    cnt[j]++;
                }
            }
            //cout<<tot<<endl;
            ans=min(ans, tot);
        }
        
    }
    while(next_permutation(ALL(cur)));
    cout<<ans<<endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 5 ms 204 KB Output is correct
8 Correct 4 ms 204 KB Output is correct
9 Correct 4 ms 204 KB Output is correct
10 Correct 4 ms 312 KB Output is correct
11 Execution timed out 5058 ms 204 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 5 ms 204 KB Output is correct
8 Correct 4 ms 204 KB Output is correct
9 Correct 4 ms 204 KB Output is correct
10 Correct 4 ms 312 KB Output is correct
11 Execution timed out 5058 ms 204 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 5 ms 204 KB Output is correct
8 Correct 4 ms 204 KB Output is correct
9 Correct 4 ms 204 KB Output is correct
10 Correct 4 ms 312 KB Output is correct
11 Execution timed out 5058 ms 204 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 5 ms 204 KB Output is correct
8 Correct 4 ms 204 KB Output is correct
9 Correct 4 ms 204 KB Output is correct
10 Correct 4 ms 312 KB Output is correct
11 Execution timed out 5058 ms 204 KB Time limit exceeded
12 Halted 0 ms 0 KB -