Submission #1974307


Source Code Expand

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstdio>
#include <cstring>
#include <cinttypes>
using namespace std;
 
using ll=int64_t;
#define int ll
 
#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define ALL(x) x.begin(),x.end()
#define REACH cerr<<"reached line "<<__LINE__<<endl
#define DMP(x) cerr<<"line "<<__LINE__<<" "<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;
 
void printSpace(){
	printf(" ");
}
 
void printEoln(){
	printf("\n");
}

int read(){
	int i;
	scanf("%" SCNd64,&i);
	return i;
}
void print(const string& s) {
	printf("%s", s.c_str());
}
void println(const string& s) {
	printf("%s\n", s.c_str());
}
void print(int x,int suc=1){
	printf("%" PRId64,x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}
 
string readString(){
	static char buf[3341919];
	scanf("%s",buf);
	return string(buf);
}
 
char* readCharArray(){
	static char buf[3341919];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template <typename T>
vector<T> readVec(int size) {
	using namespace std;
	vector<T> vec(size);
	for (int i = 0; i < size; ++i) {
		cin >> vec[i];
	}
	return vec;
}
template <typename T>
void printVec(const vector<T> &vec, int size, const string &sep = " ") {
	using namespace std;
	if (vec.empty()) return;
	cout << vec[0];
	for (int i = 1; i < size; ++i) {
		cout << sep << vec[i];
	}
	cout << endl;
	return;
}
#define printAll(vec) PrintSize(vec, vec.size())

signed main(void) {
	cin.tie(0);
	ios::sync_with_stdio(false);

	auto n = read();
	auto a = read();
	auto b = read();
	if ((b - a - 1) % 2 == 0) {
		cout << "Borys" << endl;
	} else {
		cout << "Alice" << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task A - Move and Win
User imadedede
Language C++14 (Clang 3.8.0)
Score 300
Code Size 2112 Byte
Status AC
Exec Time 5 ms
Memory 888 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 23
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt
Case Name Status Exec Time Memory
sample_01.txt AC 5 ms 888 KiB
sample_02.txt AC 1 ms 256 KiB
sample_03.txt AC 1 ms 256 KiB
subtask_1_01.txt AC 1 ms 256 KiB
subtask_1_02.txt AC 1 ms 256 KiB
subtask_1_03.txt AC 1 ms 256 KiB
subtask_1_04.txt AC 1 ms 256 KiB
subtask_1_05.txt AC 1 ms 256 KiB
subtask_1_06.txt AC 1 ms 256 KiB
subtask_1_07.txt AC 1 ms 256 KiB
subtask_1_08.txt AC 1 ms 256 KiB
subtask_1_09.txt AC 1 ms 256 KiB
subtask_1_10.txt AC 1 ms 256 KiB
subtask_1_11.txt AC 1 ms 256 KiB
subtask_1_12.txt AC 1 ms 256 KiB
subtask_1_13.txt AC 1 ms 256 KiB
subtask_1_14.txt AC 1 ms 256 KiB
subtask_1_15.txt AC 1 ms 256 KiB
subtask_1_16.txt AC 1 ms 256 KiB
subtask_1_17.txt AC 1 ms 256 KiB