oj.uz

답안 #299684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
299684 2020-09-15T13:00:39 Z aZvezda Arranging Shoes (IOI19_shoes) C++14
100 / 100
 602 ms 28664 KB 
    #include "shoes.h"
    #include <bits/stdc++.h>
    using namespace std;
    //#pragma GCC optimize ("O3")
    //#pragma GCC target ("sse4")
    #define endl "\n"
    typedef long long ll;
    typedef long double ld;
    typedef unsigned long long ull;
    template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
    template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
    const ll mod = 1e9 + 7;
    template<class T> inline void fix(T &x) {if(x >= mod | x <= -mod) {x %= mod;} if(x < 0) {x += mod;}}
    #define out(x) cout << __LINE__ << ": " << (#x) << " = " << (x) << endl
      
    const ll MAX_N = 5e5 + 10;
    ll tree[4 * MAX_N], lazy[4 * MAX_N];
     
    void upd(ll curr, ll l, ll r, ll ind, ll val) {
    	if(ind < l || r < ind) {
    		return;
    	} else if(l == ind && ind == r) {
    		tree[curr] += val;
    		return;
    	} 
    	ll m = (l + r) / 2ll;
    	upd(curr * 2, l, m, ind, val);
    	upd(curr * 2 + 1, m + 1, r, ind, val);
    	tree[curr] = tree[curr * 2] + tree[curr * 2 + 1];
    }
     
    ll sum(ll curr, ll l, ll r, ll ql, ll qr) {
    	if(ql <= l && r <= qr) {
    		return tree[curr];
    	} else if(l > qr || r < ql) {
    		return 0;
    	}
    	ll m = (l + r) / 2ll;
    	return sum(curr * 2, l, m, ql, qr) + sum(curr * 2 + 1, m + 1, r, ql, qr);
    }
     
    map<ll, vector<ll> > mp;
    bool got[MAX_N];
     
    ll count_swaps(vector<int> arr) {
    	for(ll i = 0; i < arr.size(); i ++) {
    		mp[arr[i]].push_back(i);
    	}
    	for(auto &it : mp) {
    		reverse(it.second.begin(), it.second.end());
    	}
    	ll ret = 0;
    	for(ll i = 0; i < arr.size(); i ++) {
    		if(got[i]) {continue;}
    		if(arr[i] > 0) {ret ++;}
    		got[i] = true;
    		got[mp[-arr[i]].back()] = true;
    		ret += (mp[-arr[i]].back() - i - 1) - sum(1, 0, MAX_N - 1, i, mp[-arr[i]].back());
    		upd(1, 0, MAX_N - 1, mp[-arr[i]].back(), 1);
    		mp[arr[i]].pop_back();
    		mp[-arr[i]].pop_back();
    	}
    	return ret;
    }
    /*
    signed main() {
        //ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
        ll n;
        cin >> n;
        vector<ll> arr;
        arr.resize(n);
        for(ll i = 0; i < n; i ++) {
        	cin >> arr[i];
        }
        cout << shoes(arr);
        return 0;
    }*/

Compilation message

shoes.cpp: In function 'll count_swaps(std::vector<int>)':
shoes.cpp:46:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |      for(ll i = 0; i < arr.size(); i ++) {
      |                    ~~^~~~~~~~~~~~
shoes.cpp:53:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |      for(ll i = 0; i < arr.size(); i ++) {
      |                    ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 9 ms 1280 KB Output is correct
21 Correct 10 ms 1348 KB Output is correct
22 Correct 87 ms 8564 KB Output is correct
23 Correct 78 ms 8548 KB Output is correct
24 Correct 85 ms 8456 KB Output is correct
25 Correct 84 ms 6632 KB Output is correct
26 Correct 95 ms 8548 KB Output is correct
27 Correct 79 ms 8296 KB Output is correct
28 Correct 88 ms 6764 KB Output is correct
29 Correct 87 ms 6764 KB Output is correct
30 Correct 90 ms 6760 KB Output is correct
31 Correct 86 ms 8440 KB Output is correct
32 Correct 89 ms 6764 KB Output is correct
33 Correct 84 ms 6504 KB Output is correct
34 Correct 95 ms 6764 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 91 ms 6760 KB Output is correct
38 Correct 87 ms 6764 KB Output is correct
39 Correct 91 ms 6764 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 446 ms 27000 KB Output is correct
6 Correct 218 ms 9084 KB Output is correct
7 Correct 450 ms 27000 KB Output is correct
8 Correct 92 ms 7212 KB Output is correct
9 Correct 454 ms 27000 KB Output is correct
10 Correct 362 ms 16504 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 1 ms 416 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 512 KB Output is correct
53 Correct 1 ms 512 KB Output is correct
54 Correct 9 ms 1280 KB Output is correct
55 Correct 10 ms 1348 KB Output is correct
56 Correct 87 ms 8564 KB Output is correct
57 Correct 78 ms 8548 KB Output is correct
58 Correct 85 ms 8456 KB Output is correct
59 Correct 84 ms 6632 KB Output is correct
60 Correct 95 ms 8548 KB Output is correct
61 Correct 79 ms 8296 KB Output is correct
62 Correct 88 ms 6764 KB Output is correct
63 Correct 87 ms 6764 KB Output is correct
64 Correct 90 ms 6760 KB Output is correct
65 Correct 86 ms 8440 KB Output is correct
66 Correct 89 ms 6764 KB Output is correct
67 Correct 84 ms 6504 KB Output is correct
68 Correct 95 ms 6764 KB Output is correct
69 Correct 1 ms 384 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 91 ms 6760 KB Output is correct
72 Correct 87 ms 6764 KB Output is correct
73 Correct 91 ms 6764 KB Output is correct
74 Correct 1 ms 384 KB Output is correct
75 Correct 1 ms 384 KB Output is correct
76 Correct 1 ms 384 KB Output is correct
77 Correct 1 ms 384 KB Output is correct
78 Correct 446 ms 27000 KB Output is correct
79 Correct 218 ms 9084 KB Output is correct
80 Correct 450 ms 27000 KB Output is correct
81 Correct 92 ms 7212 KB Output is correct
82 Correct 454 ms 27000 KB Output is correct
83 Correct 362 ms 16504 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 1 ms 384 KB Output is correct
86 Correct 1 ms 384 KB Output is correct
87 Correct 1 ms 384 KB Output is correct
88 Correct 3 ms 640 KB Output is correct
89 Correct 2 ms 640 KB Output is correct
90 Correct 3 ms 640 KB Output is correct
91 Correct 3 ms 768 KB Output is correct
92 Correct 2 ms 640 KB Output is correct
93 Correct 2 ms 512 KB Output is correct
94 Correct 2 ms 512 KB Output is correct
95 Correct 2 ms 512 KB Output is correct
96 Correct 2 ms 512 KB Output is correct
97 Correct 2 ms 512 KB Output is correct
98 Correct 1 ms 384 KB Output is correct
99 Correct 3 ms 640 KB Output is correct
100 Correct 3 ms 640 KB Output is correct
101 Correct 27 ms 2944 KB Output is correct
102 Correct 20 ms 1536 KB Output is correct
103 Correct 602 ms 28664 KB Output is correct
104 Correct 396 ms 28536 KB Output is correct
105 Correct 514 ms 19576 KB Output is correct
106 Correct 453 ms 27000 KB Output is correct
107 Correct 237 ms 11260 KB Output is correct
108 Correct 256 ms 13176 KB Output is correct
109 Correct 90 ms 7660 KB Output is correct
110 Correct 90 ms 6888 KB Output is correct
111 Correct 426 ms 24568 KB Output is correct
112 Correct 511 ms 23800 KB Output is correct
113 Correct 281 ms 9848 KB Output is correct
114 Correct 444 ms 26912 KB Output is correct
115 Correct 452 ms 27048 KB Output is correct