제출 #984209

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
984209		SzymonKrzywda	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	3 ms	3672 KiB

shoes

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

const int base = 2<<17;
int tree[base*2+7];

void edit(int n){
    n+=base;
    while (n>0){
        tree[n] += 1;
        n/=2;
    }
}

int query(int a,int b){
    a+=base-1;
    b+=base+1;
    int wynik=0;
    while (a/2 != b/2){
        if (a%2==0) wynik += tree[a+1];
        if (b%2==1) wynik += tree[b-1];
        a/=2;
        b/=2;
    }
    return wynik;
}


long long count_swaps(vector<int>S){
    long long wynik = 0,idx_2,val,idx_3,size_,i;
    pair< vector<int>,int> idx[100007];

    priority_queue<pair<int,int>> kolejka;
    //pos, item
    for (int i; i<S.size(); ++i){
    
        if (S[i]>0) idx[S[i]].first.push_back(i);
        else kolejka.push({-i,S[i]});
    }
    size_ = S.size();
    while (!kolejka.empty()){
        idx_2 = -kolejka.top().first;
        val = kolejka.top().second;
        kolejka.pop();
        //cout << idx_2 << " " << val << endl;
        
        wynik += idx_2-i+query(idx_2+1,size_);
        edit(idx_2);
        //cout << wynik << endl;
        
        
        idx_3 = idx[-val].first[idx[-val].second];
        wynik += idx_3-(i+1)+query(idx_3+1,size_);
        edit(idx_3);
        //cout << wynik << endl << endl;
        idx[-val].second += 1;
        //cout<<"JAA";
        //idx[-val].second += 1;
        i+=2;
    }
    return wynik;
}

컴파일 시 표준 에러 (stderr) 메시지

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:36:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (int i; i<S.size(); ++i){
      |                 ~^~~~~~~~~
shoes.cpp:36:17: warning: 'i' is used uninitialized in this function [-Wuninitialized]
   36 |     for (int i; i<S.size(); ++i){
      |                 ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15