Submission #144805

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
144805	2019-08-17 19:59:57	emilem	Ljetopica (COI19_ljetopica)	C++14	100 / 100	251 ms	63352 KiB

ljetopica

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <set>
using namespace std;
const long long mod = 1000000007;
long long n, k;
string path, a, b;
vector<long long> pow2(2000);
long long dp[1005][1005][2][2], cnt[1005][1005][2][2];
void Add(long long depth, long long steps, long long ok, long long atBound, long long depth2, long long steps2, long long ok2, long long atBound2, char dir)
{
  if (max(depth, depth2) > n || max(steps, steps2) > k)
    return;
  if (depth == 2 && steps == 0 && ok == 0 && atBound == 1)
    cerr << "";
  dp[depth][steps][ok][atBound] += 2 * dp[depth2][steps2][ok2][atBound2];
  if (dir == 'R')
    dp[depth][steps][ok][atBound] += cnt[depth2][steps2][ok2][atBound2];
  dp[depth][steps][ok][atBound] %= mod;
  cnt[depth][steps][ok][atBound] += cnt[depth2][steps2][ok2][atBound2];
  cnt[depth][steps][ok][atBound] %= mod;
}
long long Solve(string bound)
{
  for (long long depth = 1; depth <= n; ++depth)
    for (long long steps = 0; steps <= k; ++steps)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

ljetopica.cpp: In function 'int main()':
ljetopica.cpp:103:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (long long i = 1; i < pow2.size(); ++i)
                        ~~^~~~~~~~~~~~~
ljetopica.cpp:112:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (long long i = 0; i < a.length(); ++i)
                        ~~^~~~~~~~~~~~
ljetopica.cpp:118:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (i + 1 == a.length())
        ~~~~~~^~~~~~~~~~~~~
ljetopica.cpp:125:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (long long i = 0; i < a.length(); ++i)
                        ~~^~~~~~~~~~~~
ljetopica.cpp:127:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (long long i = 0; i < b.length(); ++i)
                        ~~^~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 14 / 14
• Subtask 3: 17 / 17
• Subtask 4: 61 / 61