# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
441618 | koioi.org-koosaga | Brackets (CPSPC17_brackets) | C++17 | 29 ms | 3652 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 sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int MAXN = 205;
const int mod = 1e9 + 7;
vector<pi> gph[MAXN];
vector<pi> rev[MAXN];
struct node{
int s, e, state;
lint dist;
bool operator<(const node &n)const{
return dist > n.dist;
}
};
lint dp[205][205][5];
int c2i[256];
int n, m, s, t;
int main(){
{
string s = "<>()[]{}";
for(int i = 0; i < 8; i++) c2i[s[i]] = i;
}
scanf("%d %d %d %d",&n,&m,&s,&t);
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... |