QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#131371 | #6563. Four Square | triplem5ds# | WA | 1ms | 3664kb | C++23 | 2.3kb | 2023-07-27 00:39:34 | 2023-07-27 00:39:35 |
Judging History
answer
/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
#define f(i, a, b) for(int i = a; i < b; i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define popCnt(x) (__builtin_popcountll(x))
#define int ll
using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;
const int N = 1e6 + 5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;
int grid[2005][2005];
vector<ii> vp;
int sum = 0;
int k = 1;
void color(int x1, int y1, int x2, int y2, int c) {
f(i, x1, x2 + 1)f(j, y1, y2 + 1) grid[i][j] = c;
}
bool check(int x1, int y1, int x2, int y2) {
if (x2 > k || y2 > k)return false;
f(i, x1, x2 + 1)f(j, y1, y2 + 1)if (grid[i][j])return false;
return true;
}
bool bt(int mask) {
if (mask == 15)return true;
int x = 0, y = 0;
for (int i = 1; i <= k && !x; i++) {
for (int j = 1; j <= k && !x; j++) {
if (!grid[i][j]) {
x = i;
y = j;
}
}
}
f(i, 0, 4) if (mask >> i & 1 ^ 1) {
if (check(x, y, x + vp[i].F - 1, y + vp[i].S - 1)) {
color(x, y, x + vp[i].F - 1, y + vp[i].S - 1, i);
if (bt(mask | (1 << i)))
return true;
color(x, y, x + vp[i].F - 1, y + vp[i].S - 1, 0);
}
}
return false;
}
void doWork() {
vp.resize(4);
f(i, 0, 4) {
cin >> vp[i].F >> vp[i].S;
sum += vp[i].F * vp[i].S;
}
while (k * k < sum)k += 1;
if (k * k != sum) {
cout << "0\n";
return;
}
f(m, 0, 1 << 4) {
f(i, 0, 4)if (m >> i & 1)swap(vp[i].F, vp[i].S);
if (bt(0)) {
cout << "1\n";
return;
}
f(i, 0, 4)if (m >> i & 1)swap(vp[i].F, vp[i].S);
}
cout << "0\n";
}
int32_t main() {
#ifdef ONLINE_JUDGE
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif // ONLINE_JUDGE
int t = 1;
// cin >> t;
while (t--) {
doWork();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3644kb
input:
1 1 1 1 1 1 1 1
output:
1
result:
ok single line: '1'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3508kb
input:
3 1 3 3 2 2 3 3
output:
0
result:
ok single line: '0'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
2 8 2 8 2 8 2 8
output:
1
result:
ok single line: '1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3516kb
input:
5 3 5 5 3 3 3 5
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 1ms
memory: 3532kb
input:
1 2 4 8 16 32 64 128
output:
0
result:
ok single line: '0'
Test #6:
score: -100
Wrong Answer
time: 1ms
memory: 3344kb
input:
4 4 2 1 4 4 2 1
output:
1
result:
wrong answer 1st lines differ - expected: '0', found: '1'