oj.uz

Submission #468994

# Submission time Handle Problem Language Result Execution time Memory
468994 2021-08-30T11:02:50 Z Cross_Ratio Arranging Shoes (IOI19_shoes) C++14
85 / 100
 115 ms 73880 KB 
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
 
 
struct SegTree {
    vector<int> seg;
    int MAX;
    SegTree(int N) {
        int i;
        for(i=1;i<2*N;i*=2) {}
        seg.resize(i);
        MAX = i;
    }
    void cons() {
        int i;
        for(i=MAX/2-1;i>=1;i--) {
            seg[i] = seg[2*i] + seg[2*i+1];
        }
    }
    int sum(int s, int e, int n, int ns, int ne) {
        if(e<=ns||ne<=s) return 0;
        if(s<=ns&&ne<=e) return seg[n];
        int mid = ns + ne >> 1;
        return sum(s, e, 2*n, ns, mid) + sum(s, e, 2*n+1, mid, ne);
    }
    int sum(int s, int e) {
        return sum(s, e, 1, 0, MAX/2);
    }
    void update(int n) {
        n += MAX/2;
        n /= 2;
        while(n) {
            seg[n] = seg[2*n] + seg[2*n+1];
            n /= 2;
        }
    }
    void Minus(int n) {
        seg[n+MAX/2]--;
        update(n);
    }
};
typedef pair<int,int> P;
vector<deque<int> > adj;
P pt[200005];
bool vis[200005];
long long count_swaps(vector<int> S) {
    int N = S.size();
    N /= 2;
    adj.resize(N);
    int i, j;
    for(i=0;i< 2*N; i++) {
        if(S[i] > 0) adj[S[i]-1].push_back(i);
    }
    int cnt = 0;
    SegTree tree(2*N + 5);
    for(i=0;i<2*N;i++) {
        if(S[i] < 0) {
            int d = adj[-S[i]-1].front();
            adj[-S[i]-1].pop_front();
            pt[cnt].first = i;
            pt[cnt].second = d;
            cnt++;
        }
    }
    long long int ans = 0;
    for(i=0;i<N;i++) {
        int mi = 1e9;
        int a, b, c;
        j = i;
        //for(j=0;j<N;j++) {
            if(!vis[j]) {
                cnt = pt[j].first + pt[j].second;
                cnt += tree.sum(0, pt[j].first) + tree.sum(0, pt[j].second);
                if(pt[j].first < pt[j].second) cnt--;
                if(cnt < mi) {
                    mi = cnt;
                    a = pt[j].first;
                    b = pt[j].second;
                    c = j;
                }
            }
        //}
        //cout << mi << ' ';
        if(N <= 1000) {
          for(j=0;j<N;j++) {
            if(!vis[j]) {
                cnt = pt[j].first + pt[j].second;
                cnt += tree.sum(0, pt[j].first) + tree.sum(0, pt[j].second);
                if(pt[j].first < pt[j].second) cnt--;
                if(cnt < mi) {
                    mi = cnt;
                    a = pt[j].first;
                    b = pt[j].second;
                    c = j;
                }
            }
        }
        }
        //cout << mi << ' ';
        vis[c] = true;
        tree.Minus(a);
        tree.Minus(b);
        ans += mi;
    }
    return ans;
}

Compilation message

shoes.cpp: In member function 'int SegTree::sum(int, int, int, int, int)':
shoes.cpp:24:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   24 |         int mid = ns + ne >> 1;
      |                   ~~~^~~~
shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:101:16: warning: 'c' may be used uninitialized in this function [-Wmaybe-uninitialized]
  101 |         vis[c] = true;
      |         ~~~~~~~^~~~~~
shoes.cpp:31:11: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |         n += MAX/2;
      |         ~~^~~~~~~~
shoes.cpp:69:16: note: 'b' was declared here
   69 |         int a, b, c;
      |                ^
shoes.cpp:39:14: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]
   39 |         seg[n+MAX/2]--;
      |             ~^~~~~~
shoes.cpp:69:13: note: 'a' was declared here
   69 |         int a, b, c;
      |             ^

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 6 ms 524 KB Output is correct
18 Correct 80 ms 972 KB Output is correct
19 Correct 1 ms 972 KB Output is correct
20 Correct 11 ms 7688 KB Output is correct
21 Correct 10 ms 7696 KB Output is correct
22 Correct 103 ms 73796 KB Output is correct
23 Correct 101 ms 73780 KB Output is correct
24 Correct 101 ms 73772 KB Output is correct
25 Correct 98 ms 73524 KB Output is correct
26 Correct 102 ms 73748 KB Output is correct
27 Correct 97 ms 73540 KB Output is correct
28 Correct 96 ms 73800 KB Output is correct
29 Correct 98 ms 73780 KB Output is correct
30 Correct 102 ms 73700 KB Output is correct
31 Correct 102 ms 73764 KB Output is correct
32 Correct 100 ms 73776 KB Output is correct
33 Correct 99 ms 73544 KB Output is correct
34 Correct 97 ms 73784 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 97 ms 73724 KB Output is correct
38 Correct 96 ms 73796 KB Output is correct
39 Correct 100 ms 73880 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 115 ms 73248 KB Output is correct
6 Correct 107 ms 73240 KB Output is correct
7 Correct 110 ms 73268 KB Output is correct
8 Correct 102 ms 73776 KB Output is correct
9 Correct 113 ms 73336 KB Output is correct
10 Correct 111 ms 73260 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 6 ms 460 KB Output is correct
41 Correct 85 ms 1008 KB Output is correct
42 Correct 78 ms 972 KB Output is correct
43 Correct 84 ms 972 KB Output is correct
44 Correct 79 ms 956 KB Output is correct
45 Correct 79 ms 1004 KB Output is correct
46 Correct 79 ms 972 KB Output is correct
47 Correct 82 ms 972 KB Output is correct
48 Correct 77 ms 952 KB Output is correct
49 Correct 85 ms 972 KB Output is correct
50 Correct 82 ms 1016 KB Output is correct
51 Correct 79 ms 972 KB Output is correct
52 Correct 77 ms 972 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 0 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 304 KB Output is correct
51 Correct 6 ms 524 KB Output is correct
52 Correct 80 ms 972 KB Output is correct
53 Correct 1 ms 972 KB Output is correct
54 Correct 11 ms 7688 KB Output is correct
55 Correct 10 ms 7696 KB Output is correct
56 Correct 103 ms 73796 KB Output is correct
57 Correct 101 ms 73780 KB Output is correct
58 Correct 101 ms 73772 KB Output is correct
59 Correct 98 ms 73524 KB Output is correct
60 Correct 102 ms 73748 KB Output is correct
61 Correct 97 ms 73540 KB Output is correct
62 Correct 96 ms 73800 KB Output is correct
63 Correct 98 ms 73780 KB Output is correct
64 Correct 102 ms 73700 KB Output is correct
65 Correct 102 ms 73764 KB Output is correct
66 Correct 100 ms 73776 KB Output is correct
67 Correct 99 ms 73544 KB Output is correct
68 Correct 97 ms 73784 KB Output is correct
69 Correct 0 ms 204 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 97 ms 73724 KB Output is correct
72 Correct 96 ms 73796 KB Output is correct
73 Correct 100 ms 73880 KB Output is correct
74 Correct 1 ms 204 KB Output is correct
75 Correct 0 ms 204 KB Output is correct
76 Correct 1 ms 204 KB Output is correct
77 Correct 1 ms 204 KB Output is correct
78 Correct 115 ms 73248 KB Output is correct
79 Correct 107 ms 73240 KB Output is correct
80 Correct 110 ms 73268 KB Output is correct
81 Correct 102 ms 73776 KB Output is correct
82 Correct 113 ms 73336 KB Output is correct
83 Correct 111 ms 73260 KB Output is correct
84 Correct 0 ms 204 KB Output is correct
85 Correct 1 ms 332 KB Output is correct
86 Correct 1 ms 332 KB Output is correct
87 Correct 6 ms 460 KB Output is correct
88 Correct 85 ms 1008 KB Output is correct
89 Correct 78 ms 972 KB Output is correct
90 Correct 84 ms 972 KB Output is correct
91 Correct 79 ms 956 KB Output is correct
92 Correct 79 ms 1004 KB Output is correct
93 Correct 79 ms 972 KB Output is correct
94 Correct 82 ms 972 KB Output is correct
95 Correct 77 ms 952 KB Output is correct
96 Correct 85 ms 972 KB Output is correct
97 Correct 82 ms 1016 KB Output is correct
98 Correct 79 ms 972 KB Output is correct
99 Correct 77 ms 972 KB Output is correct
100 Incorrect 1 ms 972 KB Output isn't correct
101 Halted 0 ms 0 KB -