# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
464404 | tengiz05 | T-Covering (eJOI19_covering) | C++17 | 139 ms | 20072 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 i64 = long long;
std::vector<std::pair<int, int>> dir{{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
void ohNo() {
std::cout << "No\n";
exit(0);
}
struct Component {
int sum, size;
int have, mn;
Component() : sum(0), size(0), have(0), mn(1e9) {}
void add_adj(int x) {
sum += x;
have++;
mn = std::min(mn, x);
}
int ans() {
if (size * 3 > have) {
ohNo();
}
return sum - (have - size * 3) * mn;
}
};
int main() {
std::ios::sync_with_stdio(false);
# | 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... |