제출 #320361

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
320361		daringtrifles	Coins (IOI17_coins)	C++17	0 / 100	9 ms	1456 KiB

coins

//control+option+n to run!
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define FOR(i, a, b) for (signed long long i = (signed long long)(a); i < (signed long long)(b); i++)
#define NEGFOR(i, a, b) for (ll i = (a); i > (b); i--)
#define vll vector<long long>
#define sll set<long long>
#define ld long double
#define inf 1000000000000000000
#define mll multiset<long long>
#define vpll vector<pll>
#define nn << "\n"
#define ss << " "
#define F(i, b) for (ll i = 0; i < b; i++)
//10^8 operations per second
//greatest int is 2,147,483,647
//greates long long is 9.22337204e18

//ALL FUNCTIONS SHOULD BE LL!!!!
vector<int> coin_flips(vector<int> b, int c){
    ll x=-1;
    FOR(i,0,b.size()){
        if (x==-1&&b[i]) x=i;
        if (x!=-1 && b[i]) x^=i; 
    }
    vector <int> v(1);
    v[0]=c^x;
    return v;
}
 
int find_coin(vector<int> b){
    ll x=-1;
    FOR(i,0,b.size()){
        if (x==-1&&b[i]) x=i;
        if (x!=-1 && b[i]) x^=i; 
    }
    return x;
}

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