oj.uz

Submission #318128

# Submission time Handle Problem Language Result Execution time Memory
318128 2020-10-31T13:38:24 Z NicolaAbusaad2014 Arranging Shoes (IOI19_shoes) C++14
100 / 100
 694 ms 49772 KB 
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long>tree;
long long mod=1e9+7;
long long power(long long x,long long p)
{
    if(p==0){
        return 1;
    }
    long long z=power(x,p/2);
    z=(z*z)%mod;
    if(p%2==1){
        z=(z*x)%mod;
    }
    return z;
}
long long power_of_two(long long x)
{
    long long z=0;
    while(x>1){
        x/=2;
        z++;
    }
    return z;
}
void segment_tree(vector<long long>v)
{
    long long x=v.size();
    x=power_of_two(x);
    x=power(2,x);
    if(v.size()!=x){
        x*=2;
    }
    tree.resize(x*2);
    tree[0]=x;
    for(long i=0;i<v.size();i++){
        tree[i+x]=v[i];
    }
    for(long i=x-1;i>0;i--){
        tree[i]=tree[i*2]+tree[(i*2)+1];
    }
}
long long seg(long long l,long long r)
{
    l+=tree[0];
    r+=tree[0];
    long long ans=0;
    while(l<=r){
        if(l%2==1){
            ans+=tree[l];
        }
        if(r%2==0){
            ans+=tree[r];
        }
        l++;
        l/=2;
        r--;
        r/=2;
    }
    return ans;
}
void update(long long x,long long z)
{
    x+=tree[0];
    tree[x]=z;
    x/=2;
    while(x>0){
        tree[x]=tree[x*2]+tree[(x*2)+1];
        x/=2;
    }
}
long long count_swaps(std::vector<int> s) {
    long long n=s.size();
    vector<long long>v(n);
    segment_tree(v);
    map<long,vector<long> >vis;
    map<long,long>z;
    map<long,bool>ok;
    long long ans=0,x;
    for(long i=0;i<n;i++){
        vis[s[i]].push_back(i);
    }
    for(long i=0;i<n;i++){
        if(ok[i]){
            ok[i]=false;
        }
        else{
            x=vis[-s[i]][z[abs(s[i])]];
            ans+=(x-i-1)-seg(i,x);
            if(s[i]>0){
                ans++;
            }
            z[abs(s[i])]++;
            update(x,1);
            ok[x]=true;
        }
    }
	return ans;
}

Compilation message

