이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define int long long
using namespace std;
const long long oo = 1000000000000000000;
long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos;
/*
ViHHiPuh
(( `'-""``""-'` ))
)-__-_.._-__-(
/ --- (o _ o) --- \
\ .-* ( .0. ) *-. /
_'-. ,_ '=' _, .-'_
/ `;#'#'# - #'#'#;` \
\_)) -----'#'----- ((_/
# --------- #
'# ------- ------ #'
/..-'# ------- #'-.\
_\...-\'# -- #'/-.../_
((____)- '#' -(____))
cout << fixed << setprecision(6) << x;
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
freopen ( "sum.in", "r", stdin )
*/
int n, a[ 100001 ], b[ 100001 ];
vector <int> v, vans;
main () {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
for ( int i = 0; i < n; i ++ )
cin >> a[ i ];
for ( int j = 0; j < n; j ++ )
cin >> b[ j ];
for ( int mask = 1; mask < ( 1 << n ); mask ++ ) {
pos = -1;
ans = num = 0;
v.clear();
for ( int i = 0; i < n; i ++ ) {
if ( ( mask & ( 1 << i ) ) ) {
if ( pos == -1 ) {
pos = i;
}
else {
num ++;
if ( __builtin_popcount( ( a[ i ] & a[ pos ] ) ) != b[ num ] ) {
ans = 1;
break;
}
pos = i;
}
v.push_back( i + 1 );
}
}
if ( !ans ) {
if ( vans.size() < v.size() )
vans = v;
}
}
cout << vans.size() << "\n";
for ( auto i : vans )
cout << i << " ";
}
컴파일 시 표준 에러 (stderr) 메시지
subsequence.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
49 | main () {
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |