제출 #1293035

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1293035		lukaye_19	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	14 ms	2732 KiB

shoes

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

long long count_swaps(vector<int>Shoes) {
    vector<int>ShoesQueue = Shoes;
    
    int SameSizeAnswer = 0;
      
      int c1 = 0;
      int c2 = 0;
      
      int cnt = 0;
      
      for (int i = 0; i < ShoesQueue.size(); i++)
      {
        int Shoe = ShoesQueue[i];
        
        if (Shoe < 0)
        {
          cnt += abs(i - c1 * 2);
          c1++;
        }
        else if (Shoe > 0 )
        {
          cnt += abs(i - c2 * 2 - 1);
          c2++;
        }
      }
      
      SameSizeAnswer = cnt / 2;
      
      return SameSizeAnswer;
  
}

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