# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223435 | errorgorn | Matching (COCI20_matching) | C++14 | 27 ms | 39808 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 ll long long
#define ii pair<ll,ll>
#define iii pair<ll,ii>
#define endl '\n'
const int INF=1000000000;
int lastused[300005][26];
int edges[300005][26];
int backedge[300005];
int len[300005];
int n;
string s;
vector<int> al[50005];
int parent[50005][15];
int level[50005]; //depth idk why i used to call it level
int in[50005];
int out[50005];
int DFS_TIME=0;
void dfs(int i,int p){
in[i]=++DFS_TIME;
int curr;
for (auto it=al[i].begin();it!=al[i].end();it++){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |