# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
239934 | Borbi | Skandi (COCI20_skandi) | C++14 | 1464 ms | 43512 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;
/*struct edge
{
int next, to, flow;
edge(int _to, int _next, int _flow)
{
next = _next; to = _to; flow = _flow;
}
};*/
const int MAXN = 5e2 + 5;
const int MAXK = 1e6 + 5;
int n, m;
string str[MAXN];
/*edge e[MAXM];
int head[MAXN], br;
void add_edge(int v, int w, int c)
{
e[br] = edge(w, head[v], c);
head[v] = br++;
}*/
map <int, pair<int, int> > r_a, c_a;
int cntr, cntc;
int rw[MAXN][MAXN], col[MAXN][MAXN];
vector <int> graph[MAXK];
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... |