oj.uz

Submission #373479

# Submission time Handle Problem Language Result Execution time Memory
373479 2021-03-04T19:20:00 Z vaaven Group Photo (JOI21_ho_t3) C++14
100 / 100
 733 ms 118652 KB 
#pragma GCC optimize("O3")
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <stack>
#include <iomanip>
#include <bitset>
#include <map>
#include <cassert>
#include <array>
#include <queue>
#include <cstring>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define pqueue priority_queue
#define pb(x) push_back(x)
// #define endl '\n'
#define all(x) x.begin(), x.end()
 #define int long  long
      
using namespace std;
      
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
// typedef tuple<ll, ll, ll> tiii;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
      
const int inf = 1e9 + 228;
const ll infll = 1e18;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ld eps = 1e-14;
      
      
void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
//    cout.tie(0);
//    freopen("d.in", "r", stdin);
//    freopen("d.out", "w", stdout);
}

const int maxn = 5e3 + 228;
int t[maxn];

void add(int i, int x){
    i++;
    for(; i<maxn; i+=i&-i)
        t[i] += x;
}

int get(int i){
    i++;
    int res = 0;
    for(; i>0; i-=i&-i)
        res += t[i];
    return res;
}

int dp[maxn][maxn];
int dp2[maxn];

void solve(){
    int n;
    cin >> n;
    vi a(n);
    for(int &i:a)
        cin >> i;
    for(int i=1; i<=n; i++){
        vi nw;
        for(int j:a){
            if(j != i-1)
                nw.pb(j);
        }
        a = nw;
        vi pos(n+1, 0);
        for(int j=0; j<a.size(); j++){
            pos[a[j]] = j;
        }
        for(int &j:t)
            j = 0;
        for(int j=i; j<=n; j++){
            dp[i][j] = dp[i][j-1] + pos[j] - (get(maxn-2) - get(pos[j]));
            add(pos[j], 1);
        }
    }
    for(int i=1; i<=n; i++){
        dp2[i] = inf;
        for(int j=0; j<i; j++){
            dp2[i] = min(dp2[i], dp2[j] + dp[j+1][i]);
        }
    }
    cout << dp2[n] << endl;
}

signed main(){
    fast_io();
//    srand(time(NULL));
    cout << fixed << setprecision(10);
    int q = 1;
//    cin >> q;
    while(q--)
        solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:87:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |         for(int j=0; j<a.size(); j++){
      |                      ~^~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 512 KB Output is correct

Subtask #3
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 2 ms 1388 KB Output is correct
22 Correct 2 ms 1388 KB Output is correct
23 Correct 3 ms 1388 KB Output is correct
24 Correct 2 ms 1388 KB Output is correct
25 Correct 2 ms 1388 KB Output is correct
26 Correct 2 ms 1388 KB Output is correct
27 Correct 2 ms 1408 KB Output is correct
28 Correct 2 ms 1388 KB Output is correct
29 Correct 2 ms 1388 KB Output is correct
30 Correct 3 ms 1388 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 2 ms 1388 KB Output is correct
22 Correct 2 ms 1388 KB Output is correct
23 Correct 3 ms 1388 KB Output is correct
24 Correct 2 ms 1388 KB Output is correct
25 Correct 2 ms 1388 KB Output is correct
26 Correct 2 ms 1388 KB Output is correct
27 Correct 2 ms 1408 KB Output is correct
28 Correct 2 ms 1388 KB Output is correct
29 Correct 2 ms 1388 KB Output is correct
30 Correct 3 ms 1388 KB Output is correct
31 Correct 19 ms 6124 KB Output is correct
32 Correct 18 ms 6124 KB Output is correct
33 Correct 18 ms 6124 KB Output is correct
34 Correct 19 ms 6252 KB Output is correct
35 Correct 22 ms 6124 KB Output is correct
36 Correct 18 ms 6272 KB Output is correct
37 Correct 22 ms 6124 KB Output is correct
38 Correct 18 ms 6144 KB Output is correct
39 Correct 18 ms 6124 KB Output is correct
40 Correct 18 ms 6124 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 2 ms 1388 KB Output is correct
22 Correct 2 ms 1388 KB Output is correct
23 Correct 3 ms 1388 KB Output is correct
24 Correct 2 ms 1388 KB Output is correct
25 Correct 2 ms 1388 KB Output is correct
26 Correct 2 ms 1388 KB Output is correct
27 Correct 2 ms 1408 KB Output is correct
28 Correct 2 ms 1388 KB Output is correct
29 Correct 2 ms 1388 KB Output is correct
30 Correct 3 ms 1388 KB Output is correct
31 Correct 19 ms 6124 KB Output is correct
32 Correct 18 ms 6124 KB Output is correct
33 Correct 18 ms 6124 KB Output is correct
34 Correct 19 ms 6252 KB Output is correct
35 Correct 22 ms 6124 KB Output is correct
36 Correct 18 ms 6272 KB Output is correct
37 Correct 22 ms 6124 KB Output is correct
38 Correct 18 ms 6144 KB Output is correct
39 Correct 18 ms 6124 KB Output is correct
40 Correct 18 ms 6124 KB Output is correct
41 Correct 703 ms 118196 KB Output is correct
42 Correct 692 ms 118380 KB Output is correct
43 Correct 695 ms 118360 KB Output is correct
44 Correct 726 ms 118380 KB Output is correct
45 Correct 703 ms 118252 KB Output is correct
46 Correct 693 ms 118380 KB Output is correct
47 Correct 704 ms 118528 KB Output is correct
48 Correct 696 ms 118508 KB Output is correct
49 Correct 693 ms 118508 KB Output is correct
50 Correct 695 ms 118604 KB Output is correct
51 Correct 729 ms 118380 KB Output is correct
52 Correct 697 ms 118652 KB Output is correct
53 Correct 708 ms 118328 KB Output is correct
54 Correct 733 ms 118380 KB Output is correct
55 Correct 707 ms 118508 KB Output is correct