제출 #604255

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

shoes

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

typedef long long ll;
typedef pair<ll, ll> pl;
typedef double long dl;

#define f first
#define s second
#define pb push_back
#define sz(x) int((x).size())
#define all(x) begin(x), end(x)
#define ts to_string
#define lb lower_bound
#define ub upper_bound
#define yes cout << 'Y' << 'E' << 'S' << endl
#define no cout << 'N' << 'O' << endl
#define nd "\n"

const int pmod = 998244353;
const int mod = 1e9 + 7;
const ll inf = 1e18;

ll count_swaps(vector<int> shoes) {
  if (shoes[0] > 0 && shoes.size() == 2) {
    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