# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1059534 | vjudge1 | T-Covering (eJOI19_covering) | C++17 | 70 ms | 15580 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 se second
#define fi first
const int ar = 1e6 + 5;
int m, n;
int k;
int x[ar], y[ar];
vector<vector<int>> a;
vector<vector<bool>> check;
vector<vector<bool>> t;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
queue<tuple<int, int, int>> qu;
int ans = 0;
int cnt1 = 0, cnt2 = 0;
void bfs()
{
cnt1 = 0;
cnt2 = 0;
int mi = 1e9;
while(qu.size())
{
auto [u, v, type] = qu.front();
//cout << u << ' ' << v << '\n';
ans += a[u][v];
if (type) cnt1++;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |