oj.uz

Submission #854417

# Submission time Handle Problem Language Result Execution time Memory
854417 2023-09-27T13:39:07 Z bachhoangxuan Line Town (CCO23_day1problem3) C++17
25 / 25
 753 ms 72060 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=500005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
const int base=101;

int n,a[maxn];
map<int,vector<int>> mp;

struct BIT{
    int bit[maxn];
    void update(int x,int val){
        for(int i=x;i<=n;i+=(i&(-i))) bit[i]+=val;
    }
    int query(int x){
        int res=0;
        for(int i=x;i>=1;i-=(i&(-i))) res+=bit[i];
        return res;
    }
}f0,f1;

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> a[i];
        mp[-abs(a[i])].push_back(i);
    }
    int t=0;
    for(int i=1;i<=n;i++) f0.update(i,1);
    vector<int> dp(2,inf);dp[0]=0;
    for(auto [x,v]:mp){
        if(x==0) break;
        vector<int> ndp(2,inf);
        int sz=(int)v.size(),pt=t;
        for(int id:v) f0.update(id,-1),t++;
        //cout << "* " << -x << '\n';
        for(int t0=0;t0<=1;t0++){
            vector<vector<int>> cc(2);
            for(int id:v){
                int k=(id&1)^(a[id]>0);
                cc[k].push_back(id);
            }
            int t1=(n^t0^pt^1)&1,val=dp[t0^1];
            for(int s0=0;s0<=1;s0++) for(int s1=0;s1<=1;s1++){
                int x0=(int)cc[0].size()-s0*(t0^1)-s1*t1;
                int x1=(int)cc[1].size()-s0*t0-s1*(t1^1);
                if(x0<0 || x1<0 || x0!=x1 || s0+s1>sz) continue;
                //cout << s0 << ' ' << s1 << ' ' << t0 << ' ' << t1 << '\n';
                vector<int> cur,p(2,0);
                if(s0) cur.push_back(cc[t0][p[t0]++]);
                while(p[0]<(int)cc[0].size() && p[1]<(int)cc[1].size()){
                    cur.push_back(cc[t0^s0][p[t0^s0]++]);
                    cur.push_back(cc[t0^s0^1][p[t0^s0^1]++]);
                }
                int pos=(int)cur.size()-1,total=val;
                for(int x:cur) total+=f0.query(x);
                if(s1){
                    cur.push_back(cc[t1^1][p[t1^1]++]);
                    total+=n-t-f0.query(cur.back());
                }
                //for(int x:cur) cout << x << ' ';
                //cout << '\n';
                for(int i=(int)cur.size()-1;i>=0;i--){
                    total+=f1.query(cur[i]);
                    f1.update(cur[i],1);
                }
                for(int x:cur) f1.update(x,-1);
                ndp[t0^1^s0]=min(ndp[t0^1^s0],total);
                //cout << total << '\n';
                while(pos>=1){
                    int d0=f0.query(cur[pos]),d1=f0.query(cur[pos-1]);
                    total+=2*(n-t-d0-d1);
                    if((t0^s0)!=(t1^s1)) total+=(cur[pos]>cur[pos-1]?1:-1);
                    ndp[t0^1^s0]=min(ndp[t0^1^s0],total);pos-=2;
                    //cout << pos << ' ' << total << '\n';
                }
            }
        }
        swap(dp,ndp);
        //cout << dp[0] << ' ' << dp[1] << '\n';
    }
    int res=min(dp[0],dp[1]);
    cout << (res==inf?-1:res) << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();

}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 80 ms 33544 KB Output is correct
16 Correct 88 ms 34880 KB Output is correct
17 Correct 79 ms 33604 KB Output is correct
18 Correct 44 ms 25608 KB Output is correct
19 Correct 124 ms 33792 KB Output is correct
20 Correct 159 ms 34132 KB Output is correct
21 Correct 154 ms 34152 KB Output is correct
22 Correct 173 ms 34240 KB Output is correct
23 Correct 168 ms 34220 KB Output is correct
24 Correct 107 ms 33984 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4600 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4564 KB Output is correct
31 Correct 1 ms 4440 KB Output is correct
32 Correct 1 ms 4440 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 80 ms 33544 KB Output is correct
16 Correct 88 ms 34880 KB Output is correct
17 Correct 79 ms 33604 KB Output is correct
18 Correct 44 ms 25608 KB Output is correct
19 Correct 124 ms 33792 KB Output is correct
20 Correct 159 ms 34132 KB Output is correct
21 Correct 154 ms 34152 KB Output is correct
22 Correct 173 ms 34240 KB Output is correct
23 Correct 168 ms 34220 KB Output is correct
24 Correct 107 ms 33984 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4600 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4564 KB Output is correct
42 Correct 1 ms 4440 KB Output is correct
43 Correct 1 ms 4440 KB Output is correct
44 Correct 80 ms 25388 KB Output is correct
45 Correct 84 ms 25452 KB Output is correct
46 Correct 60 ms 25316 KB Output is correct
47 Correct 39 ms 20496 KB Output is correct
48 Correct 150 ms 32364 KB Output is correct
49 Correct 176 ms 34240 KB Output is correct
50 Correct 105 ms 24384 KB Output is correct
51 Correct 103 ms 24424 KB Output is correct
52 Correct 98 ms 24412 KB Output is correct
53 Correct 34 ms 19856 KB Output is correct
54 Correct 222 ms 30576 KB Output is correct
55 Correct 131 ms 31548 KB Output is correct
56 Correct 120 ms 31860 KB Output is correct
57 Correct 32 ms 18812 KB Output is correct
58 Correct 29 ms 18884 KB Output is correct
59 Correct 37 ms 19188 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 2 ms 4704 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4696 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 2 ms 4700 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4816 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 2 ms 4704 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4696 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 2 ms 4700 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4816 KB Output is correct
14 Correct 309 ms 71920 KB Output is correct
15 Correct 738 ms 72060 KB Output is correct
16 Correct 730 ms 70592 KB Output is correct
17 Correct 720 ms 70484 KB Output is correct
18 Correct 724 ms 70492 KB Output is correct
19 Correct 750 ms 71092 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 320 ms 71872 KB Output is correct
23 Correct 348 ms 72016 KB Output is correct
24 Correct 293 ms 70108 KB Output is correct

Subtask #7
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4440 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4600 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4440 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4444 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 1 ms 4564 KB Output is correct
31 Correct 1 ms 4440 KB Output is correct
32 Correct 1 ms 4440 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4440 KB Output is correct
35 Correct 2 ms 4704 KB Output is correct
36 Correct 2 ms 4700 KB Output is correct
37 Correct 2 ms 4696 KB Output is correct
38 Correct 2 ms 4696 KB Output is correct
39 Correct 2 ms 4700 KB Output is correct
40 Correct 2 ms 4700 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 4444 KB Output is correct
43 Correct 2 ms 4700 KB Output is correct
44 Correct 2 ms 4700 KB Output is correct
45 Correct 2 ms 4816 KB Output is correct
46 Correct 2 ms 4696 KB Output is correct
47 Correct 2 ms 4700 KB Output is correct
48 Correct 2 ms 4828 KB Output is correct
49 Correct 2 ms 4444 KB Output is correct
50 Correct 1 ms 4444 KB Output is correct
51 Correct 1 ms 4444 KB Output is correct
52 Correct 1 ms 4568 KB Output is correct
53 Correct 1 ms 4444 KB Output is correct
54 Correct 2 ms 4700 KB Output is correct
55 Correct 1 ms 4444 KB Output is correct
56 Correct 1 ms 4444 KB Output is correct
57 Correct 1 ms 4444 KB Output is correct

Subtask #8
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 80 ms 33544 KB Output is correct
16 Correct 88 ms 34880 KB Output is correct
17 Correct 79 ms 33604 KB Output is correct
18 Correct 44 ms 25608 KB Output is correct
19 Correct 124 ms 33792 KB Output is correct
20 Correct 159 ms 34132 KB Output is correct
21 Correct 154 ms 34152 KB Output is correct
22 Correct 173 ms 34240 KB Output is correct
23 Correct 168 ms 34220 KB Output is correct
24 Correct 107 ms 33984 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4600 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 4440 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4440 KB Output is correct
34 Correct 1 ms 4444 KB Output is correct
35 Correct 1 ms 4444 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 4444 KB Output is correct
38 Correct 1 ms 4444 KB Output is correct
39 Correct 1 ms 4444 KB Output is correct
40 Correct 1 ms 4444 KB Output is correct
41 Correct 1 ms 4564 KB Output is correct
42 Correct 1 ms 4440 KB Output is correct
43 Correct 1 ms 4440 KB Output is correct
44 Correct 80 ms 25388 KB Output is correct
45 Correct 84 ms 25452 KB Output is correct
46 Correct 60 ms 25316 KB Output is correct
47 Correct 39 ms 20496 KB Output is correct
48 Correct 150 ms 32364 KB Output is correct
49 Correct 176 ms 34240 KB Output is correct
50 Correct 105 ms 24384 KB Output is correct
51 Correct 103 ms 24424 KB Output is correct
52 Correct 98 ms 24412 KB Output is correct
53 Correct 34 ms 19856 KB Output is correct
54 Correct 222 ms 30576 KB Output is correct
55 Correct 131 ms 31548 KB Output is correct
56 Correct 120 ms 31860 KB Output is correct
57 Correct 32 ms 18812 KB Output is correct
58 Correct 29 ms 18884 KB Output is correct
59 Correct 37 ms 19188 KB Output is correct
60 Correct 1 ms 4440 KB Output is correct
61 Correct 1 ms 4440 KB Output is correct
62 Correct 2 ms 4704 KB Output is correct
63 Correct 2 ms 4700 KB Output is correct
64 Correct 2 ms 4696 KB Output is correct
65 Correct 2 ms 4696 KB Output is correct
66 Correct 2 ms 4700 KB Output is correct
67 Correct 2 ms 4700 KB Output is correct
68 Correct 1 ms 4444 KB Output is correct
69 Correct 1 ms 4444 KB Output is correct
70 Correct 2 ms 4700 KB Output is correct
71 Correct 2 ms 4700 KB Output is correct
72 Correct 2 ms 4816 KB Output is correct
73 Correct 309 ms 71920 KB Output is correct
74 Correct 738 ms 72060 KB Output is correct
75 Correct 730 ms 70592 KB Output is correct
76 Correct 720 ms 70484 KB Output is correct
77 Correct 724 ms 70492 KB Output is correct
78 Correct 750 ms 71092 KB Output is correct
79 Correct 1 ms 4444 KB Output is correct
80 Correct 1 ms 4440 KB Output is correct
81 Correct 320 ms 71872 KB Output is correct
82 Correct 348 ms 72016 KB Output is correct
83 Correct 293 ms 70108 KB Output is correct
84 Correct 2 ms 4696 KB Output is correct
85 Correct 2 ms 4700 KB Output is correct
86 Correct 2 ms 4828 KB Output is correct
87 Correct 2 ms 4444 KB Output is correct
88 Correct 1 ms 4444 KB Output is correct
89 Correct 1 ms 4444 KB Output is correct
90 Correct 1 ms 4568 KB Output is correct
91 Correct 1 ms 4444 KB Output is correct
92 Correct 2 ms 4700 KB Output is correct
93 Correct 1 ms 4444 KB Output is correct
94 Correct 1 ms 4444 KB Output is correct
95 Correct 1 ms 4444 KB Output is correct
96 Correct 103 ms 24436 KB Output is correct
97 Correct 131 ms 24020 KB Output is correct
98 Correct 89 ms 23896 KB Output is correct
99 Correct 296 ms 70496 KB Output is correct
100 Correct 140 ms 34628 KB Output is correct
101 Correct 716 ms 72016 KB Output is correct
102 Correct 753 ms 71860 KB Output is correct
103 Correct 724 ms 51000 KB Output is correct
104 Correct 276 ms 21080 KB Output is correct
105 Correct 217 ms 19772 KB Output is correct
106 Correct 165 ms 19540 KB Output is correct