Submission #829356

#	Time	Username	Problem	Language	Result	Execution time	Memory
829356		JoksimKaktus	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1077 ms	3124 KiB

shoes

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <set>

using namespace std;

long long count_swaps(vector <int> S){
    long long res = 0;
    for(int i = 0;i < S.size();i++){
        if(S[i] == 0){
            continue;
        }else if(S[i] < 0){
            int zero = 0;
            for(int j = i+1;j < S.size();j++){
                if(S[j] == -S[i]){
                    res += j-(i+1) - zero;
                    S[j] = 0;
                    S[i] = 0;
                    break;
                }else if(S[j] == 0){
                    zero++;
                }
            }
        }else{
            int zero = 0;
            for(int j = i+1;j < S.size();j++){
                if(-S[j] == S[i]){
                    res += j-(i) - zero;
                    S[j] = 0;
                    S[i] = 0;
                    break;
                }else if(S[j] == 0){
                    zero++;
                }
            }
        }
    }
    return res;
}

Compilation message (stderr)

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:15:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int i = 0;i < S.size();i++){
      |                   ~~^~~~~~~~~~
shoes.cpp:20:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |             for(int j = i+1;j < S.size();j++){
      |                             ~~^~~~~~~~~~
shoes.cpp:32:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |             for(int j = i+1;j < S.size();j++){
      |                             ~~^~~~~~~~~~

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