제출 #798252

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
798252		hgmhc	Coins (IOI17_coins)	C++17	10 / 100	7 ms	1552 KiB

coins

#include "coins.h"
#include <bits/stdc++.h>
using namespace std; using ii = pair<int,int>; using ll = long long; using vi = vector<int>;
#define rep(i,a,b) for (auto i = (a); i <= (b); ++i)
#define per(i,a,b) for (auto i = (b); i >= (a); --i)
#define all(x) begin(x), end(x)
#define siz(x) int((x).size())
#define Mup(x,y) x = max(x,y)
#define mup(x,y) x = min(x,y)
#define fi first
#define se second
#define dbg(...) fprintf(stderr,__VA_ARGS__)

vi coin_flips(vi b, int c) {
    vi flips;
    switch ((b[0]^b[1])+(b[1]^b[2])) {
    case 0:
        if (c == 0) flips.push_back(3);
        if (c == 1) flips.push_back(0);
        if (c == 2) flips.push_back(1);
        break;
    case 1:
        if (c == 0) flips.push_back((b[0]^b[1]) ? 0 : 2);
        if (c == 1) flips.push_back(3);
        if (c == 2) flips.push_back((b[0]^b[1]) ? 2 : 0);
        break;
    case 2:
        if (c == 0) flips.push_back(1);
        if (c == 1) flips.push_back(2);
        if (c == 2) flips.push_back(3);
        break;
    }
    return flips;
}

int find_coin(vi b) {
    return __builtin_popcount((b[0]^b[1])+(b[1]^b[2]));
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 15
• Subtask 5: 0 / 50