Submission #620078

#	Time	Username	Problem	Language	Result	Execution time	Memory
620078		nohaxjustsoflo	Coins (IOI17_coins)	C++17	100 / 100	9 ms	1568 KiB

coins

#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen; ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN=3e5+5;
const int mod=998244353;
const int mxlogN=20;
const int mxK=26;
const int inf=2e9;
const int K=600;
#include "coins.h"
vector<int> coin_flips(vector<int> b, int c)
{
    int xr=c;
    for(int i=0; i<64; i++) if(b[i]) xr^=i;
    return {xr};
}

int find_coin(vector<int> b)
{
    int xr=0;
    for(int i=0; i<64; i++) if(b[i]) xr^=i;
    return xr;
}

/*
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n; cin >> n;
    for(int i=0; i<n; i++) dp[0][i]=dp[1][i]=-1;
    for(int i=1; i<n; i++)
    {
        int u,v; cin >> u >> v; u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    cin >> s;
    cout << solve(0,0,0) << "\n";
}
*/

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