Submission #161831

# Submission time Handle Problem Language Result Execution time Memory
161831 2019-11-04T14:55:17 Z mhy908 Arranging Shoes (IOI19_shoes) C++14
100 / 100
198 ms 23788 KB
#include "shoes.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
vector<int> pl[100010], mi[100010];
vector<pair<pii, int> >arr;
struct SEGMENT_TREE {
    struct NODE {
        int st, fin;
        LL q;
    } tree[1000000];
    int x;
    const LL inf=987654321987654321;
    LL f(LL a, LL b){return a+b;}
    void maketree(int point, int num) {
        if(num==1)tree[point].st=tree[point].fin=++x;
        if(num<=1)return;
        maketree(point*2, num-num/2);
        maketree(point*2+1, num/2);
        tree[point].st=tree[point*2].st;
        tree[point].fin=tree[point*2+1].fin;
    }
    LL query(int a, int b, int point) {
        if(tree[point].st>=a&&tree[point].fin<=b)
            return tree[point].q;
        if(tree[point].st>b||tree[point].fin<a)
            return 0;
        return f(query(a, b, point*2), query(a, b, point*2+1));
    }
    void updaterange(int point, int num, LL p) {
        if(tree[point].st==tree[point].fin) {
            tree[point].q=p;
            return;
        }
        if(num<=tree[point*2].fin)updaterange(point*2, num, p);
        else updaterange(point*2+1, num, p);
        tree[point].q=f(tree[point*2].q, tree[point*2+1].q);
    }
    void init(int n) {
        maketree(1, n);
    }
    LL get_query(int a, int b) {
        return query(a, b, 1);
    }
    void update(int a, LL num) {
        updaterange(1, a, num);
    }
}seg;
LL count_swaps(std::vector<int> s) {
    LL ans=0;
	for(int i=0; i<s.size(); i++){
        if(s[i]<0)mi[-s[i]].pb(i+1);
        else pl[s[i]].pb(i+1);
	}
	for(int i=1; i<=100000; i++){
        for(int j=0; j<pl[i].size(); j++){
            if(mi[i][j]<pl[i][j])arr.pb(mp(mp(mi[i][j], pl[i][j]), 0));
            else arr.pb(mp(mp(pl[i][j], mi[i][j]), 1));
        }
	}
	sort(all(arr));
	seg.init(s.size());
	for(int i=1; i<=s.size(); i++)seg.update(i, 1);
	for(int i=0; i<arr.size(); i++){
        //printf("%d %d\n", arr[i].F.F, arr[i].F.S);
        ans+=seg.get_query(arr[i].F.F+1, arr[i].F.S-1)+(LL)arr[i].S;
        seg.update(arr[i].F.F, 0);
        seg.update(arr[i].F.S, 0);
	}
	return ans;
}

Compilation message

shoes.cpp: In function 'LL count_swaps(std::vector<int>)':
shoes.cpp:58:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<s.size(); i++){
               ~^~~~~~~~~
shoes.cpp:63:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<pl[i].size(); j++){
                      ~^~~~~~~~~~~~~
shoes.cpp:70:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1; i<=s.size(); i++)seg.update(i, 1);
               ~^~~~~~~~~~
