oj.uz

Submission #286235

# Submission time Handle Problem Language Result Execution time Memory
286235 2020-08-30T08:39:54 Z BeanZ Arranging Shoes (IOI19_shoes) C++14
45 / 100
 52 ms 7424 KB 
#include <bits/stdc++.h>
#include "shoes.h"

using namespace std;

#define ll long long
#define endl '\n'

const int N = 2e5 + 5;
vector<ll> node[100005];
ll a[200005];
ll count_swaps(vector<int> s){
        ll ans = 0;
        int n = s.size() / 2;
        ll cnt = 1;
        for (int i = 0; i < (2 * n); i++){
                if (s[i] > 0){
                        node[s[i]].push_back(cnt - 1);
                        cnt += 2;
                }
        }
        for (int i = 1; i <= n; i++){
                if (node[i].size() == 0) continue;
                reverse(node[i].begin(), node[i].end());
        }
        for (int i = 0; i < (2 * n); i++){
                if (s[i] < 0){
                        ans = ans + abs(i - node[-s[i]].back());
                        node[-s[i]].pop_back();
                }
        }
        return ans;
}
/*
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("VietCT.INP", "r")){
                freopen("VietCT.INP", "r", stdin);
                freopen("VietCT.OUT", "w", stdout);
        }
        ll n;
        cin >> n;
        for (int i = 1; i <= 2 * n; i++) cin >> a[i];
        ll now = 1, ans = 0;
        for (int i = 1; i <= (2 * n); i++){
                if (a[i] < 0){
                        ans = ans + abs(i - now);
                        now += 2;
                }
        }
        cout << ans;
}
*/
/*
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Incorrect 3 ms 2688 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 2 ms 2688 KB Output is correct
6 Correct 2 ms 2688 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 2 ms 2688 KB Output is correct
9 Correct 2 ms 2688 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 2 ms 2688 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 2 ms 2688 KB Output is correct
16 Correct 2 ms 2688 KB Output is correct
17 Correct 2 ms 2688 KB Output is correct
18 Correct 2 ms 2632 KB Output is correct
19 Correct 2 ms 2688 KB Output is correct
20 Correct 5 ms 3072 KB Output is correct
21 Correct 5 ms 3072 KB Output is correct
22 Correct 45 ms 5360 KB Output is correct
23 Correct 34 ms 5360 KB Output is correct
24 Correct 36 ms 5368 KB Output is correct
25 Correct 31 ms 5368 KB Output is correct
26 Correct 36 ms 5368 KB Output is correct
27 Correct 32 ms 5360 KB Output is correct
28 Correct 33 ms 5360 KB Output is correct
29 Correct 32 ms 5360 KB Output is correct
30 Correct 34 ms 5360 KB Output is correct
31 Correct 39 ms 5360 KB Output is correct
32 Correct 33 ms 5360 KB Output is correct
33 Correct 33 ms 5360 KB Output is correct
34 Correct 35 ms 5360 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 2 ms 2688 KB Output is correct
37 Correct 33 ms 5360 KB Output is correct
38 Correct 33 ms 5360 KB Output is correct
39 Correct 33 ms 5360 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Correct 2 ms 2688 KB Output is correct
4 Correct 2 ms 2688 KB Output is correct
5 Correct 52 ms 7416 KB Output is correct
6 Correct 43 ms 5500 KB Output is correct
7 Correct 48 ms 7424 KB Output is correct
8 Correct 34 ms 5168 KB Output is correct
9 Correct 48 ms 7416 KB Output is correct
10 Correct 47 ms 6008 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Incorrect 3 ms 2688 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 2 ms 2688 KB Output is correct
3 Incorrect 3 ms 2688 KB Output isn't correct
4 Halted 0 ms 0 KB -