oj.uz

답안 #887197

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887197 2023-12-14T03:31:40 Z theghostking Arranging Shoes (IOI19_shoes) C++17
100 / 100
 72 ms 20948 KB 
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> tree;

int nc;

int query(int a, int b){
    a += nc;
    b += nc;
    int s = 0;
    while (a <= b){
        if (a%2){
            s += tree[a++];
        }
        if (b%2 == 0){
            s += tree[b--];
        }
        a /= 2;
        b /= 2;
    }
    return s;
}

void update(int k, int x){
    k += nc;
    tree[k] = x;
    k /= 2;
    while (k >= 1){
        tree[k] = tree[2*k] + tree[2*k+1];
        k /= 2;
    }
}

long long count_swaps(vector<int> s) {
    int n = s.size();
    vector<vector<int>> pos(n), neg(n);
    for (int i = 0; i<n; i++){
        int g = abs(s[i]);
        if (s[i] < 0){
            neg[g].push_back(i);
        }
        else{
            pos[g].push_back(i);
        }
    }
    for (int i = 0; i<n; i++){
        reverse(pos[i].begin(),pos[i].end());
        reverse(neg[i].begin(),neg[i].end());
    }
    nc = 1;
    while ((1<<nc) < n) nc++;
    nc = 1<<nc;
    tree.resize(2*nc);
    for (int i = 0; i<n; i++){
        tree[nc+i] = 1;
    }
    for (int i = nc-1; i>=1; i--){
        tree[i] = tree[2*i] + tree[2*i+1];
    }
    long long ans = 0;
    for (int i = 0; i<n; i++){
        int val = s[i];
        int g = abs(s[i]);
        if (s[i] > 0){
            if (pos[g].empty() || pos[g].back() != i) continue;
            pos[g].pop_back();
        }
        else{
            if (neg[g].empty() || neg[g].back() != i) continue;
            neg[g].pop_back();
        }
        int ind = -1;
        int rev = -s[i];
        if (rev > 0){
            ind = pos[g].back();
            pos[g].pop_back();
        }
        else{
            ind = neg[g].back();
            neg[g].pop_back();
        }
        ans += query(i+1,ind-1);
        if (s[i] > 0) ans++;
        update(i,0);
        update(ind,0);
    }
    return ans;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:64:13: warning: unused variable 'val' [-Wunused-variable]
   64 |         int val = s[i];
      |             ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 352 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 432 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 440 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 4 ms 1884 KB Output is correct
21 Correct 4 ms 1884 KB Output is correct
22 Correct 34 ms 14652 KB Output is correct
23 Correct 27 ms 15560 KB Output is correct
24 Correct 32 ms 15568 KB Output is correct
25 Correct 32 ms 15696 KB Output is correct
26 Correct 34 ms 15568 KB Output is correct
27 Correct 30 ms 15472 KB Output is correct
28 Correct 33 ms 15444 KB Output is correct
29 Correct 33 ms 15440 KB Output is correct
30 Correct 33 ms 15444 KB Output is correct
31 Correct 35 ms 15564 KB Output is correct
32 Correct 32 ms 15436 KB Output is correct
33 Correct 32 ms 15216 KB Output is correct
34 Correct 33 ms 15444 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 33 ms 15444 KB Output is correct
38 Correct 33 ms 15532 KB Output is correct
39 Correct 33 ms 15628 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 50 ms 20816 KB Output is correct
6 Correct 40 ms 15952 KB Output is correct
7 Correct 53 ms 20884 KB Output is correct
8 Correct 33 ms 15700 KB Output is correct
9 Correct 50 ms 20916 KB Output is correct
10 Correct 47 ms 17868 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 432 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 440 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 4 ms 1884 KB Output is correct
55 Correct 4 ms 1884 KB Output is correct
56 Correct 34 ms 14652 KB Output is correct
57 Correct 27 ms 15560 KB Output is correct
58 Correct 32 ms 15568 KB Output is correct
59 Correct 32 ms 15696 KB Output is correct
60 Correct 34 ms 15568 KB Output is correct
61 Correct 30 ms 15472 KB Output is correct
62 Correct 33 ms 15444 KB Output is correct
63 Correct 33 ms 15440 KB Output is correct
64 Correct 33 ms 15444 KB Output is correct
65 Correct 35 ms 15564 KB Output is correct
66 Correct 32 ms 15436 KB Output is correct
67 Correct 32 ms 15216 KB Output is correct
68 Correct 33 ms 15444 KB Output is correct
69 Correct 1 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 33 ms 15444 KB Output is correct
72 Correct 33 ms 15532 KB Output is correct
73 Correct 33 ms 15628 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 0 ms 432 KB Output is correct
77 Correct 0 ms 436 KB Output is correct
78 Correct 50 ms 20816 KB Output is correct
79 Correct 40 ms 15952 KB Output is correct
80 Correct 53 ms 20884 KB Output is correct
81 Correct 33 ms 15700 KB Output is correct
82 Correct 50 ms 20916 KB Output is correct
83 Correct 47 ms 17868 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 1 ms 348 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 1 ms 604 KB Output is correct
90 Correct 1 ms 604 KB Output is correct
91 Correct 1 ms 604 KB Output is correct
92 Correct 1 ms 604 KB Output is correct
93 Correct 1 ms 348 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 1 ms 348 KB Output is correct
98 Correct 1 ms 348 KB Output is correct
99 Correct 1 ms 604 KB Output is correct
100 Correct 1 ms 604 KB Output is correct
101 Correct 6 ms 2268 KB Output is correct
102 Correct 5 ms 1884 KB Output is correct
103 Correct 72 ms 20948 KB Output is correct
104 Correct 43 ms 20816 KB Output is correct
105 Correct 57 ms 18256 KB Output is correct
106 Correct 53 ms 20820 KB Output is correct
107 Correct 38 ms 16312 KB Output is correct
108 Correct 37 ms 16432 KB Output is correct
109 Correct 35 ms 15828 KB Output is correct
110 Correct 34 ms 15444 KB Output is correct
111 Correct 54 ms 20048 KB Output is correct
112 Correct 57 ms 19536 KB Output is correct
113 Correct 46 ms 16268 KB Output is correct
114 Correct 48 ms 20904 KB Output is correct
115 Correct 49 ms 20816 KB Output is correct