oj.uz

Submission #182280

# Submission time Handle Problem Language Result Execution time Memory
182280 2020-01-09T12:42:26 Z PedroBigMan Arranging Shoes (IOI19_shoes) C++14
100 / 100
 947 ms 36332 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include "shoes.h"
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF 100000000000000000LL
int insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

class ST
{
    public:
    ll N; vector<ll> ar; vector<ll> p;
    ll neut;
    
    ll op(ll a, ll b)
    {
        return (a+b);
    }
    
    ST(vector<ll> arr)
    {
        neut=0;
        N = (ll) 1<<(ll) ceil(log2(arr.size()));
        REP(i,0,arr.size()) {ar.pb(arr[i]);} 
        REP(i,arr.size(),N) {ar.pb(neut);}
        REP(i,0,N) {p.pb(0);}
        REP(i,0,N) {p.pb(ar[i]);}
        ll cur = N-1;
        while(cur>0)
        {
            p[cur]=op(p[2*cur],p[2*cur+1]);
            cur--;
        }
    }
    
    ll query(ll a,ll b, ll c, ll x, ll y) //c=current node, starting in 1, a,b=range of query, x,y=range of node c in the array down, x,y from 0 to N-1. query(a,b)->query(a,b,1,0,N-1)
    {
        if(y<a || x>b) {return neut;}
        if(x>=a && y<=b) {return p[c];}
        ll mid=(x+y)/2;
        return op(query(a,b,2*c,x,mid),query(a,b,2*c+1,mid+1,y));
    }
    
    void update(ll s, ll a, ll c, ll x, ll y) //positions in [a,b] from 0 to N-1 gets +s
    {
        if(y<a || x>a) {return ;}
        p[c]+=s;
        if(c==a+N) {ar[a]+=s; return;}
        ll mid=(x+y)/2;
        update(s,a,2*c,x,mid); update(s,a,2*c+1,mid+1,y);
    }
};

ll count_swaps(vector<int> s) 
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll N=s.size()/2;
    map<ll,vector<ll> > m;
    vector<ll> xx; 
    REP(i,0,2*N)
    {
        if(m.find(s[i])==m.end()) {m[s[i]]=xx;}
        m[s[i]].pb(i);
    }
    ll ind=0; ll ans=0;
    REP(i,0,2*N)
    {
        if(m.find(i)==m.end()) {continue;}
        REP(j,0,m[i].size())
        {
            if(m[i][j]<m[-i][j]) {ans++;}
            s[m[i][j]]=ind;
            s[m[-i][j]]=ind;
            ind++;
        }
    }
    map<ll,ll> t;
    ind=0;
    REP(i,0,2*N)
    {
        if(t.find(s[i])==t.end()) {t[s[i]]=ind; ind++;}
    }
    REP(i,0,2*N) {s[i]=t[s[i]];}
    vector<ll> x; REP(i,0,N) {x.pb(0LL);}
    ST S(x);
    REP(i,0,2*N)
    {
        ans+=S.query(s[i]+1,S.N-1,1,0,S.N-1);
        S.update(1,s[i],1,0,S.N-1);
    }
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 0 ms 376 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 1 ms 532 KB Output is correct
20 Correct 17 ms 2168 KB Output is correct
21 Correct 18 ms 2168 KB Output is correct
22 Correct 213 ms 15836 KB Output is correct
23 Correct 192 ms 15844 KB Output is correct
24 Correct 201 ms 15832 KB Output is correct
25 Correct 198 ms 15600 KB Output is correct
26 Correct 205 ms 15844 KB Output is correct
27 Correct 191 ms 15740 KB Output is correct
28 Correct 198 ms 15828 KB Output is correct
29 Correct 198 ms 15840 KB Output is correct
30 Correct 199 ms 15844 KB Output is correct
31 Correct 216 ms 15976 KB Output is correct
32 Correct 224 ms 15856 KB Output is correct
33 Correct 216 ms 15712 KB Output is correct
34 Correct 198 ms 15828 KB Output is correct
35 Correct 2 ms 404 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 198 ms 15792 KB Output is correct
38 Correct 198 ms 15852 KB Output is correct
39 Correct 202 ms 15948 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 671 ms 36232 KB Output is correct
6 Correct 393 ms 18352 KB Output is correct
7 Correct 659 ms 36332 KB Output is correct
8 Correct 160 ms 15904 KB Output is correct
9 Correct 947 ms 36224 KB Output is correct
10 Correct 608 ms 25836 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 400 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 0 ms 376 KB Output is correct
7 Correct 1 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 308 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 1 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 236 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 0 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 8 ms 376 KB Output is correct
39 Correct 3 ms 376 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 5 ms 760 KB Output is correct
42 Correct 5 ms 632 KB Output is correct
43 Correct 5 ms 760 KB Output is correct
44 Correct 5 ms 632 KB Output is correct
45 Correct 5 ms 632 KB Output is correct
46 Correct 8 ms 632 KB Output is correct
47 Correct 4 ms 508 KB Output is correct
48 Correct 4 ms 504 KB Output is correct
49 Correct 4 ms 504 KB Output is correct
50 Correct 3 ms 504 KB Output is correct
51 Correct 3 ms 504 KB Output is correct
52 Correct 5 ms 632 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 400 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 0 ms 376 KB Output is correct
7 Correct 1 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 2 ms 308 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 1 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 236 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 0 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 376 KB Output is correct
44 Correct 0 ms 376 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 2 ms 376 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 376 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 3 ms 504 KB Output is correct
53 Correct 1 ms 532 KB Output is correct
54 Correct 17 ms 2168 KB Output is correct
55 Correct 18 ms 2168 KB Output is correct
56 Correct 213 ms 15836 KB Output is correct
57 Correct 192 ms 15844 KB Output is correct
58 Correct 201 ms 15832 KB Output is correct
59 Correct 198 ms 15600 KB Output is correct
60 Correct 205 ms 15844 KB Output is correct
61 Correct 191 ms 15740 KB Output is correct
62 Correct 198 ms 15828 KB Output is correct
63 Correct 198 ms 15840 KB Output is correct
64 Correct 199 ms 15844 KB Output is correct
65 Correct 216 ms 15976 KB Output is correct
66 Correct 224 ms 15856 KB Output is correct
67 Correct 216 ms 15712 KB Output is correct
68 Correct 198 ms 15828 KB Output is correct
69 Correct 2 ms 404 KB Output is correct
70 Correct 2 ms 376 KB Output is correct
71 Correct 198 ms 15792 KB Output is correct
72 Correct 198 ms 15852 KB Output is correct
73 Correct 202 ms 15948 KB Output is correct
74 Correct 2 ms 376 KB Output is correct
75 Correct 2 ms 376 KB Output is correct
76 Correct 2 ms 376 KB Output is correct
77 Correct 2 ms 376 KB Output is correct
78 Correct 671 ms 36232 KB Output is correct
79 Correct 393 ms 18352 KB Output is correct
80 Correct 659 ms 36332 KB Output is correct
81 Correct 160 ms 15904 KB Output is correct
82 Correct 947 ms 36224 KB Output is correct
83 Correct 608 ms 25836 KB Output is correct
84 Correct 2 ms 376 KB Output is correct
85 Correct 8 ms 376 KB Output is correct
86 Correct 3 ms 376 KB Output is correct
87 Correct 3 ms 504 KB Output is correct
88 Correct 5 ms 760 KB Output is correct
89 Correct 5 ms 632 KB Output is correct
90 Correct 5 ms 760 KB Output is correct
91 Correct 5 ms 632 KB Output is correct
92 Correct 5 ms 632 KB Output is correct
93 Correct 8 ms 632 KB Output is correct
94 Correct 4 ms 508 KB Output is correct
95 Correct 4 ms 504 KB Output is correct
96 Correct 4 ms 504 KB Output is correct
97 Correct 3 ms 504 KB Output is correct
98 Correct 3 ms 504 KB Output is correct
99 Correct 5 ms 632 KB Output is correct
100 Correct 5 ms 632 KB Output is correct
101 Correct 43 ms 3832 KB Output is correct
102 Correct 32 ms 2476 KB Output is correct
103 Correct 759 ms 36216 KB Output is correct
104 Correct 657 ms 36200 KB Output is correct
105 Correct 594 ms 27044 KB Output is correct
106 Correct 741 ms 36256 KB Output is correct
107 Correct 367 ms 18676 KB Output is correct
108 Correct 413 ms 20660 KB Output is correct
109 Correct 148 ms 16048 KB Output is correct
110 Correct 198 ms 15840 KB Output is correct
111 Correct 629 ms 33700 KB Output is correct
112 Correct 695 ms 31248 KB Output is correct
113 Correct 433 ms 18792 KB Output is correct
114 Correct 653 ms 36176 KB Output is correct
115 Correct 664 ms 36200 KB Output is correct