Submission #692583

#	Time	Username	Problem	Language	Result	Execution time	Memory
692583		Xiaoyang	Coins (IOI17_coins)	C++17	0 / 100	7 ms	1212 KiB

coins

#include "coins.h"
#include<bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf (1ll<<60)
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
#define endl "\n"
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll expo(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
 
 
std::vector<int> coin_flips(std::vector<int> b, int c) {
    vector<int>flips(1);
	rep(i,0,8){
		if((1<<i)&c){
			if(b[i]==0)flips.pb(i);
		}else{
			if(b[i]==1)flips.pb(i);
		}
	}
    return flips;
}
int find_coin(std::vector<int> b) {
   ll ret=0;
   rep(i,0,8){
	   if(b[i])ret+=(1<<i);
   }
   return ret;
}

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