# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1073015 | GTA | T-Covering (eJOI19_covering) | C++17 | 2 ms | 2396 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 int long long
#define vi vector<int>
#define pi pair<int, int>
#define fr(i, m, n) for (int i = m; i <= n; i++)
#define frr(i, m, n) for (int i = m; i >= n; i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define endl '\n'
#define el cout << endl
#define inf 1e18
#define mii map<int, int>
#define pb push_back
#define sz size()
#define pi pair<int, int>
#define vpi vector<pi>
#define si set<int>
int n, m, a, b, c, d, e, x, y, z, w, i, j, qq, k, l, r;
int mi = inf, ma, cnt, ans;
bool id;
string s;
const int N = 1e6 + 5;
vi dx = {0, 0, 1, -1, 1, 1, -1, -1, 0, 0, 2, -2};
vi dy = {1, -1, 0, 0, -1, 1, -1, 1, 2, -2, 0, 0};
vector<array<int, 3>> an;
int vis[N];
map<pi, int>mp;
pi v[N];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |