제출 #147677

#제출 시각아이디문제언어결과실행 시간메모리
147677xDWaffleLjetopica (COI19_ljetopica)C++11
0 / 100
2 ms376 KiB
#include <bits/stdc++.h> #define ff(j, a, b) for(int j=a;j<b;j++) #define pb push_back; #define MOD 1000000007 using namespace std; typedef long long ll; int n, k; int a, b, path; void load_path() { path=1; ff(j, 0, n-1) { char tmp; cin >> tmp; path=path*2; if(tmp=='R') { path++; } path=path%MOD; } } int bin_string_to_int() { int res=0; ff(j, 0, n) { char c; cin >> c; res=res*2; if(c=='1') { res++; } res=res%MOD; } return res; } int main() { cin >> n >> k; load_path(); a=bin_string_to_int(); b=bin_string_to_int(); cout << (a%MOD+b%MOD)%MOD; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...