QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#131372#6563. Four Squaretriplem5ds#AC ✓66ms34800kbC++232.3kb2023-07-27 00:40:292023-07-27 00:40:30

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-27 00:40:30]
  • 评测
  • 测评结果:AC
  • 用时:66ms
  • 内存:34800kb
  • [2023-07-27 00:40:29]
  • 提交

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 + 1);
                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();
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3480kb

input:

1 1
1 1
1 1
1 1

output:

1

result:

ok single line: '1'

Test #2:

score: 0
Accepted
time: 1ms
memory: 3616kb

input:

3 1
3 3
2 2
3 3

output:

0

result:

ok single line: '0'

Test #3:

score: 0
Accepted
time: 1ms
memory: 3496kb

input:

2 8
2 8
2 8
2 8

output:

1

result:

ok single line: '1'

Test #4:

score: 0
Accepted
time: 1ms
memory: 3504kb

input:

5 3
5 5
3 3
3 5

output:

1

result:

ok single line: '1'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3536kb

input:

1 2
4 8
16 32
64 128

output:

0

result:

ok single line: '0'

Test #6:

score: 0
Accepted
time: 1ms
memory: 3444kb

input:

4 4
2 1
4 4
2 1

output:

0

result:

ok single line: '0'

Test #7:

score: 0
Accepted
time: 7ms
memory: 8228kb

input:

995 51
559 565
154 536
56 780

output:

0

result:

ok single line: '0'

Test #8:

score: 0
Accepted
time: 22ms
memory: 10504kb

input:

391 694
540 42
240 937
691 246

output:

0

result:

ok single line: '0'

Test #9:

score: 0
Accepted
time: 43ms
memory: 11748kb

input:

519 411
782 710
299 45
21 397

output:

0

result:

ok single line: '0'

Test #10:

score: 0
Accepted
time: 7ms
memory: 8340kb

input:

96 960
948 18
108 82
371 576

output:

0

result:

ok single line: '0'

Test #11:

score: 0
Accepted
time: 1ms
memory: 3484kb

input:

3 2
4 3
3 1
1 4

output:

0

result:

ok single line: '0'

Test #12:

score: 0
Accepted
time: 1ms
memory: 3444kb

input:

4 3
1 2
4 4
3 2

output:

0

result:

ok single line: '0'

Test #13:

score: 0
Accepted
time: 1ms
memory: 3664kb

input:

4 4
1 3
5 4
2 5

output:

0

result:

ok single line: '0'

Test #14:

score: 0
Accepted
time: 9ms
memory: 34800kb

input:

1000 1000
1000 1000
1000 1000
1000 1000

output:

1

result:

ok single line: '1'

Test #15:

score: 0
Accepted
time: 66ms
memory: 34708kb

input:

1000 999
998 1000
997 1000
997 997

output:

1

result:

ok single line: '1'

Test #16:

score: 0
Accepted
time: 1ms
memory: 3520kb

input:

1 3
3 3
3 3
4 7

output:

1

result:

ok single line: '1'

Test #17:

score: 0
Accepted
time: 1ms
memory: 3488kb

input:

2 5
5 4
7 1
6 2

output:

1

result:

ok single line: '1'

Test #18:

score: 0
Accepted
time: 1ms
memory: 3556kb

input:

12 2
12 7
7 12
16 4

output:

1

result:

ok single line: '1'

Test #19:

score: 0
Accepted
time: 1ms
memory: 3484kb

input:

7 2
2 14
5 14
7 12

output:

1

result:

ok single line: '1'

Test #20:

score: 0
Accepted
time: 1ms
memory: 3624kb

input:

32 36
5 1
1 37
35 5

output:

1

result:

ok single line: '1'

Test #21:

score: 0
Accepted
time: 1ms
memory: 3664kb

input:

28 30
30 1
31 1
2 30

output:

1

result:

ok single line: '1'

Test #22:

score: 0
Accepted
time: 1ms
memory: 3988kb

input:

66 68
9 11
7 66
9 64

output:

1

result:

ok single line: '1'

Test #23:

score: 0
Accepted
time: 1ms
memory: 3852kb

input:

59 44
25 44
40 32
40 52

output:

1

result:

ok single line: '1'

Test #24:

score: 0
Accepted
time: 1ms
memory: 3624kb

input:

4 4
2 3
4 2
3 2

output:

1

result:

ok single line: '1'