oj.uz

답안 #280101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
280101 2020-08-22T13:33:40 Z ec1117 Arranging Shoes (IOI19_shoes) C++17
45 / 100
 79 ms 11808 KB 
/**
 * Description: range sum queries and point updates for $D$ dimensions
 * Source: https://codeforces.com/blog/entry/64914
 * Verification: SPOJ matsum
 * Usage: \texttt{BIT<int,10,10>} gives 2D BIT
 * Time: O((\log N)^D)
 */


#include "bits/stdc++.h"
#include "shoes.h"
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;

#define pb push_back
#define mp make_pair
#define sz(v) ((int)(v).size())

const int MAXN = 200005;

struct bit{
    int tree[MAXN];
    void add(int x, int v){
        for(int i=x; i<MAXN; i+=i&-i) tree[i] += v;
    }
    int query(int x){
        int ret = 0;
        for(int i=x; i; i-=i&-i) ret += tree[i];
        return ret;
    }
}bit;


vector<pi> order[MAXN];
vector<pi> calc;
ll count_swaps(vector<int> s){
    int n = sz(s) / 2;
    ll ret=0;
    for(int i=0;i<sz(s);i++)
        order[abs(s[i])].emplace_back(s[i], i);
    for(int i=1;i<=MAXN;i++){
        sort(order[i].begin(), order[i].end());
        for(int j=0;j<order[i].size()/2;j++){
            int l = order[i][j].second;
            int r = order[i][j + sz(order[i])/2].second;
            if(l>r) {
                ret++;
                swap(l,r);
            }
            calc.emplace_back(l + 1, r + 1);
        }
    }
    for(int i=1; i<=2*n; i++) bit.add(i, 1);
//    sort(calc.begin(),calc.end());
    for(pi x:calc){
        ret += bit.query(x.second - 1) - bit.query(x.first);
        bit.add(x.second,-1);
        bit.add(x.first,-1);
    }
    return ret;
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Incorrect 4 ms 4992 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 5 ms 4992 KB Output is correct
6 Correct 5 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 4 ms 5072 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 5 ms 4992 KB Output is correct
17 Correct 4 ms 4992 KB Output is correct
18 Correct 5 ms 5120 KB Output is correct
19 Correct 5 ms 5120 KB Output is correct
20 Correct 10 ms 5756 KB Output is correct
21 Correct 10 ms 5756 KB Output is correct
22 Correct 66 ms 11076 KB Output is correct
23 Correct 72 ms 10984 KB Output is correct
24 Correct 69 ms 11024 KB Output is correct
25 Correct 52 ms 10984 KB Output is correct
26 Correct 64 ms 10984 KB Output is correct
27 Correct 57 ms 10956 KB Output is correct
28 Correct 53 ms 10984 KB Output is correct
29 Correct 72 ms 10984 KB Output is correct
30 Correct 53 ms 10988 KB Output is correct
31 Correct 70 ms 10984 KB Output is correct
32 Correct 62 ms 10984 KB Output is correct
33 Correct 59 ms 10984 KB Output is correct
34 Correct 56 ms 10984 KB Output is correct
35 Correct 4 ms 4992 KB Output is correct
36 Correct 4 ms 4992 KB Output is correct
37 Correct 58 ms 10984 KB Output is correct
38 Correct 65 ms 10984 KB Output is correct
39 Correct 55 ms 11016 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 5 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 74 ms 11808 KB Output is correct
6 Correct 65 ms 10996 KB Output is correct
7 Correct 73 ms 11632 KB Output is correct
8 Correct 57 ms 11180 KB Output is correct
9 Correct 76 ms 11676 KB Output is correct
10 Correct 79 ms 11372 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Incorrect 4 ms 4992 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Incorrect 4 ms 4992 KB Output isn't correct
5 Halted 0 ms 0 KB -