| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 320359 | daringtrifles | Coins (IOI17_coins) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//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;
}
//#define oi
int main()
{
#ifdef oi
ifstream cin("file.in");
ofstream cout("file.out");
#endif
#ifndef oi
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif
}