oj.uz

Submission #144549

# Submission time Handle Problem Language Result Execution time Memory
144549 2019-08-17T06:37:22 Z daniel920712 Arranging Shoes (IOI19_shoes) C++14
100 / 100
 440 ms 32572 KB 
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <assert.h>
#include <map>
#include <deque>

using namespace std;

struct A
{
    int l,r;
    int nxl,nxr;
    int how;
}Node[1000005];
struct B
{
    int x,y;
}all[1000005];
int a[200005];
int b[200005];
int now=1;
map < int , vector < int > > all3;
void build(int l,int r,int here)
{
    Node[here].l=l;
    Node[here].r=r;
    Node[here].how=0;
    if(l==r) return;

    Node[here].nxl=now++;
    Node[here].nxr=now++;
    build(l,(l+r)/2,Node[here].nxl);
    build((l+r)/2+1,r,Node[here].nxr);
}
void change(int l,int r,int here)
{
    if(l==Node[here].l&&r==Node[here].r)
    {
        Node[here].how++;
        return;
    }
    if(r<=(Node[here].l+Node[here].r)/2) change(l,r,Node[here].nxl);
    else if(l>(Node[here].l+Node[here].r)/2) change(l,r,Node[here].nxr);
    else
    {
        change(l,(Node[here].l+Node[here].r)/2,Node[here].nxl);
        change((Node[here].l+Node[here].r)/2+1,r,Node[here].nxr);
    }
}
int Find(int where,int here)
{
    if(where==Node[here].l&&where==Node[here].r) return Node[here].how;
    if(where<=(Node[here].l+Node[here].r)/2) return Find(where,Node[here].nxl)+Node[here].how;
    else if(where>(Node[here].l+Node[here].r)/2) return Find(where,Node[here].nxr)+Node[here].how;
}
bool F(B a,B b)
{
    int x=0,y=0;
    x=a.x+a.y;
    y=b.x+b.y;
    if(a.x>a.y) x++;
    if(b.x>b.y) y++;
    return x<y||x==y&&min(a.x,a.y)<min(b.x,b.y);
}
long long count_swaps(std::vector<int> S)
{
    long long ans1=0,small,what,t,a,b;
    int i,j,k,N=S.size(),x=0,M;
    build(0,N-1,0);
    for(i=0;i<N;i++)
    {
        all3[S[i]].push_back(i);
        //printf("%d %d %d\n",i,S[i],all3[S[i]].back());
    }
    for(i=1;i<=N/2;i++)
    {
        M=all3[i].size();
        for(j=0;j<M;j++)
        {
            all[x].x=all3[0-i][j];
            all[x].y=all3[i][j];
            //printf("%d %d %d %d\n",i,j,all3[i][j],all3[0-i][j]);
            x++;
        }
    }
    sort(all,all+N/2,F);
    for(i=0;i<N/2;i++)
    {
        //printf("%d %d\n",all[i].x,all[i].y);
        ans1+=Find(all[i].x,0)+Find(all[i].y,0)+all[i].x+all[i].y-i*2-i*2-1;
        if(all[i].x>all[i].y) ans1++;
        change(0,all[i].x,0);
        change(0,all[i].y,0);
    }
    return ans1;
}

Compilation message

shoes.cpp: In function 'bool F(B, B)':
shoes.cpp:65:21: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     return x<y||x==y&&min(a.x,a.y)<min(b.x,b.y);
                 ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:69:22: warning: unused variable 'small' [-Wunused-variable]
     long long ans1=0,small,what,t,a,b;
                      ^~~~~
shoes.cpp:69:28: warning: unused variable 'what' [-Wunused-variable]
     long long ans1=0,small,what,t,a,b;
                            ^~~~
shoes.cpp:69:33: warning: unused variable 't' [-Wunused-variable]
     long long ans1=0,small,what,t,a,b;
                                 ^
shoes.cpp:69:35: warning: unused variable 'a' [-Wunused-variable]
     long long ans1=0,small,what,t,a,b;
                                   ^
shoes.cpp:69:37: warning: unused variable 'b' [-Wunused-variable]
     long long ans1=0,small,what,t,a,b;
                                     ^
shoes.cpp:70:13: warning: unused variable 'k' [-Wunused-variable]
     int i,j,k,N=S.size(),x=0,M;
             ^
