QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#771667 | #9246. Dominating Point | gzy | WA | 1ms | 3864kb | C++14 | 728b | 2024-11-22 14:57:56 | 2024-11-22 14:57:56 |
Judging History
answer
#include<bits/stdc++.h>
#define pb emplace_back
using namespace std;
using ll = long long;
const int N = 7;
int i, j, k, n, m, c[N];
bitset<N> f[N];
vector<int> d, v;
signed main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for(i = 1; i <= n; i++) {
string s; cin >> s;
bitset<N> u(s);
f[i] = u;
d.pb(i), c[i] = f[i].count();
}
sort(d.begin(), d.end(), [](int x, int y) {return c[x] > c[y];});
for(int x : d) {
int g = 1;
for(int y : v) {
if((f[y] & f[x]) == f[x]) {
g = 0;
break;
}
}
if(g) v.pb(x);
if(v.size() == 3) break;
}
if(v.size() < 3) cout << "NOT FOUND";
else cout << v[0] << " " << v[1] << " " << v[2];
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3848kb
input:
6 011010 000101 010111 100001 010100 100010
output:
3 1 4
result:
ok OK, Answer correct.
Test #2:
score: 0
Accepted
time: 0ms
memory: 3864kb
input:
3 011 001 000
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #3:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
3 010 001 100
output:
1 2 3
result:
ok OK, Answer correct.
Test #4:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
4994 0100001010011001010101110010101000111101111100100001110010000111100000000100110100101000001010100000010010010110110110111010010010100110100000110110111001010111010111010111011001000101001000010001010111110000000100001100000111100011001010010111011100111010101110011000010111101011111110001111110...
output:
3 4 5
result:
ok OK, Answer correct.
Test #5:
score: 0
Accepted
time: 0ms
memory: 3796kb
input:
4994 0000000110000010100001001010100101010001000000011001110000111011100010100100001001011100000101100000100100001101101101010010110011101100101001100101110010001111110111001101000110111001010011101001010101000000111101101111001011111011000001110010000000110101010010010100100101111111001000111111011...
output:
5 6 7
result:
ok OK, Answer correct.
Test #6:
score: 0
Accepted
time: 1ms
memory: 3632kb
input:
4995 0010100011010011000010101100100000011100110100010101010101000001011110100010001001011001100001111100011010001110011101111001110001000000101010001000010000010001011010010001100001010111011111011011110110000101001000000100000000000010111010101111111100001010001000000001001110000110011001111001111...
output:
2 5 6
result:
ok OK, Answer correct.
Test #7:
score: 0
Accepted
time: 0ms
memory: 3568kb
input:
4998 0011100111111001011100001111010010000111001110101001001011010111100010001110000001000010011011011110001110101111010011000101001101001000100110111110001001100111111000010101010101000110011100011001010110111110000100000010000101001000100011000010101111101101000000101010100111010101111101111100010...
output:
4 7 3
result:
ok OK, Answer correct.
Test #8:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
4994 0010111010011101101110001111100011010010010000101101110110110000100010000101011100000001011100010001000011010101011111100011010000010110000011110010011000101011100011110110011101110000101100111110000110100111001101000100011001001001100001101110001100111011100111001011001011010111111001001000010...
output:
2 3 8
result:
ok OK, Answer correct.
Test #9:
score: 0
Accepted
time: 0ms
memory: 3856kb
input:
1 0
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #10:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
2 01 00
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #11:
score: -100
Wrong Answer
time: 0ms
memory: 3740kb
input:
4998 0101101111101110111110111111111111111101111111010110100111111101110101111101111110101111011111100010111011110100111111111101011101101100110111101110110101101110111011001111101011111101111001111101011111100110111110010011010111101111011010110101011111101011101110111111101101011111010010110101111...
output:
NOT FOUND
result:
wrong output format Expected integer, but "NOT" found