oj.uz

Submission #147677

# Submission time Handle Problem Language Result Execution time Memory
147677 2019-08-30T11:43:22 Z xDWaffle Ljetopica (COI19_ljetopica) C++11
0 / 100
 2 ms 376 KB 
#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;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -