제출 #1232414

#제출 시각아이디문제언어결과실행 시간메모리
1232414countlessCoins (IOI17_coins)C++20
100 / 100
9 ms748 KiB
#include "coins.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

#define sp <<" "<<
#define endl "\n"

inline int array_xor(const vector<int> &a) {
    int n = a.size();
    int res = 0;
    for (int i = 0; i < n; i++) {
        if (a[i]) res ^= i;
    }
    return res;
}

vector<int> coin_flips(vector<int> b, int c) {
    vector<int> flips = {c ^ array_xor(b)};
    return flips;
}

int find_coin(vector<int> b) {
    return array_xor(b);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...