Submission #1238109

#	Time	Username	Problem	Language	Result	Execution time	Memory
1238109		al_reem_2010	Coins (IOI17_coins)	C++20	25 / 100	5 ms	584 KiB

coins

// اَللَهُمَ صَلِ عَلَىَ مُحَمَدٍ وَ آلِ مُحَمَدٍ
#include "bits/stdc++.h"
#include "coins.h"
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <thread>
#include <fstream>
#include <stack>
using namespace std ;
//#define int long long
#define pb push_back
#define si size()
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define applejuice ios::sync_with_stdio(false) ; cin.tie(nullptr) ; cout.tie(nullptr) ;
//const int inf=1e18 ;
const int mod=1e9+7 ;
const int maxn=1e5+7 ;
int tt=1 ;
vector<int> coin_flips(vector<int> b , int c)
{
    vector<int> f ;
    int cnt=0 ;
    for(int i=0 ; i<8 ; i++)
    {
        //cout << i << " " << (((1<<i)&c) ? 1 : 0) << " " << b[i] << "\n" ;
        if((((1<<i)&c) && b[i]==0) || (!((1<<i)&c) && b[i]==1))
        {
            //cout << i << "\n" ;
            f.pb(i) ; cnt+=1 ;
        }
    }
    if(cnt==0) {f.pb(63) ;}
    return f ;
}
int find_coin(vector<int> b)
{
    int c=0 ;
    for(int i=0 ; i<8 ; i++)
    {
        if(b[i]==1) {c+=(1<<i) ;}
    }
    return c ;
}
/*signed main()
{
    //wrong
    applejuice ;
    //cin >> tt ;
    //while(tt--) {solve() ;}
    vector<int> b(64,0) ;
    for(int i=0 ; i<64 ; i+=2) {b[i]=1 ;}
    vector<int> f=coin_flips(b,59) ;
    for(int i=0 ; i<f.si ; i++) {b[f[i]]=(b[f[i]]==1 ? 0 : 1) ;}
    cout << find_coin(b) ;
}*/

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