제출 #295030

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
295030		SamAnd	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1086 ms	2816 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 200005;

int n;
int a[N];

long long count_swaps(std::vector<int> s)
{
    n = sz(s) / 2;
    for (int i = 1; i <= n * 2; ++i)
        a[i] = s[i - 1];
	ll ans = 0;
	for (int i = 1; i <= n; ++i)
    {
        for (int j = (i - 1) * 2 + 1; j <= n * 2; ++j)
        {
            if (a[j] == -a[(i - 1) * 2 + 1])
            {
                for (int k = j; k > (i - 1) * 2 + 2; --k)
                {
                    ++ans;
                    swap(a[k], a[k - 1]);
                }
                break;
            }
        }
        if (a[(i - 1) * 2 + 1] > 0)
        {
            ++ans;
        }
    }
    return ans;
}

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:18:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   18 |     for (int i = 1; i <= n * 2; ++i)
      |     ^~~
shoes.cpp:20:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   20 |  ll ans = 0;
      |  ^~

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