oj.uz

Submission #143274

# Submission time Handle Problem Language Result Execution time Memory
143274 2019-08-13T13:48:37 Z Bench0310 Arranging Shoes (IOI19_shoes) C++14
100 / 100
 405 ms 142444 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++)
    {
        //cout << "in " << o << endl;
        if(vis[o]) continue;
        //cout << "shoe: " << s[o] << endl;
        if(s[o]<0)
        {
            q[-2*s[o]].pop();
            //cout << "left shoe" << endl;
            int pos=q[-2*s[o]+1].front();
            //cout << "position of closest pair: " << pos << endl;
            q[-2*s[o]+1].pop();
            int one=query(1,1,2*n,o);
            int two=query(1,1,2*n,pos);
            //cout << "actual position of first: " << one << endl;
            //cout << "actual position of second: " << two << endl;
            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,o+1);
        }
        else
        {
            q[2*s[o]+1].pop();
            //cout << "right shoe" << endl;
            int pos=q[2*s[o]].front();
            //cout << "position of closest pair: " << pos << endl;
            q[2*s[o]].pop();
            int one=query(1,1,2*n,o);
            int two=query(1,1,2*n,pos);
            //cout << "actual position of first: " << one << endl;
            //cout << "actual position of second: " << two << endl;
            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,o);
        }
        //cout << "res is now " << res << endl;
    }
    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 256 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 256 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 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 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 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 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 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 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 256 KB Output is correct
32 Correct 2 ms 256 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 348 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 256 KB Output is correct
3 Correct 2 ms 256 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 2 ms 376 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 256 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 760 KB Output is correct
18 Correct 4 ms 1656 KB Output is correct
19 Correct 4 ms 1656 KB Output is correct
20 Correct 29 ms 14584 KB Output is correct
21 Correct 30 ms 14640 KB Output is correct
22 Correct 300 ms 142352 KB Output is correct
23 Correct 259 ms 142324 KB Output is correct
24 Correct 298 ms 142316 KB Output is correct
25 Correct 303 ms 142444 KB Output is correct
26 Correct 299 ms 142308 KB Output is correct
27 Correct 262 ms 142444 KB Output is correct
28 Correct 305 ms 142444 KB Output is correct
29 Correct 302 ms 142316 KB Output is correct
30 Correct 303 ms 142444 KB Output is correct
31 Correct 299 ms 142316 KB Output is correct
32 Correct 302 ms 142316 KB Output is correct
33 Correct 326 ms 142316 KB Output is correct
34 Correct 303 ms 142356 KB Output is correct
35 Correct 2 ms 380 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 314 ms 142316 KB Output is correct
38 Correct 309 ms 142316 KB Output is correct
39 Correct 305 ms 142288 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 376 KB Output is correct
5 Correct 368 ms 141420 KB Output is correct
6 Correct 334 ms 141476 KB Output is correct
7 Correct 368 ms 141548 KB Output is correct
8 Correct 308 ms 142444 KB Output is correct
9 Correct 370 ms 141604 KB Output is correct
10 Correct 356 ms 141392 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 256 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 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 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 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 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 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 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 256 KB Output is correct
32 Correct 2 ms 256 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 348 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 504 KB Output is correct
40 Correct 0 ms 760 KB Output is correct
41 Correct 5 ms 1784 KB Output is correct
42 Correct 5 ms 1784 KB Output is correct
43 Correct 4 ms 1656 KB Output is correct
44 Correct 5 ms 1784 KB Output is correct
45 Correct 4 ms 1784 KB Output is correct
46 Correct 4 ms 1656 KB Output is correct
47 Correct 5 ms 1656 KB Output is correct
48 Correct 5 ms 1784 KB Output is correct
49 Correct 5 ms 1656 KB Output is correct
50 Correct 4 ms 1784 KB Output is correct
51 Correct 4 ms 1660 KB Output is correct
52 Correct 5 ms 1656 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 256 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 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 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 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 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 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 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 256 KB Output is correct
32 Correct 2 ms 256 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 348 KB Output is correct
37 Correct 2 ms 256 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 2 ms 376 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 256 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 760 KB Output is correct
52 Correct 4 ms 1656 KB Output is correct
53 Correct 4 ms 1656 KB Output is correct
54 Correct 29 ms 14584 KB Output is correct
55 Correct 30 ms 14640 KB Output is correct
56 Correct 300 ms 142352 KB Output is correct
57 Correct 259 ms 142324 KB Output is correct
58 Correct 298 ms 142316 KB Output is correct
59 Correct 303 ms 142444 KB Output is correct
60 Correct 299 ms 142308 KB Output is correct
61 Correct 262 ms 142444 KB Output is correct
62 Correct 305 ms 142444 KB Output is correct
63 Correct 302 ms 142316 KB Output is correct
64 Correct 303 ms 142444 KB Output is correct
65 Correct 299 ms 142316 KB Output is correct
66 Correct 302 ms 142316 KB Output is correct
67 Correct 326 ms 142316 KB Output is correct
68 Correct 303 ms 142356 KB Output is correct
69 Correct 2 ms 380 KB Output is correct
70 Correct 2 ms 376 KB Output is correct
71 Correct 314 ms 142316 KB Output is correct
72 Correct 309 ms 142316 KB Output is correct
73 Correct 305 ms 142288 KB Output is correct
74 Correct 2 ms 380 KB Output is correct
75 Correct 2 ms 376 KB Output is correct
76 Correct 2 ms 256 KB Output is correct
77 Correct 2 ms 376 KB Output is correct
78 Correct 368 ms 141420 KB Output is correct
79 Correct 334 ms 141476 KB Output is correct
80 Correct 368 ms 141548 KB Output is correct
81 Correct 308 ms 142444 KB Output is correct
82 Correct 370 ms 141604 KB Output is correct
83 Correct 356 ms 141392 KB Output is correct
84 Correct 2 ms 376 KB Output is correct
85 Correct 2 ms 376 KB Output is correct
86 Correct 2 ms 504 KB Output is correct
87 Correct 0 ms 760 KB Output is correct
88 Correct 5 ms 1784 KB Output is correct
89 Correct 5 ms 1784 KB Output is correct
90 Correct 4 ms 1656 KB Output is correct
91 Correct 5 ms 1784 KB Output is correct
92 Correct 4 ms 1784 KB Output is correct
93 Correct 4 ms 1656 KB Output is correct
94 Correct 5 ms 1656 KB Output is correct
95 Correct 5 ms 1784 KB Output is correct
96 Correct 5 ms 1656 KB Output is correct
97 Correct 4 ms 1784 KB Output is correct
98 Correct 4 ms 1660 KB Output is correct
99 Correct 5 ms 1656 KB Output is correct
100 Correct 5 ms 1656 KB Output is correct
101 Correct 31 ms 14548 KB Output is correct
102 Correct 32 ms 14584 KB Output is correct
103 Correct 391 ms 141600 KB Output is correct
104 Correct 318 ms 141572 KB Output is correct
105 Correct 405 ms 141436 KB Output is correct
106 Correct 379 ms 141468 KB Output is correct
107 Correct 314 ms 141420 KB Output is correct
108 Correct 296 ms 141420 KB Output is correct
109 Correct 305 ms 142404 KB Output is correct
110 Correct 313 ms 142268 KB Output is correct
111 Correct 364 ms 141420 KB Output is correct
112 Correct 378 ms 141420 KB Output is correct
113 Correct 367 ms 141548 KB Output is correct
114 Correct 367 ms 141548 KB Output is correct
115 Correct 368 ms 141676 KB Output is correct