# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633506 | MatBad | Dabbeh (INOI20_dabbeh) | C++14 | 270 ms | 52616 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i=a; i<=b; i++)
#define FORR(i, a, b) for(int i=a; i>=b; i--)
#define pb push_back
#define ppb pop_back
#define lc 2*u
#define rc 2*u+1
#define mid ((l+r)/2)
#define F first
#define S second
#define debug(x) cerr<<"$ "<<#x<<" : "<<x<<"$\n"
#define wall() cerr<<"\n----------------------\n"
typedef long long ll;
typedef pair<int, int> pii;
const ll MX=505, M=5e5+5, LG=19, inf=1e9+5, MOD=1e9+7, A=27;
int m, n, tr[M][A], N, dp[MX][MX];
string s;
void add(string& t){
int v=0;
FOR(i, 0, (int)t.size()-1){
if(!tr[v][t[i]-'a']) tr[v][t[i]-'a'] = ++N;
v = tr[v][t[i]-'a'];
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |