oj.uz

Submission #952755

# Submission time Handle Problem Language Result Execution time Memory
952755 2024-03-24T17:10:56 Z batsukh2006 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 254 ms 277336 KB 
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 

#include "shoes.h"
 
using namespace std;
 
const int mxN=2e5;
vector<int> tree(4*mxN);
int cal(int node, int L, int R, int l, int r){
    if(L>r||R<l) return 0;
    if(L>=l&&R<=r) return tree[node];
    return cal(node*2,L,(L+R)/2,l,r)+cal(node*2+1,(L+R)/2+1,R,l,r);
}
void up(int node, int L, int R, int l, int r){
    if(L>r||R<l) return;
    if(L==R){
        tree[node]=1;
        return;
    }
    up(node*2,L,(L+R)/2,l,r);
    up(node*2+1,(L+R)/2+1,R,l,r);
    tree[node]=tree[node*2]+tree[node*2+1];
}
long long count_swaps(vector<int> s){
    vector<int> p(s.size());
    vector<stack<int> > v(s.size()+s.size()+1);
    for(int i=s.size()-1; i>=0; i--){
        v[s[i]+s.size()].push(i);
    }
    for(int i=0,j=0; i<s.size(); i++){
        if(!v[s[i]+s.size()].empty()&&v[s[i]+s.size()].top()==i){
            if(s[i]<0){
                p[j]=i;
                j++;
                p[j++]=v[-s[i]+s.size()].top();
                v[s[i]+s.size()].pop();
                v[-s[i]+s.size()].pop();
            }else{
                p[j++]=v[-s[i]+s.size()].top();
                p[j]=i;
                v[s[i]+s.size()].pop();
                v[-s[i]+s.size()].pop();
                j++;
            }
        }
    }
    long long ans=0;
    for(int i=0; i<p.size(); i++){
        ans+=cal(1,0,s.size(),p[i],s.size());
        up(1,0,s.size(),p[i],p[i]);
    }
    return ans;
}
// signed main(){
// 	// freopen("hps.in", "r", stdin);
// 	// freopen("hps.out", "w", stdout);
// 	ios::sync_with_stdio(0);
// 	cin.tie(0);
// 	cout.tie(0);
	
// 	int t=1;
// 	// cin>>t;
// 	while(t--){
// 		cout<<endl;
// 	}
// 	return 0;
// }

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for(int i=0,j=0; i<s.size(); i++){
      |                      ~^~~~~~~~~
shoes.cpp:65:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int i=0; i<p.size(); i++){
      |                  ~^~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3420 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 2 ms 3420 KB Output is correct
5 Correct 1 ms 3416 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 2 ms 3420 KB Output is correct
8 Correct 1 ms 3672 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 2 ms 3420 KB Output is correct
11 Correct 2 ms 3420 KB Output is correct
12 Correct 1 ms 3420 KB Output is correct
13 Correct 2 ms 3420 KB Output is correct
14 Correct 1 ms 3420 KB Output is correct
15 Correct 1 ms 3672 KB Output is correct
16 Correct 2 ms 3676 KB Output is correct
17 Correct 2 ms 4188 KB Output is correct
18 Correct 3 ms 6236 KB Output is correct
19 Correct 3 ms 6236 KB Output is correct
20 Correct 21 ms 30812 KB Output is correct
21 Correct 21 ms 30812 KB Output is correct
22 Correct 237 ms 277080 KB Output is correct
23 Correct 193 ms 277072 KB Output is correct
24 Correct 194 ms 277076 KB Output is correct
25 Correct 189 ms 277088 KB Output is correct
26 Correct 197 ms 277072 KB Output is correct
27 Correct 188 ms 277092 KB Output is correct
28 Correct 199 ms 277288 KB Output is correct
29 Correct 187 ms 277076 KB Output is correct
30 Correct 185 ms 277116 KB Output is correct
31 Correct 204 ms 277336 KB Output is correct
32 Correct 186 ms 277076 KB Output is correct
33 Correct 189 ms 277072 KB Output is correct
34 Correct 193 ms 277220 KB Output is correct
35 Correct 1 ms 3420 KB Output is correct
36 Correct 1 ms 3420 KB Output is correct
37 Correct 187 ms 277288 KB Output is correct
38 Correct 184 ms 277084 KB Output is correct
39 Correct 186 ms 277164 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 1 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 2 ms 3420 KB Output is correct
5 Correct 199 ms 275028 KB Output is correct
6 Correct 199 ms 274992 KB Output is correct
7 Correct 234 ms 275180 KB Output is correct
8 Correct 183 ms 275796 KB Output is correct
9 Correct 217 ms 274984 KB Output is correct
10 Correct 198 ms 275028 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3420 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 2 ms 3416 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 2 ms 3416 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 2 ms 3420 KB Output is correct
13 Correct 2 ms 3420 KB Output is correct
14 Correct 1 ms 3420 KB Output is correct
15 Correct 1 ms 3420 KB Output is correct
16 Correct 1 ms 3420 KB Output is correct
17 Correct 1 ms 3420 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 2 ms 3416 KB Output is correct
20 Correct 1 ms 3420 KB Output is correct
21 Correct 1 ms 3584 KB Output is correct
22 Correct 2 ms 3416 KB Output is correct
23 Correct 1 ms 3420 KB Output is correct
24 Correct 1 ms 3420 KB Output is correct
25 Correct 1 ms 3416 KB Output is correct
26 Correct 1 ms 3420 KB Output is correct
27 Correct 1 ms 3580 KB Output is correct
28 Correct 1 ms 3420 KB Output is correct
29 Correct 1 ms 3424 KB Output is correct
30 Correct 2 ms 3420 KB Output is correct
31 Correct 1 ms 3420 KB Output is correct
32 Correct 1 ms 3424 KB Output is correct
33 Correct 2 ms 3420 KB Output is correct
34 Correct 2 ms 3580 KB Output is correct
35 Correct 1 ms 3424 KB Output is correct
36 Correct 2 ms 3424 KB Output is correct
37 Correct 1 ms 3420 KB Output is correct
38 Correct 2 ms 3676 KB Output is correct
39 Correct 1 ms 3676 KB Output is correct
40 Correct 2 ms 4188 KB Output is correct
41 Correct 4 ms 6236 KB Output is correct
42 Correct 3 ms 6236 KB Output is correct
43 Correct 3 ms 6236 KB Output is correct
44 Correct 3 ms 6236 KB Output is correct
45 Correct 3 ms 6488 KB Output is correct
46 Correct 3 ms 6236 KB Output is correct
47 Correct 3 ms 6168 KB Output is correct
48 Correct 3 ms 6236 KB Output is correct
49 Correct 3 ms 6148 KB Output is correct
50 Correct 4 ms 6232 KB Output is correct
51 Correct 3 ms 6236 KB Output is correct
52 Correct 3 ms 6488 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3420 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 2 ms 3416 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 2 ms 3416 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 2 ms 3420 KB Output is correct
13 Correct 2 ms 3420 KB Output is correct
14 Correct 1 ms 3420 KB Output is correct
15 Correct 1 ms 3420 KB Output is correct
16 Correct 1 ms 3420 KB Output is correct
17 Correct 1 ms 3420 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 2 ms 3416 KB Output is correct
20 Correct 1 ms 3420 KB Output is correct
21 Correct 1 ms 3584 KB Output is correct
22 Correct 2 ms 3416 KB Output is correct
23 Correct 1 ms 3420 KB Output is correct
24 Correct 1 ms 3420 KB Output is correct
25 Correct 1 ms 3416 KB Output is correct
26 Correct 1 ms 3420 KB Output is correct
27 Correct 1 ms 3580 KB Output is correct
28 Correct 1 ms 3420 KB Output is correct
29 Correct 1 ms 3424 KB Output is correct
30 Correct 2 ms 3420 KB Output is correct
31 Correct 1 ms 3420 KB Output is correct
32 Correct 1 ms 3424 KB Output is correct
33 Correct 2 ms 3420 KB Output is correct
34 Correct 2 ms 3580 KB Output is correct
35 Correct 1 ms 3424 KB Output is correct
36 Correct 2 ms 3424 KB Output is correct
37 Correct 1 ms 3420 KB Output is correct
38 Correct 2 ms 3420 KB Output is correct
39 Correct 1 ms 3416 KB Output is correct
40 Correct 1 ms 3420 KB Output is correct
41 Correct 2 ms 3420 KB Output is correct
42 Correct 1 ms 3672 KB Output is correct
43 Correct 1 ms 3420 KB Output is correct
44 Correct 2 ms 3420 KB Output is correct
45 Correct 2 ms 3420 KB Output is correct
46 Correct 1 ms 3420 KB Output is correct
47 Correct 2 ms 3420 KB Output is correct
48 Correct 1 ms 3420 KB Output is correct
49 Correct 1 ms 3672 KB Output is correct
50 Correct 2 ms 3676 KB Output is correct
51 Correct 2 ms 4188 KB Output is correct
52 Correct 3 ms 6236 KB Output is correct
53 Correct 3 ms 6236 KB Output is correct
54 Correct 21 ms 30812 KB Output is correct
55 Correct 21 ms 30812 KB Output is correct
56 Correct 237 ms 277080 KB Output is correct
57 Correct 193 ms 277072 KB Output is correct
58 Correct 194 ms 277076 KB Output is correct
59 Correct 189 ms 277088 KB Output is correct
60 Correct 197 ms 277072 KB Output is correct
61 Correct 188 ms 277092 KB Output is correct
62 Correct 199 ms 277288 KB Output is correct
63 Correct 187 ms 277076 KB Output is correct
64 Correct 185 ms 277116 KB Output is correct
65 Correct 204 ms 277336 KB Output is correct
66 Correct 186 ms 277076 KB Output is correct
67 Correct 189 ms 277072 KB Output is correct
68 Correct 193 ms 277220 KB Output is correct
69 Correct 1 ms 3420 KB Output is correct
70 Correct 1 ms 3420 KB Output is correct
71 Correct 187 ms 277288 KB Output is correct
72 Correct 184 ms 277084 KB Output is correct
73 Correct 186 ms 277164 KB Output is correct
74 Correct 2 ms 3416 KB Output is correct
75 Correct 1 ms 3420 KB Output is correct
76 Correct 1 ms 3420 KB Output is correct
77 Correct 2 ms 3420 KB Output is correct
78 Correct 199 ms 275028 KB Output is correct
79 Correct 199 ms 274992 KB Output is correct
80 Correct 234 ms 275180 KB Output is correct
81 Correct 183 ms 275796 KB Output is correct
82 Correct 217 ms 274984 KB Output is correct
83 Correct 198 ms 275028 KB Output is correct
84 Correct 1 ms 3420 KB Output is correct
85 Correct 2 ms 3676 KB Output is correct
86 Correct 1 ms 3676 KB Output is correct
87 Correct 2 ms 4188 KB Output is correct
88 Correct 4 ms 6236 KB Output is correct
89 Correct 3 ms 6236 KB Output is correct
90 Correct 3 ms 6236 KB Output is correct
91 Correct 3 ms 6236 KB Output is correct
92 Correct 3 ms 6488 KB Output is correct
93 Correct 3 ms 6236 KB Output is correct
94 Correct 3 ms 6168 KB Output is correct
95 Correct 3 ms 6236 KB Output is correct
96 Correct 3 ms 6148 KB Output is correct
97 Correct 4 ms 6232 KB Output is correct
98 Correct 3 ms 6236 KB Output is correct
99 Correct 3 ms 6488 KB Output is correct
100 Correct 3 ms 6236 KB Output is correct
101 Correct 21 ms 30848 KB Output is correct
102 Correct 21 ms 30812 KB Output is correct
103 Correct 210 ms 276436 KB Output is correct
104 Correct 199 ms 276308 KB Output is correct
105 Correct 211 ms 276432 KB Output is correct
106 Correct 243 ms 276428 KB Output is correct
107 Correct 202 ms 276436 KB Output is correct
108 Correct 194 ms 276308 KB Output is correct
109 Correct 194 ms 277072 KB Output is correct
110 Correct 190 ms 277236 KB Output is correct
111 Correct 209 ms 276332 KB Output is correct
112 Correct 254 ms 276312 KB Output is correct
113 Correct 202 ms 276432 KB Output is correct
114 Correct 200 ms 276308 KB Output is correct
115 Correct 209 ms 276308 KB Output is correct