# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850955 | Cyanmond | Pick (COI18_pick) | C++17 | 19 ms | 600 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 rep(i, l, r) for (int i = (l); i < (r); ++i)
#define per(i, l, r) for (int i = (r - 1); i >= l; --i)
#define ALL(x) (x).begin(), (x).end()
using i64 = long long;
void main_() {
i64 A, B, C, D;
cin >> A >> B >> C >> D;
vector<pair<int, int>> ans;
rep(a1, 0, A + 1) {
i64 a2 = A - a1;
rep(b1, 0, B + 1) {
i64 b2 = B - b1;
rep(c1, 0, C + 1) {
i64 c2 = C - c1;
i64 xsum = a1 - a2 + c1 - c2;
i64 ysum = b1 - b2 + c1 - c2;
if (xsum + ysum != 0) continue;
rep(d1, 0, D + 1) {
i64 d2 = D - d1;
if (xsum + d1 - d2 != 0 or ysum + d2 - d1 != 0) continue;
// loop : O(n^2)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |