| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 307131 |
2020-09-27T07:26:19 Z |
Hemimor |
Rack (eJOI19_rack) |
C++14 |
|
11 ms |
8192 KB |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <random>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
vi vin(int n,int d=0){
vi a(n);
for(auto &i:a){
cin>>i;
i-=d;
}
return a;
}
vl vln(int n,int d=0){
vl a(n);
for(auto &i:a){
cin>>i;
i-=d;
}
return a;
}
vvi gin(int n,int m,int d=1){
vvi g(n);
for(int i=0;i<m;i++){
int u,v;
cin>>u>>v;
u-=d,v-=d;
g[u].push_back(v);
g[v].push_back(u);
}
return g;
}
void vout(vi a){
int n=a.size();
cout<<n<<" :";
for(auto i:a) cout<<' '<<i;
cout<<endl;
}
class Segment_Tree{
private:
int n;
vi date;
public:
Segment_Tree(int n_){
n=1;
while(n<n_) n*=2;
date=vi(2*n-1);
}
void Update(int k,int x){
k+=n-1;
date[k]+=x;
while(k>0){
k=(k-1)/2;
date[k]=date[k*2+1]+date[k*2+2];
}
}
int Query(int a,int b){
a+=n-1;b+=n-1;
int m=0;
while(a<b){
if(a%2==0) m+=date[a++];
if(b%2==0) m+=date[--b];
a/=2;b/=2;
}
return m;
}
int Open(int k){return date[k+n-1];}
};
const int M=1000005;
ll n,k,a[M];
int main(){
a[0]=1;
for(int i=1;i<M;i++) a[i]=a[i-1]*2%mod;
cin>>n>>k;
k--;
ll res=0;
for(int i=0;i<60;i++) if(k&1LL<<i) (res+=a[n-i-1])%=mod;
cout<<res+1<<endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 2 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 3 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 4 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 5 |
Correct |
9 ms |
8192 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 2 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 3 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 4 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 5 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 6 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 7 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 8 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 9 |
Correct |
11 ms |
8192 KB |
Output is correct |
| 10 |
Correct |
9 ms |
8192 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 2 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 3 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 4 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 5 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 6 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 7 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 8 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 9 |
Correct |
11 ms |
8192 KB |
Output is correct |
| 10 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 11 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 12 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 13 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 14 |
Correct |
9 ms |
8192 KB |
Output is correct |
| 15 |
Correct |
9 ms |
8192 KB |
Output is correct |
