oj.uz

Submission #922086

# Submission time Handle Problem Language Result Execution time Memory
922086 2024-02-05T02:10:04 Z Nurislam Arranging Shoes (IOI19_shoes) C++14
100 / 100
 359 ms 32420 KB 
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
long long count_swaps(vector<int> p) {
    int n = (int)p.size();
    vector <int> bit(n+1);
    auto upd = [&](int i, int val){
        for (; i <= n; i += i&-i ) bit[i] += val;
    };
    auto get = [&](int i){
        int cnt = 0;
        assert(i <= n);
        for (; i > 0; i -= i&-i ) cnt += bit[i];
        return cnt;
    };
    for ( int i = 1; i <= n; i++ ) upd(i, 1);
    long long cnt = 0;
    map <int,multiset<int>> L, R;
    for ( int i = 1; i <= n; i++ ){
        if ( p[i-1] < 0 ) L[p[i-1]].insert(i);
        else R[p[i-1]].insert(i);
    }
    for ( int i = 1; i <= n; i++ ){
        if ( !p[i-1] ) continue;
        if ( p[i-1] < 0 ){
            L[p[i-1]].erase(L[p[i-1]].begin());
            assert(!R[-p[i-1]].empty());
            auto it = *R[-p[i-1]].begin();
            R[-p[i-1]].erase(R[-p[i-1]].begin());
            cnt += get(it)-get(i)-1;
            p[it-1] = 0;
            upd(i, 1), upd(it+1, -1);
        }
        else{
            R[p[i-1]].erase(R[p[i-1]].begin());
            assert(!L[-p[i-1]].empty());
            auto it = *L[-p[i-1]].begin();
            L[-p[i-1]].erase(L[-p[i-1]].begin());
            cnt += get(it)-get(i);
            p[it-1] = 0;
            upd(i, 1), upd(it+1, -1);
        }
    }
    return cnt;
}

Compilation message

shoes.cpp: In function 'void IO(std::string)':
shoes.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shoes.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 416 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 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 1 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 0 ms 348 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 344 KB Output is correct
28 Correct 0 ms 344 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 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 5 ms 1372 KB Output is correct
21 Correct 5 ms 1372 KB Output is correct
22 Correct 70 ms 11972 KB Output is correct
23 Correct 55 ms 12160 KB Output is correct
24 Correct 55 ms 12116 KB Output is correct
25 Correct 54 ms 12116 KB Output is correct
26 Correct 54 ms 13396 KB Output is correct
27 Correct 54 ms 13144 KB Output is correct
28 Correct 56 ms 13392 KB Output is correct
29 Correct 55 ms 13224 KB Output is correct
30 Correct 56 ms 13436 KB Output is correct
31 Correct 57 ms 13320 KB Output is correct
32 Correct 57 ms 13248 KB Output is correct
33 Correct 55 ms 13236 KB Output is correct
34 Correct 55 ms 13392 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 59 ms 13396 KB Output is correct
38 Correct 56 ms 13320 KB Output is correct
39 Correct 55 ms 13408 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 299 ms 30968 KB Output is correct
6 Correct 137 ms 15068 KB Output is correct
7 Correct 253 ms 32196 KB Output is correct
8 Correct 63 ms 13188 KB Output is correct
9 Correct 293 ms 32200 KB Output is correct
10 Correct 206 ms 22812 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 416 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 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 1 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 0 ms 348 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 344 KB Output is correct
28 Correct 0 ms 344 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 1 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 2 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 604 KB Output is correct
47 Correct 1 ms 856 KB Output is correct
48 Correct 1 ms 604 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 416 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 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 1 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 0 ms 348 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 344 KB Output is correct
28 Correct 0 ms 344 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 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 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 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 5 ms 1372 KB Output is correct
55 Correct 5 ms 1372 KB Output is correct
56 Correct 70 ms 11972 KB Output is correct
57 Correct 55 ms 12160 KB Output is correct
58 Correct 55 ms 12116 KB Output is correct
59 Correct 54 ms 12116 KB Output is correct
60 Correct 54 ms 13396 KB Output is correct
61 Correct 54 ms 13144 KB Output is correct
62 Correct 56 ms 13392 KB Output is correct
63 Correct 55 ms 13224 KB Output is correct
64 Correct 56 ms 13436 KB Output is correct
65 Correct 57 ms 13320 KB Output is correct
66 Correct 57 ms 13248 KB Output is correct
67 Correct 55 ms 13236 KB Output is correct
68 Correct 55 ms 13392 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 59 ms 13396 KB Output is correct
72 Correct 56 ms 13320 KB Output is correct
73 Correct 55 ms 13408 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 299 ms 30968 KB Output is correct
79 Correct 137 ms 15068 KB Output is correct
80 Correct 253 ms 32196 KB Output is correct
81 Correct 63 ms 13188 KB Output is correct
82 Correct 293 ms 32200 KB Output is correct
83 Correct 206 ms 22812 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 1 ms 344 KB Output is correct
88 Correct 2 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 604 KB Output is correct
94 Correct 1 ms 856 KB Output is correct
95 Correct 1 ms 604 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 16 ms 3160 KB Output is correct
102 Correct 11 ms 2136 KB Output is correct
103 Correct 359 ms 32420 KB Output is correct
104 Correct 255 ms 32084 KB Output is correct
105 Correct 265 ms 23888 KB Output is correct
106 Correct 263 ms 32084 KB Output is correct
107 Correct 141 ms 15444 KB Output is correct
108 Correct 171 ms 17592 KB Output is correct
109 Correct 52 ms 13440 KB Output is correct
110 Correct 56 ms 13392 KB Output is correct
111 Correct 247 ms 30040 KB Output is correct
112 Correct 285 ms 28120 KB Output is correct
113 Correct 180 ms 15700 KB Output is correct
114 Correct 260 ms 32084 KB Output is correct
115 Correct 281 ms 32200 KB Output is correct