제출 #1243655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1243655		nvc2k8	Coins (IOI17_coins)	C++20	100 / 100	9 ms	704 KiB

coins

#include <bits/stdc++.h>
#include "coins.h"
#define TASK "askdjasd"
#define endl '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define BIT(i,x) (((i)>>(x))&1)
#define FOR(i,a,b) for(int i = (a); i<=(b); i++)
#define FORD(i,a,b) for(int i = (a); i>=(b); i--)
#define all(C) C.begin(), C.end()
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int INT_LIM = 2147483647;
const ll LL_LIM = 9223372036854775807;
template <typename X> bool minimize(X &x, const X &y) {if (x>y){x = y; return true;}return false;}
template <typename X> bool maximize(X &x, const X &y) {if (x<y){x = y; return true;}return false;}
///------------------------------------------///

vector<int> coin_flips(vector<int> b, int c)
{
    int xsum = 0;
    FOR(i, 0, 63) if (b[i]) xsum^=i;

    vector<int> ans;
    ans.pb(xsum^c);
    return ans;
}

int find_coin(vector<int> b) {
    int ans = 0;
    FOR(i, 0, 63) if (b[i]) ans^=i;
    return ans;
}

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