oj.uz

Submission #811027

# Submission time Handle Problem Language Result Execution time Memory
811027 2023-08-06T21:00:18 Z Essa2006 Arranging Shoes (IOI19_shoes) C++14
100 / 100
 359 ms 147956 KB 
#include<bits/stdc++.h>
#include "shoes.h"
#include <cstdio>
#include <cassert>
using namespace std;
#define ll long long 
#define endl '\n'
#define FF firtst
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)
const int pr=18, s_p=(1<<pr), e_p=(1<<(pr+1))-1;
vector<int>SS;
map<int, queue<int>>mp;
void pre(){
    SS.clear(), mp.clear();
    SS.resize(1<<(pr+1));
}
void update(int id, int u, int v, int l, int r){
    if(l>v || r<u)
        return;
    if(l>=u && r<=v){
        SS[id]++;
        return;
    }
    int md=(l+r)/2;
    update(id*2, u, v, l, md);
    update(id*2+1, u, v, md+1, r);
        
}
int get(int ind){
    ll res=SS[ind];
    while(ind/=2)
        res+=SS[ind];
    return res;
}
ll count_swaps(vector<int> A){
    int n=A.size();
    pre();
    ll ans=0;
    for(int i=0;i<n;i++){
        if(A[i]>0 && !mp[-A[i]].empty()){
            int u=mp[-A[i]].front();
            mp[-A[i]].pop();
            ans+=i-u-get(u+s_p)-1;
            if(u!=i-1)
                update(1, u+1+s_p, i-1+s_p, s_p, e_p);
        }
        else if(A[i]<0 && !mp[-A[i]].empty()){
            int u=mp[-A[i]].front();
            mp[-A[i]].pop();
            ans+=i-u-get(u+s_p);
            update(1, u+s_p, i-1+s_p, s_p, e_p);
        }
        else{
            mp[A[i]].push(i);
        }
    }
    return ans;
    
}
//ll count_swaps2(vector<int> A){
//    bool same=1;
//    int n=A.size();
//    for(int i=1;i<n;i++){
//        if(abs(A[i])!=abs(A[i-1]))
//            same=0;
//    }
//    if(n/2<=1000){
//        int ans=0;
//        for(int i=0;i<n;i++){
//            if(A[i]>0){
//                bool found=0;
//                int ind=0;
//                for(int j=0;j<i;j++){
//                    if(-A[j]==A[i] && A[j+1]!=-A[j]){
//                        found=1;
//                        ind=j;
//                        break;
//                    }
//                }
//                if(found){
//                    for(int j=i-1;j>ind;j--){
//                        swap(A[j], A[j+1]);
//                        ans++;
//                    }
//                }
//            }
//            else if(A[i]<0){
//                bool found=0;
//                int ind=0;
//                for(int j=0;j<i;j++){
//                    if(-A[j]==A[i] && (!j || A[j]!=-A[j-1])){
//                        found=1;
//                        ind=j;
//                        break;
//                    }
//                }
//                if(found){
//                    for(int j=i-1;j>=ind;j--){
//                        swap(A[j], A[j+1]);
//                        ans++;
//                    }
//                }
//            }
//        }
//        return ans;
//    }
//    if(n/2>1000 && !same){
//        ll ans=A.size()/2;
//        return ans*(ans-1)/2;
//    }
//    
//} 
// 
//int main() {
//    for(int k=1;k<=8;k++){
//        vector<int>S;
//        for(int i=1;i<=k;i++){
//            S.push_back(i);
//            S.push_back(-i);
//        }
//        sort(all(S));
//        do{
//            long long result1 = count_swaps(S), result2=count_swaps2(S);
//            if(result1!=result2){
//                cout<<S.size()<<endl;
//                for(int i=0;i<S.size();i++){
//                    cout<<S[i]<<' ';
//                }
//                cout<<endl;
//                cout<<"Cor "<<result2<<endl<<"Wro "<<result1;
//                return 0;
//            }
//        }
//        while(next_permutation(all(S)));
//    }
//}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2284 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2284 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 1 ms 2260 KB Output is correct
10 Correct 2 ms 2364 KB Output is correct
11 Correct 1 ms 2260 KB Output is correct
12 Correct 1 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 2260 KB Output is correct
15 Correct 1 ms 2260 KB Output is correct
16 Correct 1 ms 2260 KB Output is correct
17 Correct 1 ms 2260 KB Output is correct
18 Correct 1 ms 2260 KB Output is correct
19 Correct 2 ms 2260 KB Output is correct
20 Correct 4 ms 2516 KB Output is correct
21 Correct 4 ms 2516 KB Output is correct
22 Correct 32 ms 3820 KB Output is correct
23 Correct 18 ms 3904 KB Output is correct
24 Correct 30 ms 3924 KB Output is correct
25 Correct 34 ms 4352 KB Output is correct
26 Correct 32 ms 3912 KB Output is correct
27 Correct 25 ms 3916 KB Output is correct
28 Correct 37 ms 4332 KB Output is correct
29 Correct 34 ms 4324 KB Output is correct
30 Correct 34 ms 4308 KB Output is correct
31 Correct 32 ms 3924 KB Output is correct
32 Correct 34 ms 4292 KB Output is correct
33 Correct 34 ms 4308 KB Output is correct
34 Correct 35 ms 4296 KB Output is correct
35 Correct 1 ms 2260 KB Output is correct
36 Correct 1 ms 2260 KB Output is correct
37 Correct 34 ms 4300 KB Output is correct
38 Correct 34 ms 4292 KB Output is correct
39 Correct 34 ms 4308 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2320 KB Output is correct
2 Correct 1 ms 2312 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 316 ms 147824 KB Output is correct
6 Correct 102 ms 16528 KB Output is correct
7 Correct 333 ms 147956 KB Output is correct
8 Correct 36 ms 4308 KB Output is correct
9 Correct 323 ms 147932 KB Output is correct
10 Correct 238 ms 76020 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2284 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 1 ms 2260 KB Output is correct
10 Correct 1 ms 2260 KB Output is correct
11 Correct 1 ms 2260 KB Output is correct
12 Correct 1 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 2260 KB Output is correct
15 Correct 1 ms 2260 KB Output is correct
16 Correct 1 ms 2260 KB Output is correct
17 Correct 1 ms 2260 KB Output is correct
18 Correct 1 ms 2260 KB Output is correct
19 Correct 1 ms 2260 KB Output is correct
20 Correct 1 ms 2260 KB Output is correct
21 Correct 1 ms 2260 KB Output is correct
22 Correct 1 ms 2260 KB Output is correct
23 Correct 2 ms 2260 KB Output is correct
24 Correct 1 ms 2260 KB Output is correct
25 Correct 1 ms 2260 KB Output is correct
26 Correct 1 ms 2260 KB Output is correct
27 Correct 1 ms 2260 KB Output is correct
28 Correct 1 ms 2260 KB Output is correct
29 Correct 1 ms 2260 KB Output is correct
30 Correct 1 ms 2260 KB Output is correct
31 Correct 1 ms 2260 KB Output is correct
32 Correct 1 ms 2260 KB Output is correct
33 Correct 1 ms 2316 KB Output is correct
34 Correct 1 ms 2260 KB Output is correct
35 Correct 1 ms 2260 KB Output is correct
36 Correct 1 ms 2260 KB Output is correct
37 Correct 1 ms 2260 KB Output is correct
38 Correct 1 ms 2388 KB Output is correct
39 Correct 1 ms 2388 KB Output is correct
40 Correct 1 ms 2644 KB Output is correct
41 Correct 2 ms 3796 KB Output is correct
42 Correct 2 ms 3796 KB Output is correct
43 Correct 2 ms 3540 KB Output is correct
44 Correct 2 ms 3412 KB Output is correct
45 Correct 2 ms 3284 KB Output is correct
46 Correct 2 ms 3156 KB Output is correct
47 Correct 2 ms 2900 KB Output is correct
48 Correct 2 ms 2772 KB Output is correct
49 Correct 2 ms 2644 KB Output is correct
50 Correct 1 ms 2388 KB Output is correct
51 Correct 1 ms 2260 KB Output is correct
52 Correct 2 ms 3796 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2284 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 1 ms 2260 KB Output is correct
10 Correct 1 ms 2260 KB Output is correct
11 Correct 1 ms 2260 KB Output is correct
12 Correct 1 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 2260 KB Output is correct
15 Correct 1 ms 2260 KB Output is correct
16 Correct 1 ms 2260 KB Output is correct
17 Correct 1 ms 2260 KB Output is correct
18 Correct 1 ms 2260 KB Output is correct
19 Correct 1 ms 2260 KB Output is correct
20 Correct 1 ms 2260 KB Output is correct
21 Correct 1 ms 2260 KB Output is correct
22 Correct 1 ms 2260 KB Output is correct
23 Correct 2 ms 2260 KB Output is correct
24 Correct 1 ms 2260 KB Output is correct
25 Correct 1 ms 2260 KB Output is correct
26 Correct 1 ms 2260 KB Output is correct
27 Correct 1 ms 2260 KB Output is correct
28 Correct 1 ms 2260 KB Output is correct
29 Correct 1 ms 2260 KB Output is correct
30 Correct 1 ms 2260 KB Output is correct
31 Correct 1 ms 2260 KB Output is correct
32 Correct 1 ms 2260 KB Output is correct
33 Correct 1 ms 2316 KB Output is correct
34 Correct 1 ms 2260 KB Output is correct
35 Correct 1 ms 2260 KB Output is correct
36 Correct 1 ms 2260 KB Output is correct
37 Correct 1 ms 2260 KB Output is correct
38 Correct 1 ms 2260 KB Output is correct
39 Correct 1 ms 2260 KB Output is correct
40 Correct 1 ms 2260 KB Output is correct
41 Correct 1 ms 2260 KB Output is correct
42 Correct 1 ms 2260 KB Output is correct
43 Correct 1 ms 2260 KB Output is correct
44 Correct 2 ms 2364 KB Output is correct
45 Correct 1 ms 2260 KB Output is correct
46 Correct 1 ms 2260 KB Output is correct
47 Correct 1 ms 2260 KB Output is correct
48 Correct 1 ms 2260 KB Output is correct
49 Correct 1 ms 2260 KB Output is correct
50 Correct 1 ms 2260 KB Output is correct
51 Correct 1 ms 2260 KB Output is correct
52 Correct 1 ms 2260 KB Output is correct
53 Correct 2 ms 2260 KB Output is correct
54 Correct 4 ms 2516 KB Output is correct
55 Correct 4 ms 2516 KB Output is correct
56 Correct 32 ms 3820 KB Output is correct
57 Correct 18 ms 3904 KB Output is correct
58 Correct 30 ms 3924 KB Output is correct
59 Correct 34 ms 4352 KB Output is correct
60 Correct 32 ms 3912 KB Output is correct
61 Correct 25 ms 3916 KB Output is correct
62 Correct 37 ms 4332 KB Output is correct
63 Correct 34 ms 4324 KB Output is correct
64 Correct 34 ms 4308 KB Output is correct
65 Correct 32 ms 3924 KB Output is correct
66 Correct 34 ms 4292 KB Output is correct
67 Correct 34 ms 4308 KB Output is correct
68 Correct 35 ms 4296 KB Output is correct
69 Correct 1 ms 2260 KB Output is correct
70 Correct 1 ms 2260 KB Output is correct
71 Correct 34 ms 4300 KB Output is correct
72 Correct 34 ms 4292 KB Output is correct
73 Correct 34 ms 4308 KB Output is correct
74 Correct 1 ms 2320 KB Output is correct
75 Correct 1 ms 2312 KB Output is correct
76 Correct 1 ms 2260 KB Output is correct
77 Correct 1 ms 2260 KB Output is correct
78 Correct 316 ms 147824 KB Output is correct
79 Correct 102 ms 16528 KB Output is correct
80 Correct 333 ms 147956 KB Output is correct
81 Correct 36 ms 4308 KB Output is correct
82 Correct 323 ms 147932 KB Output is correct
83 Correct 238 ms 76020 KB Output is correct
84 Correct 1 ms 2260 KB Output is correct
85 Correct 1 ms 2388 KB Output is correct
86 Correct 1 ms 2388 KB Output is correct
87 Correct 1 ms 2644 KB Output is correct
88 Correct 2 ms 3796 KB Output is correct
89 Correct 2 ms 3796 KB Output is correct
90 Correct 2 ms 3540 KB Output is correct
91 Correct 2 ms 3412 KB Output is correct
92 Correct 2 ms 3284 KB Output is correct
93 Correct 2 ms 3156 KB Output is correct
94 Correct 2 ms 2900 KB Output is correct
95 Correct 2 ms 2772 KB Output is correct
96 Correct 2 ms 2644 KB Output is correct
97 Correct 1 ms 2388 KB Output is correct
98 Correct 1 ms 2260 KB Output is correct
99 Correct 2 ms 3796 KB Output is correct
100 Correct 2 ms 3796 KB Output is correct
101 Correct 24 ms 15432 KB Output is correct
102 Correct 10 ms 5332 KB Output is correct
103 Correct 359 ms 147928 KB Output is correct
104 Correct 263 ms 147832 KB Output is correct
105 Correct 239 ms 85688 KB Output is correct
106 Correct 329 ms 147916 KB Output is correct
107 Correct 98 ms 19896 KB Output is correct
108 Correct 124 ms 35904 KB Output is correct
109 Correct 35 ms 4288 KB Output is correct
110 Correct 34 ms 4308 KB Output is correct
111 Correct 299 ms 131896 KB Output is correct
112 Correct 318 ms 116048 KB Output is correct
113 Correct 125 ms 21696 KB Output is correct
114 Correct 320 ms 147904 KB Output is correct
115 Correct 336 ms 147920 KB Output is correct