QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#413055#6563. Four SquareLspeed#AC ✓0ms3800kbC++146.4kb2024-05-17 01:25:132024-05-17 01:25:13

Judging History

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

  • [2024-05-17 01:25:13]
  • 评测
  • 测评结果：AC
  • 用时：0ms
  • 内存：3800kb
查看
  • [2024-05-17 01:25:13]
  • 提交

answer

#include <iostream>     // Input/output stream objects
#include <fstream>      // File stream objects
#include <sstream>      // String stream objects
#include <iomanip>      // Input/output manipulators
#include <string>       // String class and functions
#include <vector>       // Dynamic array
#include <list>         // Doubly linked list
#include <set>          // Set container
#include <map>          // Map container
#include <queue>        // Queue container
#include <stack>        // Stack container
#include <algorithm>    // Algorithms on sequences (e.g., sort, find)
#include <cmath>        // Mathematical functions
#include <climits>      // LLONG_MAX, LLONG_MIN
#include <ctime>        // Date and time functions
#include <cstdlib>      // General purpose functions (e.g., memory management)
#include <cstring>      // C-style string functions
#include <cctype>       // Character classification functions
#include <cassert>      // Assert function for debugging
#include <exception>    // Standard exceptions
#include <functional>   // Function objects
#include <iterator>     // Iterator classes
#include <limits>       // Numeric limits
#include <locale>       // Localization and internationalization
#include <numeric>      // Numeric operations (e.g., accumulate)
#include <random>       // Random number generators
#include <stdexcept>    // Standard exception classes
#include <typeinfo>     // Runtime type information
#include <utility>      // Utility components (e.g., std::pair)
#include <bitset>

using namespace std;

#define FOR(i, a, b) for(int i = a; i < (b); i++)
#define FORE(i, a, b) for(int i = a; i <= (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define x first 
#define y second
#define mp make_pair
#define PI 3.141592653
#define compress(coord) sort(all(coord)), coord.resize(unique(all(coord)) - coord.begin())
const double eps = 1e-9; // x < eps (x <= 0) x < -eps (x < 0)
const ll inf = LLONG_MAX;

struct rec {
    int w, h; 
    rec (int w, int h) : w(w), h(h) {}
    void rotate() { swap(w, h); }
    bool operator==(rec r) { return w == r.w && h == r.h; }
};

vector<rec> recs;
int suma;
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
    FOR (i, 0, 4) {
        int tw, th;
        cin >> tw >> th;
        suma += tw * th;
        recs.push_back(rec(tw, th));
    }

    int side = sqrt(suma);
    if (side * side != suma) {
        cout << 0 << endl;
        return 0;
    } 

    for (rec cr: recs) if (cr.w > side || cr.h > side) {
        cout << 0 << endl;
        return 0;
    }

    FOR (rot, 0, 16) {
        vector<rec> crec(recs);
        FOR (i, 0, 4) if ((1 << i) & rot) crec[i].rotate();
        vector<int> ord {0, 1, 2, 3};
        do {
            int sumw = crec[ord[0]].w + crec[ord[1]].w, sumh = crec[ord[0]].h + crec[ord[1]].h;
            if (sumw == side && sumh >= side) {
                if (crec[ord[0]].h == side) {
                    if (crec[ord[2]].w == crec[ord[3]].w && crec[ord[3]].w == crec[ord[1]].w && crec[ord[2]].h + crec[ord[3]].h + crec[ord[1]].h == side)  {
                        cout << 1 << endl;
                        return 0;
                    }
                    else if (crec[ord[2]].h == crec[ord[3]].h && crec[ord[3]].h == side - crec[ord[1]].h && crec[ord[2]].w + crec[ord[3]].w == crec[ord[1]].w) {
                        cout << 1 << endl;
                        return 0;
                    }
                }
                else if (crec[ord[1]].h == side) {
                    if (crec[ord[2]].w == crec[ord[3]].w && crec[ord[3]].w == crec[ord[0]].w && crec[ord[2]].h + crec[ord[3]].h + crec[ord[0]].h == side) {
                        cout << 1 << endl;
                        return 0;
                    }
                    else if (crec[ord[2]].h == crec[ord[3]].h && crec[ord[3]].h == side - crec[ord[0]].h && crec[ord[2]].w + crec[ord[3]].w == crec[ord[0]].w) {
                        cout << 1 << endl;
                        return 0;
                    }
                }
                else {
                    if (crec[ord[2]] == rec(crec[ord[1]].w, side - crec[ord[1]].h) && crec[ord[3]] == rec(crec[ord[0]].w, side - crec[ord[0]].h)) {
                        cout << 1 << endl;
                        return 0;
                    }
                }
            }
            else if (sumh == side && sumw >= side) {
                if (crec[ord[0]].w == side) {
                    if (crec[ord[2]].h == crec[ord[3]].h && crec[ord[3]].h == crec[ord[1]].h && crec[ord[2]].w + crec[ord[3]].w + crec[ord[1]].w == side) {
                        cout << 1 << endl;
                        return 0;
                    }
                    else if (crec[ord[2]].w == crec[ord[3]].w && crec[ord[3]].w == side - crec[ord[1]].w && crec[ord[2]].h + crec[ord[3]].h == crec[ord[1]].h) {
                        cout << 1 << endl;
                        return 0;
                    }
                }
                else if (crec[ord[1]].w == side) {
                    if (crec[ord[2]].h == crec[ord[3]].h && crec[ord[3]].h == crec[ord[0]].h && crec[ord[2]].w + crec[ord[3]].w + crec[ord[0]].w == side) {
                        cout << 1 << endl;
                        return 0;
                    }
                    else if (crec[ord[2]].w == crec[ord[3]].w && crec[ord[3]].w == side - crec[ord[0]].w && crec[ord[2]].h + crec[ord[3]].h == crec[ord[0]].h) {
                        cout << 1 << endl;
                        return 0;
                    }
                }               
                else {
                    if (crec[ord[2]] == rec(side - crec[ord[0]].w, crec[ord[0]].h) && crec[ord[3]] == rec(side - crec[ord[1]].w, crec[ord[1]].h)) {
                        cout << 1 << endl;
                        return 0;
                    }
                }
            }
            else if (sumw <= side && crec[ord[0]].h == side && crec[ord[1]].h == side) {
                if (sumw + crec[ord[2]].w + crec[ord[3]].w == side && crec[ord[2]].h == side && crec[ord[3]].h == side) {
                    cout << 1 << endl;
                    return 0;
                }
                else if (sumw + crec[ord[2]].w == side && crec[ord[2]].w == crec[ord[3]].w && crec[ord[2]].h + crec[ord[3]].h == side) {
                    cout << 1 << endl;
                    return 0;
                }
            }
        } while (next_permutation(all(ord)));
    }   
    cout << 0 << endl;
    return 0;
}
Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

1 1
1 1
1 1
1 1

output:

1

result:

ok single line: '1'

Test #2:

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

input:

3 1
3 3
2 2
3 3

output:

0

result:

ok single line: '0'

Test #3:

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

input:

2 8
2 8
2 8
2 8

output:

1

result:

ok single line: '1'

Test #4:

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

input:

5 3
5 5
3 3
3 5

output:

1

result:

ok single line: '1'

Test #5:

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

input:

1 2
4 8
16 32
64 128

output:

0

result:

ok single line: '0'

Test #6:

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

input:

4 4
2 1
4 4
2 1

output:

0

result:

ok single line: '0'

Test #7:

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

input:

995 51
559 565
154 536
56 780

output:

0

result:

ok single line: '0'

Test #8:

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

input:

391 694
540 42
240 937
691 246

output:

0

result:

ok single line: '0'

Test #9:

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

input:

519 411
782 710
299 45
21 397

output:

0

result:

ok single line: '0'

Test #10:

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

input:

96 960
948 18
108 82
371 576

output:

0

result:

ok single line: '0'

Test #11:

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

input:

3 2
4 3
3 1
1 4

output:

0

result:

ok single line: '0'

Test #12:

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

input:

4 3
1 2
4 4
3 2

output:

0

result:

ok single line: '0'

Test #13:

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

input:

4 4
1 3
5 4
2 5

output:

0

result:

ok single line: '0'

Test #14:

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

input:

1000 1000
1000 1000
1000 1000
1000 1000

output:

1

result:

ok single line: '1'

Test #15:

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

input:

1000 999
998 1000
997 1000
997 997

output:

1

result:

ok single line: '1'

Test #16:

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

input:

1 3
3 3
3 3
4 7

output:

1

result:

ok single line: '1'

Test #17:

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

input:

2 5
5 4
7 1
6 2

output:

1

result:

ok single line: '1'

Test #18:

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

input:

12 2
12 7
7 12
16 4

output:

1

result:

ok single line: '1'

Test #19:

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

input:

7 2
2 14
5 14
7 12

output:

1

result:

ok single line: '1'

Test #20:

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

input:

32 36
5 1
1 37
35 5

output:

1

result:

ok single line: '1'

Test #21:

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

input:

28 30
30 1
31 1
2 30

output:

1

result:

ok single line: '1'

Test #22:

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

input:

66 68
9 11
7 66
9 64

output:

1

result:

ok single line: '1'

Test #23:

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

input:

59 44
25 44
40 32
40 52

output:

1

result:

ok single line: '1'

Test #24:

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

input:

4 4
2 3
4 2
3 2

output:

1

result:

ok single line: '1'
English 繁體中文 简体中文

Server Time: 2024-12-03 17:26:20 | OpenSource Project