shoes.cpp: In function 'void segment_tree(std::vector<long long int>)':
shoes.cpp:32:16: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   32 |     if(v.size()!=x){
      |        ~~~~~~~~^~~
shoes.cpp:37:19: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(long i=0;i<v.size();i++){
      |                  ~^~~~~~~~~

Subtask #1
10.0 / 10.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

Subtask #2
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 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 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 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 0 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct

Subtask #3
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 364 KB Output is correct
4 Correct 0 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 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 11 ms 2764 KB Output is correct
21 Correct 11 ms 2636 KB Output is correct
22 Correct 122 ms 22984 KB Output is correct
23 Correct 118 ms 23112 KB Output is correct
24 Correct 100 ms 23112 KB Output is correct
25 Correct 135 ms 22696 KB Output is correct
26 Correct 125 ms 22988 KB Output is correct
27 Correct 119 ms 22856 KB Output is correct
28 Correct 134 ms 22984 KB Output is correct
29 Correct 135 ms 22984 KB Output is correct
30 Correct 132 ms 22984 KB Output is correct
31 Correct 126 ms 23240 KB Output is correct
32 Correct 133 ms 22984 KB Output is correct
33 Correct 148 ms 22856 KB Output is correct
34 Correct 149 ms 22996 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 0 ms 364 KB Output is correct
37 Correct 133 ms 22984 KB Output is correct
38 Correct 133 ms 22984 KB Output is correct
39 Correct 133 ms 23112 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 522 ms 49772 KB Output is correct
6 Correct 239 ms 25800 KB Output is correct
7 Correct 516 ms 49608 KB Output is correct
8 Correct 140 ms 22984 KB Output is correct
9 Correct 509 ms 49608 KB Output is correct
10 Correct 382 ms 35912 KB Output is correct

Subtask #5
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 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 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 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 0 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 3 ms 748 KB Output is correct
42 Correct 2 ms 748 KB Output is correct
43 Correct 3 ms 748 KB Output is correct
44 Correct 2 ms 748 KB Output is correct
45 Correct 2 ms 748 KB Output is correct
46 Correct 2 ms 620 KB Output is correct
47 Correct 2 ms 620 KB Output is correct
48 Correct 2 ms 620 KB Output is correct
49 Correct 2 ms 620 KB Output is correct
50 Correct 2 ms 492 KB Output is correct
51 Correct 1 ms 492 KB Output is correct
52 Correct 2 ms 748 KB Output is correct

Subtask #6
15.0 / 15.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 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 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 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 0 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 0 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 0 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 492 KB Output is correct
53 Correct 2 ms 492 KB Output is correct
54 Correct 11 ms 2764 KB Output is correct
55 Correct 11 ms 2636 KB Output is correct
56 Correct 122 ms 22984 KB Output is correct
57 Correct 118 ms 23112 KB Output is correct
58 Correct 100 ms 23112 KB Output is correct
59 Correct 135 ms 22696 KB Output is correct
60 Correct 125 ms 22988 KB Output is correct
61 Correct 119 ms 22856 KB Output is correct
62 Correct 134 ms 22984 KB Output is correct
63 Correct 135 ms 22984 KB Output is correct
64 Correct 132 ms 22984 KB Output is correct
65 Correct 126 ms 23240 KB Output is correct
66 Correct 133 ms 22984 KB Output is correct
67 Correct 148 ms 22856 KB Output is correct
68 Correct 149 ms 22996 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 0 ms 364 KB Output is correct
71 Correct 133 ms 22984 KB Output is correct
72 Correct 133 ms 22984 KB Output is correct
73 Correct 133 ms 23112 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 0 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 0 ms 364 KB Output is correct
78 Correct 522 ms 49772 KB Output is correct
79 Correct 239 ms 25800 KB Output is correct
80 Correct 516 ms 49608 KB Output is correct
81 Correct 140 ms 22984 KB Output is correct
82 Correct 509 ms 49608 KB Output is correct
83 Correct 382 ms 35912 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 1 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 3 ms 748 KB Output is correct
89 Correct 2 ms 748 KB Output is correct
90 Correct 3 ms 748 KB Output is correct
91 Correct 2 ms 748 KB Output is correct
92 Correct 2 ms 748 KB Output is correct
93 Correct 2 ms 620 KB Output is correct
94 Correct 2 ms 620 KB Output is correct
95 Correct 2 ms 620 KB Output is correct
96 Correct 2 ms 620 KB Output is correct
97 Correct 2 ms 492 KB Output is correct
98 Correct 1 ms 492 KB Output is correct
99 Correct 2 ms 748 KB Output is correct
100 Correct 3 ms 748 KB Output is correct
101 Correct 30 ms 5068 KB Output is correct
102 Correct 22 ms 3276 KB Output is correct
103 Correct 694 ms 49480 KB Output is correct
104 Correct 499 ms 49736 KB Output is correct
105 Correct 486 ms 37704 KB Output is correct
106 Correct 506 ms 49480 KB Output is correct
107 Correct 254 ms 26568 KB Output is correct
108 Correct 262 ms 29256 KB Output is correct
109 Correct 130 ms 23112 KB Output is correct
110 Correct 137 ms 22984 KB Output is correct
111 Correct 453 ms 46572 KB Output is correct
112 Correct 590 ms 43336 KB Output is correct
113 Correct 340 ms 26692 KB Output is correct
114 Correct 522 ms 49532 KB Output is correct
115 Correct 489 ms 49608 KB Output is correct