Submission #1099872

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1099872	2024-10-12 05:40:33	model_code	Hieroglyphs (IOI24_hieroglyphs)	C++17	0 / 100	847 ms	2097152 KiB

hieroglyphs

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
// time_limit/agustin-heuristic.cpp
//#include "hieroglyphs.h"
#include <iostream>
#include <vector>
using namespace std;
#define forn(i,n) for (int i=0;i<int(n);i++)
#define dforn(i,n) for (int i=int(n)-1;i>=0;i--)
#define SIZE(c) int((c).size())
const int MAX_NUM = 200000;
vector<int> aIndex[MAX_NUM];
vector<int> bIndex[MAX_NUM];
vector<int> lcs(const vector<int> &A, const vector<int> &B, bool maximizing)
{
  const int N = SIZE(A);
  const int M = SIZE(B);
  vector<vector<int>> dp(N+1, vector<int>(M+1));
  forn(j,M+1)
    dp[0][j] = 0;
  forn(i,N+1)
    dp[i][0] = 0;
  dforn(i,N)
  dforn(j,M)
  if (A[i] == B[j])
    dp[i][j] = 1 + dp[i+1][j+1];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 0: 0 / 0
• Subtask 1: 0 / 3
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 16
• Subtask 5: 0 / 14
• Subtask 6: 0 / 42