Submission #2008487


Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<P,ll> PPI;
typedef pair<ll,P> PIP;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vp;
#define PQ(T) priority_queue<T,vector<T>,greater<T>>
#define PQ2(T) priority_queue<T>
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define REP(i,a,b) for(ll (i)=a;(i)<(ll)(b);++(i))
#define rep(i,n) REP(i,0,n)
#define rep1(i,n) REP(i,1,n+1)
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(x,y) ((x)=min((x),(y)))
#define chmax(x,y) ((x)=max((x),(y)))
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
#define DEBUG(x) cerr<<"line ("<<__LINE__<<")  "<<#x<<": "<<x<<endl;
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}

#define N 2010
#define K 70
int dp[N][N];

int g(int a, int b){
	if(a>b) swap(a, b);
	if(a<=0||a==b) return -1;
	if(dp[a][b]>=0) return dp[a][b];
	if(a==1) return dp[a][b] = b-2;
	set<int> st;
	for(int i = 1; i < a; i++) st.insert(g(i, b));
	for(int i = 1; i < b; i++) if(i!=a) st.insert(g(a, i));
	rep(i, a+b+1) if(!st.count(i)) return dp[a][b] = i;
}

ll f(vector<ll> &x){
	if(x.empty()) return 0;
	rep(i, x.size()-1) x[i+1] = (x[i+1]^x[0])-1;
	int r = x.size()%2?x[0]:0;
	x.erase(x.begin());
	sort(all(x));
	return r^f(x);
}

int main(){
	mset(dp, -1);
	//rep1(i, K) rep1(j, K) printf("%2d%c", g(i, j), j==K?'\n':' ');
	//rep1(i, K) rep1(j, K) printf("%2d%c", i>=j?-1:g(i+1, j+1)^((i^j)-1), j==K?'\n':' ');
	ll n;
	cin>>n;
	vector<ll> a, b;
	rep(i, n){
		ll x;
		cin>>x;
		if(x>0) a.pb(x-1);
		else b.pb(-x-1);
	}
	sort(all(a)); sort(all(b));
	cout<<(f(a)^f(b)?"Alyssa":"Ben")<<endl;
	//rep(i, N) rep(j, N) g(i, j);
	/*int a, b;
	while(cin>>a>>b){
		cout<<g(a, b)<<endl;
		//cout<<dp[a][b]<<endl;
	}
	*/
	return 0;
}

Submission Info

Submission Time
Task L - コインゲーム
User Lepton
Language C++14 (GCC 5.4.1)
Score 400
Code Size 2650 Byte
Status AC
Exec Time 64 ms
Memory 16128 KB

Judge Result

