Submission #286224

# Submission time Handle Problem Language Result Execution time Memory
286224 2020-08-30T08:31:12 Z BeanZ Arranging Shoes (IOI19_shoes) C++14
45 / 100
35 ms 3320 KB
#include <bits/stdc++.h>
#include "shoes.h"

using namespace std;

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

const int N = 2e5 + 5;
ll a[200005];
ll count_swaps(vector<int> s){
        ll now = 0, ans = 0;
        int n = s.size() / 2;
        for (int i = 0; i < (2 * n); i++){
                if (s[i] < 0){
                        ans = ans + abs(i - now);
                        now += 2;
                }
        }
        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;
}
*/
/*
*/
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 1 ms 256 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 3 ms 512 KB Output is correct
21 Correct 4 ms 512 KB Output is correct
22 Correct 31 ms 3200 KB Output is correct
23 Correct 31 ms 3192 KB Output is correct
24 Correct 32 ms 3196 KB Output is correct
25 Correct 28 ms 2936 KB Output is correct
26 Correct 31 ms 3196 KB Output is correct
27 Correct 29 ms 2944 KB Output is correct
28 Correct 30 ms 3192 KB Output is correct
29 Correct 30 ms 3192 KB Output is correct
30 Correct 30 ms 3192 KB Output is correct
31 Correct 31 ms 3192 KB Output is correct
32 Correct 29 ms 3192 KB Output is correct
33 Correct 28 ms 2944 KB Output is correct
34 Correct 29 ms 3200 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 0 ms 256 KB Output is correct
37 Correct 30 ms 3192 KB Output is correct
38 Correct 29 ms 3320 KB Output is correct
39 Correct 30 ms 3200 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 35 ms 3192 KB Output is correct
6 Correct 33 ms 3192 KB Output is correct
7 Correct 34 ms 3064 KB Output is correct
8 Correct 31 ms 3192 KB Output is correct
9 Correct 34 ms 3072 KB Output is correct
10 Correct 35 ms 3320 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -