This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
template <typename T, int sz> using ar = array<T, sz>;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define endl '\n'
vector<int> coin_flips(vector<int> b, int c) {
vector<int> turn;
for(int i = 0; i < 8; i++){
if(c & (1<<i)){
if(b[i] == 0){
turn.pb(i);
}
}
else{
if(b[i]){
turn.pb(i);
}
}
}
if(turn.size() == 0){
turn.pb(0);
turn.pb(0);
}
return turn;
}
int find_coin(vector<int> b) {
int ans = 0;
for(int i = 0; i < 8; i++){
if(b[i] == 1){
ans += (1<<i);
}
}
return ans;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |