# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67340 | MatheusLealV | Match (CEOI16_match) | C++17 | 2058 ms | 39164 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>
#define N 100050
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
int n, v[N];
int qtd[N][30];
string s;
vector<int> pos[N];
char resp[N];
int solve(int l, int r)
{
if(r < l) return 1;
if(r - l == 1)
{
resp[l] = '(', resp[r] = ')';
return (v[l] == v[r]);
}
if(l == r) return 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... |