# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
692145 | vjudge1 | Vlak (COCI20_vlak) | C++17 | 19 ms | 14824 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.
#define taskname "CONC"
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
struct node{
int nxt[26];
int vis[2];
node(){
vis[0]=vis[1]=0;
memset(nxt,-1,sizeof(nxt));
}
};
vector<node>trie;
void add(string s,bool t){
int n=0;
for (auto v:s){
int num=v-'a';
if (trie[n].nxt[num]==-1){
trie[n].nxt[num]=trie.size();
node temp;
trie.push_back(temp);
}
n=trie[n].nxt[num];
trie[n].vis[t]=1;
}
}
int dfs(int u,bool t){
if (trie[u].vis[t]==0)return 0;
int dm=0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |