oj.uz

Submission #143278

# Submission time Handle Problem Language Result Execution time Memory
143278 2019-08-13T13:51:32 Z Bench0310 Arranging Shoes (IOI19_shoes) C++14
100 / 100
 452 ms 142456 KB 
#include <bits/stdc++.h>

using namespace std;

const int N=200005;
int tree[4*N];
int lazy[4*N];

void push(int idx)
{
    tree[2*idx]+=lazy[idx];
    lazy[2*idx]+=lazy[idx];
    tree[2*idx+1]+=lazy[idx];
    lazy[2*idx+1]+=lazy[idx];
    lazy[idx]=0;
}

void update(int idx,int l,int r,int ql,int qr,int val)
{
    if(ql>qr) return;
    if(l==ql&&r==qr)
    {
        tree[idx]+=val;
        lazy[idx]+=val;
    }
    else
    {
        push(idx);
        int m=(l+r)/2;
        update(2*idx,l,m,ql,min(qr,m),val);
        update(2*idx+1,m+1,r,max(ql,m+1),qr,val);
        tree[idx]=min(tree[2*idx],tree[2*idx+1]);
    }
}

int query(int idx,int l,int r,int pos)
{
    if(l==r) return tree[idx];
    push(idx);
    int m=(l+r)/2;
    if(pos<=m) return query(2*idx,l,m,pos);
    else return query(2*idx+1,m+1,r,pos);
}

long long count_swaps(vector<int> temp)
{
    int n=temp.size()/2;
    vector<int> s={0};
    for(int i=0;i<2*n;i++) s.push_back(temp[i]);
    for(int i=1;i<=2*n;i++) update(1,1,2*n,i,i,i);
    vector<bool> vis(2*n+1,0);
    queue<int> q[2*n+2]; //left: 2*i, right: 2*i+1
    for(int i=1;i<=2*n;i++)
    {
        if(s[i]<0) q[-2*s[i]].push(i);
        else q[2*s[i]+1].push(i);
    }
    long long res=0;
    for(int o=1;o<=2*n;o++)
    {
        if(vis[o]) continue;
        vis[o]=1;
        if(s[o]<0)
        {
            q[-2*s[o]].pop();
            int pos=q[-2*s[o]+1].front();
            q[-2*s[o]+1].pop();
            int one=query(1,1,2*n,o);
            int two=query(1,1,2*n,pos);
            vis[pos]=1;
            res+=((long long)(two-(one+1)));
            update(1,1,2*n,o+1,pos-1,1);
            update(1,1,2*n,pos,pos,two-(one+1));
        }
        else
        {
            q[2*s[o]+1].pop();
            int pos=q[2*s[o]].front();
            q[2*s[o]].pop();
            int one=query(1,1,2*n,o);
            int two=query(1,1,2*n,pos);
            vis[pos]=1;
            res+=((long long)two-one);
            update(1,1,2*n,o+1,pos-1,1);
            update(1,1,2*n,pos,pos,two-one);
        }
    }
    return res;
}

/*int main()
{
    cout << count_swaps({2, 1, -1, -2});
    return 0;
}*/

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 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 276 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 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 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 252 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 252 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 0 ms 376 KB Output is correct
29 Correct 2 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 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 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 252 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 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 504 KB Output is correct
17 Correct 3 ms 764 KB Output is correct
18 Correct 5 ms 1784 KB Output is correct
19 Correct 5 ms 1784 KB Output is correct
20 Correct 32 ms 14584 KB Output is correct
21 Correct 34 ms 14712 KB Output is correct
22 Correct 330 ms 142416 KB Output is correct
23 Correct 283 ms 142444 KB Output is correct
24 Correct 320 ms 142316 KB Output is correct
25 Correct 337 ms 142444 KB Output is correct
26 Correct 330 ms 142336 KB Output is correct
27 Correct 320 ms 142344 KB Output is correct
28 Correct 342 ms 142288 KB Output is correct
29 Correct 336 ms 142316 KB Output is correct
30 Correct 331 ms 142440 KB Output is correct
31 Correct 365 ms 142316 KB Output is correct
32 Correct 331 ms 142316 KB Output is correct
33 Correct 334 ms 142456 KB Output is correct
34 Correct 331 ms 142252 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 334 ms 142316 KB Output is correct
38 Correct 333 ms 142444 KB Output is correct
39 Correct 331 ms 142444 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 397 ms 141560 KB Output is correct
6 Correct 367 ms 141420 KB Output is correct
7 Correct 418 ms 141524 KB Output is correct
8 Correct 330 ms 142280 KB Output is correct
9 Correct 397 ms 141548 KB Output is correct
10 Correct 388 ms 141488 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 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 276 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 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 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 252 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 252 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 0 ms 376 KB Output is correct
29 Correct 2 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 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 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 6 ms 504 KB Output is correct
40 Correct 3 ms 760 KB Output is correct
41 Correct 5 ms 1656 KB Output is correct
42 Correct 4 ms 1656 KB Output is correct
43 Correct 6 ms 1660 KB Output is correct
44 Correct 5 ms 1784 KB Output is correct
45 Correct 5 ms 1784 KB Output is correct
46 Correct 4 ms 1656 KB Output is correct
47 Correct 5 ms 1784 KB Output is correct
48 Correct 5 ms 1652 KB Output is correct
49 Correct 7 ms 1656 KB Output is correct
50 Correct 5 ms 1784 KB Output is correct
51 Correct 5 ms 1784 KB Output is correct
52 Correct 5 ms 1784 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 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 2 ms 276 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 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 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 252 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 252 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 0 ms 376 KB Output is correct
29 Correct 2 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 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 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 252 KB Output is correct
38 Correct 2 ms 256 KB Output is correct
39 Correct 2 ms 380 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 2 ms 256 KB Output is correct
42 Correct 2 ms 256 KB Output is correct
43 Correct 2 ms 256 KB Output is correct
44 Correct 2 ms 256 KB Output is correct
45 Correct 2 ms 256 KB Output is correct
46 Correct 2 ms 256 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 504 KB Output is correct
51 Correct 3 ms 764 KB Output is correct
52 Correct 5 ms 1784 KB Output is correct
53 Correct 5 ms 1784 KB Output is correct
54 Correct 32 ms 14584 KB Output is correct
55 Correct 34 ms 14712 KB Output is correct
56 Correct 330 ms 142416 KB Output is correct
57 Correct 283 ms 142444 KB Output is correct
58 Correct 320 ms 142316 KB Output is correct
59 Correct 337 ms 142444 KB Output is correct
60 Correct 330 ms 142336 KB Output is correct
61 Correct 320 ms 142344 KB Output is correct
62 Correct 342 ms 142288 KB Output is correct
63 Correct 336 ms 142316 KB Output is correct
64 Correct 331 ms 142440 KB Output is correct
65 Correct 365 ms 142316 KB Output is correct
66 Correct 331 ms 142316 KB Output is correct
67 Correct 334 ms 142456 KB Output is correct
68 Correct 331 ms 142252 KB Output is correct
69 Correct 2 ms 348 KB Output is correct
70 Correct 2 ms 256 KB Output is correct
71 Correct 334 ms 142316 KB Output is correct
72 Correct 333 ms 142444 KB Output is correct
73 Correct 331 ms 142444 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 397 ms 141560 KB Output is correct
79 Correct 367 ms 141420 KB Output is correct
80 Correct 418 ms 141524 KB Output is correct
81 Correct 330 ms 142280 KB Output is correct
82 Correct 397 ms 141548 KB Output is correct
83 Correct 388 ms 141488 KB Output is correct
84 Correct 2 ms 376 KB Output is correct
85 Correct 2 ms 376 KB Output is correct
86 Correct 6 ms 504 KB Output is correct
87 Correct 3 ms 760 KB Output is correct
88 Correct 5 ms 1656 KB Output is correct
89 Correct 4 ms 1656 KB Output is correct
90 Correct 6 ms 1660 KB Output is correct
91 Correct 5 ms 1784 KB Output is correct
92 Correct 5 ms 1784 KB Output is correct
93 Correct 4 ms 1656 KB Output is correct
94 Correct 5 ms 1784 KB Output is correct
95 Correct 5 ms 1652 KB Output is correct
96 Correct 7 ms 1656 KB Output is correct
97 Correct 5 ms 1784 KB Output is correct
98 Correct 5 ms 1784 KB Output is correct
99 Correct 5 ms 1784 KB Output is correct
100 Correct 5 ms 1656 KB Output is correct
101 Correct 38 ms 14520 KB Output is correct
102 Correct 34 ms 14584 KB Output is correct
103 Correct 452 ms 141392 KB Output is correct
104 Correct 369 ms 141548 KB Output is correct
105 Correct 394 ms 141420 KB Output is correct
106 Correct 392 ms 141552 KB Output is correct
107 Correct 345 ms 141420 KB Output is correct
108 Correct 326 ms 141476 KB Output is correct
109 Correct 342 ms 142380 KB Output is correct
110 Correct 352 ms 142316 KB Output is correct
111 Correct 396 ms 141576 KB Output is correct
112 Correct 413 ms 141552 KB Output is correct
113 Correct 398 ms 141548 KB Output is correct
114 Correct 411 ms 141548 KB Output is correct
115 Correct 397 ms 141548 KB Output is correct