제출 #283061

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

shoes

#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
#include <deque>
#include <iomanip>
#include <cmath>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>

using namespace std;

#define FOR(i,n) for(int me=0;me<n;me++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long 
//#define int long long
#define ld long double
#define vi vector<int>
#define pb push_back
#define ff first
#define ss second
#define ii pair<int,int>
#define iii pair<ii,int>
#define il pair<ll,ll>
#define vv vector
#define endl '\n'
 
int count_swaps( vector < int > vc ){
	if (vc[0] < vc[1]) {
		return 0;
	} 
	else if (vc[0] > vc[1]) {
		return 1;
	}
	else {
		return 2;
	}
}

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