QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#178697 | #6563. Four Square | neko_nyaa | RE | 0ms | 0kb | C++20 | 1.5kb | 2023-09-14 11:17:00 | 2023-09-14 11:17:01 |
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
int get_height(vector<pair<int, int>> a, int side) {
int ans1 = 0, ans2 = 0;
for (auto [x, y]: a) {
if (x == a[0].first) {
ans1 += y;
} else if (y == a[0].first) {
ans1 += x;
}
if (x == a[0].second) {
ans2 += y;
} else if (y == a[0].second) {
ans2 += x;
}
}
if (ans1 == side) return a[0].first;
if (ans2 == side) return a[0].second;
return -1;
}
void dfs(int msk, vector<pair<int, int>> a, int s1, int s2) {
if (s1 < 0 || s2 < 0) return;
if (msk == 15) {
if (s1 == 0 && s2 == 0) {
cout << "1\n";
exit(0);
}
}
for (int i = 0; i < 15; i++) {
if ((msk & i) != 0) continue;
vector<pair<int, int>> pp;
for (int j = 0; j < 4; j++) {
if (i & (1 << j)) pp.push_back(a[j]);
}
int h1 = get_height(pp, s1);
if (h1 != -1) {
dfs(msk | i, a, s1, s2-h1);
}
int h2 = get_height(pp, s2);
if (h2 != -1) {
dfs(msk | i, a, s1-h2, s2);
}
}
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
vector<pair<int, int>> a(4);
for (int i = 0; i < 4; i++) {
cin >> a[i].first >> a[i].second;
}
int area = 0;
for (auto [x, y]: a) {
area += x*y;
}
int side = sqrtl(area);
if (side*side != area) {
cout << "0\n";
return 0;
}
for (auto [x, y]: a) {
if (x > side || y > side) {
cout << "0\n";
return 0;
}
}
dfs(0, a, side, side);
cout << "0\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Runtime Error
input:
1 1 1 1 1 1 1 1