Submission #1272858

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272858		chomosuke	Rack (eJOI19_rack)	C++20	40 / 100	6 ms	580 KiB

rack

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>  
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 1000000007;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

void solve(){
   ll n,k;
   cin>>n>>k;
   int act[64];
   memset(act,0,sizeof(act));
   for(int i=62;i>=1;i--){
    if(pow(2,i-1)<k){
        act[i]=1;
        k-=pow(2,i-1);
    }else{
        act[i]=0;
   }
   }
   ll total=1;
   for(int i=1;i<=n;i++){
    if(i>=62){
        total=total*2-1;
        total=total%MOD;
        continue;
    }
    if(act[i]==1){
        total*=2;
        total=total%MOD;
    }else{
        total=total*2-1;
        total=total%MOD;
    }
   }
   cout<<total<<endl;

}
int main()
{
    fast_cin();
    solve();
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 0 / 60