QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#154125#7115. Can You Guess My Sequence?ucup-team1325#AC ✓1ms3784kbC++17977b2023-08-31 13:54:122023-08-31 13:54:12

Judging History

你现在查看的是最新测评结果

  • [2023-08-31 13:54:12]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3784kb
  • [2023-08-31 13:54:12]
  • 提交

answer

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

typedef long long ll; typedef unsigned long long ull;
const int inf = 1e9; const ll llnf = 4e18;

template< class Tp > void chkmax( Tp &x , Tp y ) { x = max( x , y ); }
template< class Tp > void chkmin( Tp &x , Tp y ) { x = min( x , y ); }

constexpr int V = 20;

void Alice( ) {
	int n; cin >> n;
	vector< int > a( n ); for( int i = 0; i < n; i ++ ) cin >> a[i];

	int x = 0; for( int i = 0; i < n; i ++ ) x |= ( 1 << a[i] );
	cout << x << "\n";
}

void Bob( ) {
	int x; cin >> x;

	vector< int > a; for( int v = 0; v < V; v ++ ) if( ( x >> v ) & 1 ) a.emplace_back( v );
	cout << ( int ) a.size( ) << "\n"; for( int i = 0; i < ( int ) a.size( ); i ++ ) cout << a[i] << " "; cout << "\n";
}

void solve( ) {
	string s; cin >> s;
	if( s == "Alice" ) Alice( );
	else Bob( );
}

int main( ) {
	ios::sync_with_stdio( 0 ), cin.tie( 0 ), cout.tie( 0 );
	int T = 1; while( T -- ) solve( ); return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3580kb

First Run Input

Alice
6
2 3 5 8 10 15

First Run Output

34092

Second Run Input

Bob
34092

Second Run Output

6
2 3 5 8 10 15 

result:

ok correct

Test #2:

score: 100
Accepted
time: 1ms
memory: 3784kb

First Run Input

Alice
20
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

First Run Output

1048575

Second Run Input

Bob
1048575

Second Run Output

20
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 

result:

ok correct

Test #3:

score: 100
Accepted
time: 1ms
memory: 3784kb

First Run Input

Alice
1
0

First Run Output

1

Second Run Input

Bob
1

Second Run Output

1
0 

result:

ok correct

Test #4:

score: 100
Accepted
time: 1ms
memory: 3576kb

First Run Input

Alice
2
0 15

First Run Output

32769

Second Run Input

Bob
32769

Second Run Output

2
0 15 

result:

ok correct

Test #5:

score: 100
Accepted
time: 1ms
memory: 3744kb

First Run Input

Alice
10
1 3 5 7 9 11 12 14 15 16

First Run Output

121514

Second Run Input

Bob
121514

Second Run Output

10
1 3 5 7 9 11 12 14 15 16 

result:

ok correct

Test #6:

score: 100
Accepted
time: 1ms
memory: 3520kb

First Run Input

Alice
3
16 17 18

First Run Output

458752

Second Run Input

Bob
458752

Second Run Output

3
16 17 18 

result:

ok correct

Test #7:

score: 100
Accepted
time: 1ms
memory: 3780kb

First Run Input

Alice
18
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 19

First Run Output

655359

Second Run Input

Bob
655359

Second Run Output

18
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 19 

result:

ok correct