# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1045554 | javotaz | Dabbeh (INOI20_dabbeh) | C++17 | 369 ms | 53072 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.
// In the Name of Allah
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,avx,avx2,sse4.2,popcnt,tune=native")
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
#define pp pop_back
#define all(x) x.begin(), x.end()
const int N = 3e5 + 7, M = 1e4 + 7, K = 5e5 + 7;
string s, a[M];
int n, q, dp[N], c, t[K][26];
void add(int id) {
int p = 0;
for (int i = 0; i < a[id].size(); i++) {
if (!t[p][a[id][i] - 'a'])
t[p][a[id][i] - 'a'] = ++c;
p = t[p][a[id][i] - 'a'];
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |