oj.uz

답안 #560662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
560662 2022-05-11T19:28:00 Z Vanilla Arranging Shoes (IOI19_shoes) C++17
100 / 100
 531 ms 148016 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 2e5 + 2;
int bit [maxn];
bitset <maxn> done;


void solve(int id){
    
    return;
}

void add (int x, int d) {
    for (; x < maxn; x += x & -x) {
        bit[x]+=d;
    }
}

int query (int x) {
    int rs = 0;
    for (; x > 0; x -= x & -x) {
        rs+=bit[x];
    }
    return rs;
}

int64 count_swaps(vector <int> a) {
    int64 rs = 0;
    int n = a.size();
    a.insert(a.begin(), 0);
    map <int, queue <int> > mp;
    for (int i = 1; i <= n; i++){
        mp[a[i]].push(i);
    }
    for (int i = 1; i <= n; i++){
        if (done[i]) continue;
        while (!mp[-a[i]].empty() && mp[-a[i]].front() < i) {
            mp[-a[i]].pop();
        }
        if (mp[-a[i]].empty()) continue;
        int pos = mp[-a[i]].front();
        int now = i + query(i);
        int actual = pos + query(pos);
        rs+=actual - now - 1;
        //cout << i << " " << pos << " " << now << " " << actual << "\n";
        done[pos] = 1;
        if (a[i] > 0) {
            rs++;
            // add(i, 1);
        }
        // else add (i + 1, 1);
        add(i, 1);
        add(pos + 1, -1);
        mp[-a[i]].pop();
    }
    return rs;
}

int brute (vector <int> a) {
    int64 rs = 0;
    int n = a.size();
    // db(n);
    for (int i = 0; i < n; i+=2){
        // cout << i << " ";
        int pos = -1;
        for (int j = i + 1; j < n; j++){
            if (a[j] == -a[i]) {
                pos = j;
                break;
            }
        }
        while (pos != i + 1) {
            swap(a[pos], a[pos - 1]);
            rs++;
            pos--;
        }
        if (a[i] > 0) {
            swap(a[i], a[i + 1]);
            rs++;
        }
    }
    return rs;
}

// int main() {
//     vector <int> s = {1, 1, 1, 1, -1, -1, -1, -1};
//     sort(s.begin(), s.end());
//     int ok = 0;
//     do {
//         // cout << ok++ << "\n";
//         for (int i = 1; i <= 10; i++){
//             bit[i] = 0;
//             done[i] = 0;
//         }
//         int v1 = brute(s);
//         int v2 = count_swaps(s);
//         if (v1 != v2) {
//             cout << v1 << " " << v2 << "\n";
//             for (int i: s){
//                 cout << i << " ";
//             }
//             break;
//         }
//     } while (next_permutation(s.begin(), s.end()));
// }
// int main(){
//     // ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
//     // vector <int> a = {-2, 2, 2, -2, -2, 2};
//     // vector <int> a = {2, 1, -1, -2};
//     vector <int> a = {-1, -1, -1, 1, -1, 1, 1, 1 };
//     cout << count_swaps(a) << " ";
//     cout << brute(a) << " ";
//     return 0;
// }

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 3 ms 596 KB Output is correct
22 Correct 29 ms 3476 KB Output is correct
23 Correct 28 ms 3440 KB Output is correct
24 Correct 30 ms 3428 KB Output is correct
25 Correct 25 ms 3464 KB Output is correct
26 Correct 33 ms 4652 KB Output is correct
27 Correct 29 ms 4540 KB Output is correct
28 Correct 31 ms 4648 KB Output is correct
29 Correct 29 ms 4764 KB Output is correct
30 Correct 26 ms 4648 KB Output is correct
31 Correct 31 ms 4648 KB Output is correct
32 Correct 27 ms 4652 KB Output is correct
33 Correct 28 ms 4528 KB Output is correct
34 Correct 27 ms 4772 KB Output is correct
35 Correct 1 ms 316 KB Output is correct
36 Correct 1 ms 308 KB Output is correct
37 Correct 30 ms 4676 KB Output is correct
38 Correct 26 ms 4664 KB Output is correct
39 Correct 28 ms 4652 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 458 ms 146636 KB Output is correct
6 Correct 125 ms 15164 KB Output is correct
7 Correct 452 ms 147832 KB Output is correct
8 Correct 32 ms 4668 KB Output is correct
9 Correct 413 ms 147928 KB Output is correct
10 Correct 311 ms 75924 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 0 ms 340 KB Output is correct
42 Correct 0 ms 340 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 3 ms 596 KB Output is correct
55 Correct 3 ms 596 KB Output is correct
56 Correct 29 ms 3476 KB Output is correct
57 Correct 28 ms 3440 KB Output is correct
58 Correct 30 ms 3428 KB Output is correct
59 Correct 25 ms 3464 KB Output is correct
60 Correct 33 ms 4652 KB Output is correct
61 Correct 29 ms 4540 KB Output is correct
62 Correct 31 ms 4648 KB Output is correct
63 Correct 29 ms 4764 KB Output is correct
64 Correct 26 ms 4648 KB Output is correct
65 Correct 31 ms 4648 KB Output is correct
66 Correct 27 ms 4652 KB Output is correct
67 Correct 28 ms 4528 KB Output is correct
68 Correct 27 ms 4772 KB Output is correct
69 Correct 1 ms 316 KB Output is correct
70 Correct 1 ms 308 KB Output is correct
71 Correct 30 ms 4676 KB Output is correct
72 Correct 26 ms 4664 KB Output is correct
73 Correct 28 ms 4652 KB Output is correct
74 Correct 0 ms 340 KB Output is correct
75 Correct 0 ms 340 KB Output is correct
76 Correct 0 ms 340 KB Output is correct
77 Correct 1 ms 340 KB Output is correct
78 Correct 458 ms 146636 KB Output is correct
79 Correct 125 ms 15164 KB Output is correct
80 Correct 452 ms 147832 KB Output is correct
81 Correct 32 ms 4668 KB Output is correct
82 Correct 413 ms 147928 KB Output is correct
83 Correct 311 ms 75924 KB Output is correct
84 Correct 0 ms 340 KB Output is correct
85 Correct 0 ms 340 KB Output is correct
86 Correct 1 ms 468 KB Output is correct
87 Correct 1 ms 596 KB Output is correct
88 Correct 2 ms 1748 KB Output is correct
89 Correct 3 ms 1748 KB Output is correct
90 Correct 2 ms 1620 KB Output is correct
91 Correct 2 ms 1364 KB Output is correct
92 Correct 2 ms 1236 KB Output is correct
93 Correct 2 ms 1108 KB Output is correct
94 Correct 1 ms 980 KB Output is correct
95 Correct 1 ms 724 KB Output is correct
96 Correct 1 ms 596 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 340 KB Output is correct
99 Correct 2 ms 1748 KB Output is correct
100 Correct 2 ms 1748 KB Output is correct
101 Correct 26 ms 13632 KB Output is correct
102 Correct 12 ms 3468 KB Output is correct
103 Correct 531 ms 147872 KB Output is correct
104 Correct 448 ms 148016 KB Output is correct
105 Correct 393 ms 85608 KB Output is correct
106 Correct 436 ms 147860 KB Output is correct
107 Correct 162 ms 19924 KB Output is correct
108 Correct 194 ms 35844 KB Output is correct
109 Correct 27 ms 4656 KB Output is correct
110 Correct 26 ms 4668 KB Output is correct
111 Correct 426 ms 132012 KB Output is correct
112 Correct 437 ms 115900 KB Output is correct
113 Correct 148 ms 21684 KB Output is correct
114 Correct 430 ms 147864 KB Output is correct
115 Correct 433 ms 147824 KB Output is correct