shoes.cpp: In function 'int Find(int, int)':
shoes.cpp:57:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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 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 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 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 252 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 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 376 KB Output is correct
32 Correct 2 ms 276 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 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 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 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 14 ms 2296 KB Output is correct
21 Correct 15 ms 2296 KB Output is correct
22 Correct 153 ms 19092 KB Output is correct
23 Correct 143 ms 19152 KB Output is correct
24 Correct 155 ms 19108 KB Output is correct
25 Correct 134 ms 19184 KB Output is correct
26 Correct 157 ms 19132 KB Output is correct
27 Correct 137 ms 19180 KB Output is correct
28 Correct 147 ms 19180 KB Output is correct
29 Correct 148 ms 19104 KB Output is correct
30 Correct 153 ms 19184 KB Output is correct
31 Correct 158 ms 19176 KB Output is correct
32 Correct 149 ms 19184 KB Output is correct
33 Correct 140 ms 19184 KB Output is correct
34 Correct 144 ms 19156 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 151 ms 19216 KB Output is correct
38 Correct 146 ms 19176 KB Output is correct
39 Correct 147 ms 19184 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 328 ms 32528 KB Output is correct
6 Correct 196 ms 20664 KB Output is correct
7 Correct 326 ms 32504 KB Output is correct
8 Correct 161 ms 19220 KB Output is correct
9 Correct 355 ms 32504 KB Output is correct
10 Correct 292 ms 25476 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 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 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 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 252 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 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 376 KB Output is correct
32 Correct 2 ms 276 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 380 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 4 ms 632 KB Output is correct
42 Correct 4 ms 632 KB Output is correct
43 Correct 4 ms 632 KB Output is correct
44 Correct 4 ms 632 KB Output is correct
45 Correct 4 ms 632 KB Output is correct
46 Correct 4 ms 504 KB Output is correct
47 Correct 4 ms 632 KB Output is correct
48 Correct 3 ms 632 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 4 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 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 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 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 252 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 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 376 KB Output is correct
32 Correct 2 ms 276 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 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 376 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 504 KB Output is correct
52 Correct 3 ms 504 KB Output is correct
53 Correct 3 ms 504 KB Output is correct
54 Correct 14 ms 2296 KB Output is correct
55 Correct 15 ms 2296 KB Output is correct
56 Correct 153 ms 19092 KB Output is correct
57 Correct 143 ms 19152 KB Output is correct
58 Correct 155 ms 19108 KB Output is correct
59 Correct 134 ms 19184 KB Output is correct
60 Correct 157 ms 19132 KB Output is correct
61 Correct 137 ms 19180 KB Output is correct
62 Correct 147 ms 19180 KB Output is correct
63 Correct 148 ms 19104 KB Output is correct
64 Correct 153 ms 19184 KB Output is correct
65 Correct 158 ms 19176 KB Output is correct
66 Correct 149 ms 19184 KB Output is correct
67 Correct 140 ms 19184 KB Output is correct
68 Correct 144 ms 19156 KB Output is correct
69 Correct 2 ms 376 KB Output is correct
70 Correct 2 ms 376 KB Output is correct
71 Correct 151 ms 19216 KB Output is correct
72 Correct 146 ms 19176 KB Output is correct
73 Correct 147 ms 19184 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 328 ms 32528 KB Output is correct
79 Correct 196 ms 20664 KB Output is correct
80 Correct 326 ms 32504 KB Output is correct
81 Correct 161 ms 19220 KB Output is correct
82 Correct 355 ms 32504 KB Output is correct
83 Correct 292 ms 25476 KB Output is correct
84 Correct 2 ms 376 KB Output is correct
85 Correct 2 ms 380 KB Output is correct
86 Correct 2 ms 376 KB Output is correct
87 Correct 2 ms 376 KB Output is correct
88 Correct 4 ms 632 KB Output is correct
89 Correct 4 ms 632 KB Output is correct
90 Correct 4 ms 632 KB Output is correct
91 Correct 4 ms 632 KB Output is correct
92 Correct 4 ms 632 KB Output is correct
93 Correct 4 ms 504 KB Output is correct
94 Correct 4 ms 632 KB Output is correct
95 Correct 3 ms 632 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 4 ms 632 KB Output is correct
100 Correct 4 ms 632 KB Output is correct
101 Correct 27 ms 3320 KB Output is correct
102 Correct 22 ms 2516 KB Output is correct
103 Correct 440 ms 32572 KB Output is correct
104 Correct 353 ms 32504 KB Output is correct
105 Correct 335 ms 26504 KB Output is correct
106 Correct 333 ms 32376 KB Output is correct
107 Correct 228 ms 20984 KB Output is correct
108 Correct 259 ms 22236 KB Output is correct
109 Correct 170 ms 19248 KB Output is correct
110 Correct 151 ms 19100 KB Output is correct
111 Correct 331 ms 30968 KB Output is correct
112 Correct 382 ms 29304 KB Output is correct
113 Correct 252 ms 20860 KB Output is correct
114 Correct 379 ms 32484 KB Output is correct
115 Correct 350 ms 32528 KB Output is correct