shoes.cpp:71:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<arr.size(); i++){
               ~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 10 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 5112 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 12 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 7 ms 4984 KB Output is correct
18 Correct 7 ms 4984 KB Output is correct
19 Correct 7 ms 4984 KB Output is correct
20 Correct 6 ms 4988 KB Output is correct
21 Correct 7 ms 4984 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 6 ms 4984 KB Output is correct
26 Correct 6 ms 4984 KB Output is correct
27 Correct 6 ms 4988 KB Output is correct
28 Correct 6 ms 4984 KB Output is correct
29 Correct 6 ms 4984 KB Output is correct
30 Correct 7 ms 4984 KB Output is correct
31 Correct 7 ms 4984 KB Output is correct
32 Correct 6 ms 4984 KB Output is correct
33 Correct 6 ms 4956 KB Output is correct
34 Correct 7 ms 4984 KB Output is correct
35 Correct 7 ms 4984 KB Output is correct
36 Correct 7 ms 4984 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 7 ms 5112 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 7 ms 5060 KB Output is correct
13 Correct 7 ms 4984 KB Output is correct
14 Correct 10 ms 4984 KB Output is correct
15 Correct 7 ms 4984 KB Output is correct
16 Correct 8 ms 5112 KB Output is correct
17 Correct 7 ms 4988 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 8 ms 5112 KB Output is correct
20 Correct 17 ms 6736 KB Output is correct
21 Correct 17 ms 6760 KB Output is correct
22 Correct 108 ms 18452 KB Output is correct
23 Correct 95 ms 18404 KB Output is correct
24 Correct 105 ms 18536 KB Output is correct
25 Correct 105 ms 18280 KB Output is correct
26 Correct 110 ms 18404 KB Output is correct
27 Correct 93 ms 18288 KB Output is correct
28 Correct 107 ms 18412 KB Output is correct
29 Correct 105 ms 18532 KB Output is correct
30 Correct 105 ms 18408 KB Output is correct
31 Correct 109 ms 18428 KB Output is correct
32 Correct 106 ms 18408 KB Output is correct
33 Correct 108 ms 18408 KB Output is correct
34 Correct 106 ms 18408 KB Output is correct
35 Correct 7 ms 4984 KB Output is correct
36 Correct 6 ms 4984 KB Output is correct
37 Correct 110 ms 18408 KB Output is correct
38 Correct 106 ms 18536 KB Output is correct
39 Correct 107 ms 18408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 7 ms 4984 KB Output is correct
4 Correct 7 ms 4988 KB Output is correct
5 Correct 154 ms 23672 KB Output is correct
6 Correct 132 ms 18916 KB Output is correct
7 Correct 153 ms 23564 KB Output is correct
8 Correct 113 ms 18340 KB Output is correct
9 Correct 165 ms 23660 KB Output is correct
10 Correct 189 ms 20588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 5112 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 12 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 7 ms 4984 KB Output is correct
18 Correct 7 ms 4984 KB Output is correct
19 Correct 7 ms 4984 KB Output is correct
20 Correct 6 ms 4988 KB Output is correct
21 Correct 7 ms 4984 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 6 ms 4984 KB Output is correct
26 Correct 6 ms 4984 KB Output is correct
27 Correct 6 ms 4988 KB Output is correct
28 Correct 6 ms 4984 KB Output is correct
29 Correct 6 ms 4984 KB Output is correct
30 Correct 7 ms 4984 KB Output is correct
31 Correct 7 ms 4984 KB Output is correct
32 Correct 6 ms 4984 KB Output is correct
33 Correct 6 ms 4956 KB Output is correct
34 Correct 7 ms 4984 KB Output is correct
35 Correct 7 ms 4984 KB Output is correct
36 Correct 7 ms 4984 KB Output is correct
37 Correct 7 ms 4984 KB Output is correct
38 Correct 7 ms 4988 KB Output is correct
39 Correct 7 ms 5112 KB Output is correct
40 Correct 7 ms 5112 KB Output is correct
41 Correct 6 ms 5116 KB Output is correct
42 Correct 8 ms 5240 KB Output is correct
43 Correct 8 ms 5112 KB Output is correct
44 Correct 7 ms 5112 KB Output is correct
45 Correct 7 ms 5240 KB Output is correct
46 Correct 8 ms 5112 KB Output is correct
47 Correct 8 ms 5112 KB Output is correct
48 Correct 7 ms 5112 KB Output is correct
49 Correct 8 ms 5116 KB Output is correct
50 Correct 8 ms 5112 KB Output is correct
51 Correct 7 ms 5112 KB Output is correct
52 Correct 8 ms 5156 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 5112 KB Output is correct
2 Correct 6 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 7 ms 5112 KB Output is correct
5 Correct 7 ms 4984 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 7 ms 4984 KB Output is correct
8 Correct 7 ms 4984 KB Output is correct
9 Correct 7 ms 4984 KB Output is correct
10 Correct 7 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 4984 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 12 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 7 ms 4984 KB Output is correct
18 Correct 7 ms 4984 KB Output is correct
19 Correct 7 ms 4984 KB Output is correct
20 Correct 6 ms 4988 KB Output is correct
21 Correct 7 ms 4984 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 4984 KB Output is correct
24 Correct 7 ms 4984 KB Output is correct
25 Correct 6 ms 4984 KB Output is correct
26 Correct 6 ms 4984 KB Output is correct
27 Correct 6 ms 4988 KB Output is correct
28 Correct 6 ms 4984 KB Output is correct
29 Correct 6 ms 4984 KB Output is correct
30 Correct 7 ms 4984 KB Output is correct
31 Correct 7 ms 4984 KB Output is correct
32 Correct 6 ms 4984 KB Output is correct
33 Correct 6 ms 4956 KB Output is correct
34 Correct 7 ms 4984 KB Output is correct
35 Correct 7 ms 4984 KB Output is correct
36 Correct 7 ms 4984 KB Output is correct
37 Correct 6 ms 4984 KB Output is correct
38 Correct 6 ms 4984 KB Output is correct
39 Correct 7 ms 5112 KB Output is correct
40 Correct 6 ms 4984 KB Output is correct
41 Correct 7 ms 4984 KB Output is correct
42 Correct 7 ms 4984 KB Output is correct
43 Correct 6 ms 4984 KB Output is correct
44 Correct 6 ms 4984 KB Output is correct
45 Correct 6 ms 4984 KB Output is correct
46 Correct 7 ms 5060 KB Output is correct
47 Correct 7 ms 4984 KB Output is correct
48 Correct 10 ms 4984 KB Output is correct
49 Correct 7 ms 4984 KB Output is correct
50 Correct 8 ms 5112 KB Output is correct
51 Correct 7 ms 4988 KB Output is correct
52 Correct 8 ms 5112 KB Output is correct
53 Correct 8 ms 5112 KB Output is correct
54 Correct 17 ms 6736 KB Output is correct
55 Correct 17 ms 6760 KB Output is correct
56 Correct 108 ms 18452 KB Output is correct
57 Correct 95 ms 18404 KB Output is correct
58 Correct 105 ms 18536 KB Output is correct
59 Correct 105 ms 18280 KB Output is correct
60 Correct 110 ms 18404 KB Output is correct
61 Correct 93 ms 18288 KB Output is correct
62 Correct 107 ms 18412 KB Output is correct
63 Correct 105 ms 18532 KB Output is correct
64 Correct 105 ms 18408 KB Output is correct
65 Correct 109 ms 18428 KB Output is correct
66 Correct 106 ms 18408 KB Output is correct
67 Correct 108 ms 18408 KB Output is correct
68 Correct 106 ms 18408 KB Output is correct
69 Correct 7 ms 4984 KB Output is correct
70 Correct 6 ms 4984 KB Output is correct
71 Correct 110 ms 18408 KB Output is correct
72 Correct 106 ms 18536 KB Output is correct
73 Correct 107 ms 18408 KB Output is correct
74 Correct 6 ms 4984 KB Output is correct
75 Correct 6 ms 4984 KB Output is correct
76 Correct 7 ms 4984 KB Output is correct
77 Correct 7 ms 4988 KB Output is correct
78 Correct 154 ms 23672 KB Output is correct
79 Correct 132 ms 18916 KB Output is correct
80 Correct 153 ms 23564 KB Output is correct
81 Correct 113 ms 18340 KB Output is correct
82 Correct 165 ms 23660 KB Output is correct
83 Correct 189 ms 20588 KB Output is correct
84 Correct 7 ms 4984 KB Output is correct
85 Correct 7 ms 4988 KB Output is correct
86 Correct 7 ms 5112 KB Output is correct
87 Correct 7 ms 5112 KB Output is correct
88 Correct 6 ms 5116 KB Output is correct
89 Correct 8 ms 5240 KB Output is correct
90 Correct 8 ms 5112 KB Output is correct
91 Correct 7 ms 5112 KB Output is correct
92 Correct 7 ms 5240 KB Output is correct
93 Correct 8 ms 5112 KB Output is correct
94 Correct 8 ms 5112 KB Output is correct
95 Correct 7 ms 5112 KB Output is correct
96 Correct 8 ms 5116 KB Output is correct
97 Correct 8 ms 5112 KB Output is correct
98 Correct 7 ms 5112 KB Output is correct
99 Correct 8 ms 5156 KB Output is correct
100 Correct 8 ms 5240 KB Output is correct
101 Correct 21 ms 7100 KB Output is correct
102 Correct 20 ms 6716 KB Output is correct
103 Correct 198 ms 23788 KB Output is correct
104 Correct 159 ms 23632 KB Output is correct
105 Correct 166 ms 20976 KB Output is correct
106 Correct 159 ms 23700 KB Output is correct
107 Correct 138 ms 18972 KB Output is correct
108 Correct 130 ms 19408 KB Output is correct
109 Correct 116 ms 18536 KB Output is correct
110 Correct 108 ms 18508 KB Output is correct
111 Correct 153 ms 23004 KB Output is correct
112 Correct 180 ms 22372 KB Output is correct
113 Correct 170 ms 18920 KB Output is correct
114 Correct 159 ms 23620 KB Output is correct
115 Correct 155 ms 23644 KB Output is correct