oj.uz

Submission #147665

# Submission time Handle Problem Language Result Execution time Memory
147665 2019-08-30T11:30:27 Z JovanK26 Ljetopica (COI19_ljetopica) C++14
14 / 100
 500 ms 4728 KB 
#include <bits/stdc++.h>
#define mod 1000000007
    using namespace std;
    long long n,k;
    string path;
    string a;
    string b;
    long long aval=0;
    long long bval=0;
    long long rez=0;
    bool vis[100000007];
    long long power(int k)
    {
        if(k==0)return 1;
        if(k%2==0)
        {
            return (((power(k/2)%mod)*(power(k/2) %mod))%mod);
        }
        else
        {
            return (((2*(power(k/2)%mod)%mod)*(power(k/2)%mod))%mod);
        }
    }
    void solve(long long start,long long kk,long long nn,bool chk)
    {
        if(nn==path.size())
        {
            if(kk==0 && !vis[start] && start>=aval && start<=bval)
            {
                rez+=start;
                rez%=1000000007;
                vis[start]=1;
                //cout << start << endl;
            }
            return;
        }
        if(kk==0)
        {
            if(!chk)
            {
                if(path[nn]=='L')solve(2*start,kk,nn+1,chk);
                else
                {
                    solve(2*start+1,kk,nn+1,chk);
                }
            }
            else
            {
                if(path[nn]=='R')solve(2*start,kk,nn+1,chk);
                else
                {
                    solve(2*start+1,kk,nn+1,chk);
                }
            }

        }
        else
        {
            if(!chk)
            {
                if(path[nn]=='L')
                {
                    solve(2*start,kk,nn+1,chk);
                    solve(2*start+1,kk-1,nn+1,chk^1);
                }
                else
                {
                    solve(2*start+1,kk,nn+1,chk);
                    solve(2*start,kk-1,nn+1,chk^1);
                }

            }
            else
            {
                if(path[nn]=='R')
                {
                    solve(2*start,kk,nn+1,chk);
                    solve(2*start+1,kk-1,nn+1,chk^1);
                }
                else
                {
                    solve(2*start+1,kk,nn+1,chk);
                    solve(2*start,kk-1,nn+1,chk^1);
                }
            }
        }
    }
    int main()
    {
        cin >> n >> k;
        cin >> path;
        cin >> a;
        cin >> b;
        if(k>0)
        {
            long long br=0;
        for(long long i=a.size()-1;i>=0;i--)
        {
            if(a[i]=='1')aval+=(1<<br);
            br++;
        }
        br=0;
        for(long long i=b.size()-1;i>=0;i--)
        {
            if(b[i]=='1')bval+=(1<<br);
            br++;
        }
           solve(1,k,0,0);
           solve(1,k,0,1);
           cout << rez;
        }
        else
        {
            long long av=0;
            long long bv=0;
            long long br=0;
            for(long long i=a.size()-1;i>=0;i--)
        {
            if(a[i]=='1')
            {
                av+=power(br);
                av%=mod;
            }
            br++;
        }
        br=0;
        for(long long i=b.size()-1;i>=0;i--)
        {
            if(b[i]=='1')
            {
                bv+=power(br);
                bv%=mod;
            }
            br++;
        }
        cout << (av+bv)%mod;
        }
        return 0;
    }

Compilation message

ljetopica.cpp: In function 'void solve(long long int, long long int, long long int, bool)':
ljetopica.cpp:26:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(nn==path.size())
            ~~^~~~~~~~~~~~~

Subtask #1
0 / 8.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 4728 KB Output is correct
2 Correct 16 ms 376 KB Output is correct
3 Correct 237 ms 876 KB Output is correct
4 Correct 238 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 35 ms 1784 KB Output is correct
7 Correct 9 ms 3192 KB Output is correct
8 Correct 244 ms 376 KB Output is correct
9 Correct 16 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 15 ms 1016 KB Output is correct
12 Correct 9 ms 256 KB Output is correct
13 Correct 238 ms 504 KB Output is correct
14 Correct 32 ms 400 KB Output is correct
15 Correct 63 ms 544 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1031 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

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