QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #239430 | #6563. Four Square | peddap# | WA | 0ms | 3696kb | C++14 | 1.7kb | 2023-11-04 20:39:36 | 2023-11-04 20:39:37 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define ll long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin() , (x).end()
using namespace std;
int l , w, n;
vector<pair<int,int>> a, b;
bool solve(){
n = a.size();
if(n == 0) return true;
if(n == 1) return false;
int p = 1; for(int i = 0 ; i < n; i++) p *= 2;
sort(all(a));
do{
b = a;
//cout << b.size() << endl;
for(int i = 0 ; i < p ; i++){
for(int j = 0; j < n; j++){
if( i & (1 << j) ) swap(b[j].ff , b[j].ss);
}
if(n == 2){
if(b[0].ff + b[1].ff == l && b[1].ss == w && b[0].ss == w) return true;
}
else if (n == 3){
if(b[0].ff + b[1].ff == l && b[1].ss == w && b[1].ff + b[2].ff == l && b[2].ss + b[0].ss == w ) return true;
}
else if(b[0].ff + b[1].ff == l && b[1].ss + b[2].ff == w && b[2].ss + b[3].ff == l && b[3].ss + b[0].ss == w ) return true;
}
}while(next_permutation(all(a)));
return false;
}
vector<pair<int,int>> v(4);
int32_t main() {
int s = 0;
for(int i = 0 ; i < 4; i++){
cin>>v[i].ff>>v[i].ss;
s += v[i].ff * v[i].ss;
//cout << v[i].ff << " " << v[i].ss << endl;
}
if((int)sqrt(s) != sqrt(s)){
cout << 0 << endl; return 0;
}
//cout << "here\n" ;
s = sqrt(s);
l = w = s;
for(int i = 0 ; i < 4 ; i++){
if(v[i].ff == s ){
w -= v[i].ss; continue;
}
if(v[i].ss == s){
w -= v[i].ff; continue;
}
a.pb(v[i]);
}
cout << solve() << endl;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3692kb
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: 3500kb
input:
2 8 2 8 2 8 2 8
output:
1
result:
ok single line: '1'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
5 3 5 5 3 3 3 5
output:
1
result:
ok single line: '1'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
1 2 4 8 16 32 64 128
output:
0
result:
ok single line: '0'
Test #6:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
4 4 2 1 4 4 2 1
output:
0
result:
ok single line: '0'
Test #7:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
995 51 559 565 154 536 56 780
output:
0
result:
ok single line: '0'
Test #8:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
391 694 540 42 240 937 691 246
output:
0
result:
ok single line: '0'
Test #9:
score: 0
Accepted
time: 0ms
memory: 3504kb
input:
519 411 782 710 299 45 21 397
output:
0
result:
ok single line: '0'
Test #10:
score: 0
Accepted
time: 0ms
memory: 3536kb
input:
96 960 948 18 108 82 371 576
output:
0
result:
ok single line: '0'
Test #11:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
3 2 4 3 3 1 1 4
output:
0
result:
ok single line: '0'
Test #12:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
4 3 1 2 4 4 3 2
output:
0
result:
ok single line: '0'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
4 4 1 3 5 4 2 5
output:
0
result:
ok single line: '0'
Test #14:
score: 0
Accepted
time: 0ms
memory: 3696kb
input:
1000 1000 1000 1000 1000 1000 1000 1000
output:
1
result:
ok single line: '1'
Test #15:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
1000 999 998 1000 997 1000 997 997
output:
1
result:
ok single line: '1'
Test #16:
score: -100
Wrong Answer
time: 0ms
memory: 3604kb
input:
1 3 3 3 3 3 4 7
output:
0
result:
wrong answer 1st lines differ - expected: '1', found: '0'