제출 #1022621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1022621		CodeAssignment	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1 ms	604 KiB

shoes

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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define trav(a, x) for (auto &a : x)
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

ll count_swaps(vector<int> S) {
	assert(sz(S) % 2 == 0);
	ll n = sz(S) / 2; // number of pairs
	vi a = S;

	assert(n == 1);
	if (a[0] == 1) return 1;
	return 0;
}

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