Set Name Small All
Score / Max Score 30 / 30 370 / 370
Status
AC × 32
AC × 93
Set Name Test Cases
Small 00_sample_small_00.txt, 00_sample_small_01.txt, 11_small_00.txt, 11_small_01.txt, 11_small_02.txt, 11_small_03.txt, 11_small_04.txt, 11_small_05.txt, 11_small_06.txt, 11_small_07.txt, 11_small_08.txt, 11_small_09.txt, 14_small_10.txt, 14_small_11.txt, 14_small_12.txt, 14_small_13.txt, 14_small_14.txt, 14_small_15.txt, 14_small_16.txt, 14_small_17.txt, 14_small_18.txt, 14_small_19.txt, 14_small_20.txt, 14_small_21.txt, 14_small_22.txt, 14_small_23.txt, 14_small_24.txt, 14_small_25.txt, 14_small_26.txt, 14_small_27.txt, 14_small_28.txt, 14_small_29.txt
All 00_sample_small_00.txt, 00_sample_small_01.txt, 11_small_00.txt, 11_small_01.txt, 11_small_02.txt, 11_small_03.txt, 11_small_04.txt, 11_small_05.txt, 11_small_06.txt, 11_small_07.txt, 11_small_08.txt, 11_small_09.txt, 14_small_10.txt, 14_small_11.txt, 14_small_12.txt, 14_small_13.txt, 14_small_14.txt, 14_small_15.txt, 14_small_16.txt, 14_small_17.txt, 14_small_18.txt, 14_small_19.txt, 14_small_20.txt, 14_small_21.txt, 14_small_22.txt, 14_small_23.txt, 14_small_24.txt, 14_small_25.txt, 14_small_26.txt, 14_small_27.txt, 14_small_28.txt, 14_small_29.txt, 50_random_30.txt, 50_random_31.txt, 50_random_32.txt, 50_random_33.txt, 50_random_34.txt, 50_random_35.txt, 50_random_36.txt, 50_random_37.txt, 50_random_38.txt, 50_random_39.txt, 50_sample_00.txt, 60_Alyssa_41.txt, 60_Alyssa_42.txt, 60_Alyssa_43.txt, 60_Alyssa_48.txt, 60_Alyssa_51.txt, 60_Alyssa_52.txt, 60_Alyssa_54.txt, 60_Alyssa_55.txt, 60_Alyssa_57.txt, 60_Alyssa_58.txt, 60_Alyssa_59.txt, 60_Alyssa_62.txt, 60_Alyssa_64.txt, 60_Alyssa_65.txt, 60_Alyssa_66.txt, 60_Alyssa_67.txt, 60_Alyssa_68.txt, 60_Alyssa_69.txt, 60_Alyssa_70.txt, 60_Alyssa_74.txt, 60_Alyssa_75.txt, 60_Alyssa_76.txt, 60_Alyssa_77.txt, 60_Ben_40.txt, 60_Ben_44.txt, 60_Ben_45.txt, 60_Ben_46.txt, 60_Ben_47.txt, 60_Ben_49.txt, 60_Ben_50.txt, 60_Ben_53.txt, 60_Ben_56.txt, 60_Ben_60.txt, 60_Ben_61.txt, 60_Ben_63.txt, 60_Ben_71.txt, 60_Ben_72.txt, 60_Ben_73.txt, 60_Ben_78.txt, 60_Ben_79.txt, 70_Alyssa_80.txt, 70_Alyssa_82.txt, 70_Alyssa_83.txt, 70_Alyssa_85.txt, 70_Alyssa_86.txt, 70_Alyssa_89.txt, 70_Ben_81.txt, 70_Ben_84.txt, 70_Ben_87.txt, 70_Ben_88.txt
Case Name Status Exec Time Memory
00_sample_small_00.txt AC 6 ms 16000 KB
00_sample_small_01.txt AC 6 ms 16000 KB
11_small_00.txt AC 6 ms 16000 KB
11_small_01.txt AC 6 ms 16000 KB
11_small_02.txt AC 6 ms 16000 KB
11_small_03.txt AC 6 ms 16000 KB
11_small_04.txt AC 6 ms 16000 KB
11_small_05.txt AC 6 ms 16000 KB
11_small_06.txt AC 6 ms 16000 KB
11_small_07.txt AC 6 ms 16000 KB
11_small_08.txt AC 6 ms 16000 KB
11_small_09.txt AC 6 ms 16000 KB
14_small_10.txt AC 6 ms 16000 KB
14_small_11.txt AC 6 ms 16000 KB
14_small_12.txt AC 6 ms 16000 KB
14_small_13.txt AC 6 ms 16000 KB
14_small_14.txt AC 6 ms 16000 KB
14_small_15.txt AC 6 ms 16000 KB
14_small_16.txt AC 6 ms 16000 KB
14_small_17.txt AC 6 ms 16000 KB
14_small_18.txt AC 6 ms 16000 KB
14_small_19.txt AC 6 ms 16000 KB
14_small_20.txt AC 6 ms 16000 KB
14_small_21.txt AC 6 ms 16000 KB
14_small_22.txt AC 6 ms 16000 KB
14_small_23.txt AC 6 ms 16000 KB
14_small_24.txt AC 6 ms 16000 KB
14_small_25.txt AC 6 ms 16000 KB
14_small_26.txt AC 6 ms 16000 KB
14_small_27.txt AC 6 ms 16000 KB
14_small_28.txt AC 6 ms 16000 KB
14_small_29.txt AC 6 ms 16000 KB
50_random_30.txt AC 26 ms 16128 KB
50_random_31.txt AC 9 ms 16000 KB
50_random_32.txt AC 33 ms 16128 KB
50_random_33.txt AC 21 ms 16128 KB
50_random_34.txt AC 6 ms 16000 KB
50_random_35.txt AC 27 ms 16128 KB
50_random_36.txt AC 18 ms 16128 KB
50_random_37.txt AC 29 ms 16128 KB
50_random_38.txt AC 19 ms 16128 KB
50_random_39.txt AC 12 ms 16128 KB
50_sample_00.txt AC 6 ms 16000 KB
60_Alyssa_41.txt AC 6 ms 16000 KB
60_Alyssa_42.txt AC 14 ms 16128 KB
60_Alyssa_43.txt AC 18 ms 16128 KB
60_Alyssa_48.txt AC 34 ms 16128 KB
60_Alyssa_51.txt AC 7 ms 16000 KB
60_Alyssa_52.txt AC 12 ms 16128 KB
60_Alyssa_54.txt AC 8 ms 16000 KB
60_Alyssa_55.txt AC 27 ms 16128 KB
60_Alyssa_57.txt AC 29 ms 16128 KB
60_Alyssa_58.txt AC 24 ms 16128 KB
60_Alyssa_59.txt AC 8 ms 16000 KB
60_Alyssa_62.txt AC 6 ms 16000 KB
60_Alyssa_64.txt AC 20 ms 16128 KB
60_Alyssa_65.txt AC 7 ms 16000 KB
60_Alyssa_66.txt AC 33 ms 16128 KB
60_Alyssa_67.txt AC 24 ms 16128 KB
60_Alyssa_68.txt AC 9 ms 16000 KB
60_Alyssa_69.txt AC 16 ms 16128 KB
60_Alyssa_70.txt AC 35 ms 16128 KB
60_Alyssa_74.txt AC 35 ms 16128 KB
60_Alyssa_75.txt AC 35 ms 16128 KB
60_Alyssa_76.txt AC 36 ms 16128 KB
60_Alyssa_77.txt AC 35 ms 16128 KB
60_Ben_40.txt AC 31 ms 16128 KB
60_Ben_44.txt AC 19 ms 16128 KB
60_Ben_45.txt AC 28 ms 16128 KB
60_Ben_46.txt AC 21 ms 16128 KB
60_Ben_47.txt AC 26 ms 16128 KB
60_Ben_49.txt AC 23 ms 16128 KB
60_Ben_50.txt AC 23 ms 16128 KB
60_Ben_53.txt AC 11 ms 16128 KB
60_Ben_56.txt AC 30 ms 16128 KB
60_Ben_60.txt AC 8 ms 16000 KB
60_Ben_61.txt AC 15 ms 16128 KB
60_Ben_63.txt AC 27 ms 16128 KB
60_Ben_71.txt AC 33 ms 16128 KB
60_Ben_72.txt AC 32 ms 16128 KB
60_Ben_73.txt AC 29 ms 16128 KB
60_Ben_78.txt AC 30 ms 16128 KB
60_Ben_79.txt AC 25 ms 16128 KB
70_Alyssa_80.txt AC 54 ms 16128 KB
70_Alyssa_82.txt AC 55 ms 16128 KB
70_Alyssa_83.txt AC 56 ms 16128 KB
70_Alyssa_85.txt AC 55 ms 16128 KB
70_Alyssa_86.txt AC 54 ms 16128 KB
70_Alyssa_89.txt AC 58 ms 16128 KB
70_Ben_81.txt AC 27 ms 16128 KB
70_Ben_84.txt AC 57 ms 16128 KB
70_Ben_87.txt AC 41 ms 16128 KB
70_Ben_88.txt AC 64 ms 16128 KB