# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427287 | model_code | Brackets (CPSPC17_brackets) | C++17 | 227 ms | 3012 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;
const int MN = 201;
vector <pair <int, char> > opening[MN];
vector <pair <int, char> > closing[MN];
char val[128];
typedef long long res_t;
res_t dp[MN][MN];
const res_t inf = 1e18;
set <pair <res_t, pair <int, int> > > dijkstra_queue;
void enque(int start, int end, res_t value) {
if (dp[start][end] > value) {
dijkstra_queue.erase(make_pair(dp[start][end], make_pair(start, end)));
dp[start][end] = value;
dijkstra_queue.insert(make_pair(dp[start][end], make_pair(start, end)));
}
}
int main() {
val['['] = 1;
val[']'] = -1;
val['{'] = 2;
val['}'] = -2;
val['('] = 3;
val[')'] = -3;
val['<'] = 4;
val['>'] = -4;
int n, m, s, t;
scanf("%d%d%d%d", &n, &m, &s, &t);
fprintf(stderr, "n = %d m = %d\n", n, m);
for (int i = 0; i < m; ++i) {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |