oj.uz

Submission #266461

# Submission time Handle Problem Language Result Execution time Memory
266461 2020-08-15T09:58:12 Z wdjpng Arranging Shoes (IOI19_shoes) C++17
10 / 100
 1 ms 256 KB 
#include <bits/stdc++.h>

#define rep(i,n) for(int i = 0; i  < n; i++)
#define lint long long
using namespace std;


vector<int>T;
void update(int i, int k, int n){
    i++;
    for(;i <= n;i+=i&-i){
        T[i]+=k;
    }
}

int get(int i){
    i++;
    int s = 0;
    for(; i>0; i-=i&-i){
        s+=T[i];
    }
    return s;
}

int getRange(int l, int r){
    return get(r) - get(l-1);
}
lint count_swaps(vector<int> s){
    int n = s.size()/2;
    T.resize(4*n+4);
    vector<set<int>>set(2*n+1);
    vector<bool>ignore(2*n);

    rep(i,2*n){
        set[s[i]+n].insert(i);
    }
    int sum=0;
    int curAdd=0;
    rep(i,2*n){
        if(ignore[i]){continue;}
        
        int nearest=*set[-s[i]+n].begin();
        set[-s[i]+n].erase(set[-s[i]+n].begin());

        ignore[nearest]=true;
        
        if(s[i]>0){sum++;}
        update(nearest,1, n);
        sum+=nearest-i-1 - getRange(i, nearest);
    }

    return sum;
}
/*
signed main(){
    int n;
    cin >> n;
    n*=2;
    vector<int>s(n);
    rep(i,n){cin>>s[i];}
    cout << count_swaps(s);
}
*/

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:38:9: warning: unused variable 'curAdd' [-Wunused-variable]
   38 |     int curAdd=0;
      |         ^~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

# 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 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 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 -

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

# 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 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 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 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Incorrect 0 ms 256 KB Output isn't correct
8 Halted 0 ms 0 KB -