제출 #829594

#제출 시각아이디문제언어결과실행 시간메모리
829594MODDICoins (IOI17_coins)C++14
0 / 100
6 ms1336 KiB
#include "coins.h" #include <bits/stdc++.h> //#include "grader.cpp" using namespace std; #define pb push_back #define mp make_pair typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vl; std::vector<int> coin_flips(std::vector<int> b, int c) { int x = 0; for(int i = 0; i < (int)b.size(); i++){ if(b[i]) x ^= i; } int flip = 0; for(int i = 0; i < 6; i++){ int g = (x & 1), d = (c & 1); if(g != d) flip ^= (1 << i); } return {flip}; } int find_coin(std::vector<int> b) { int x = 0; for(int i = 0; i < (int)b.size(); i++){ if(b[i]) x ^= i; } return x; }
#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...