QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #771332 | #9246. Dominating Point | shenyibin | TL | 158ms | 6916kb | C++14 | 678b | 2024-11-22 11:49:48 | 2024-11-22 11:49:49 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int n;
vector <int> ans;
char s[5010];
bitset <5001> f[5001], tmp;
int main(){
scanf ("%d", &n);
for (int i=1; i<=n; i++){
scanf ("%s", s+1);
for (int j=1; j<=n; j++){
if (s[j] == '1') f[i][j] = 1;
}
f[i][i] = 1;
}
for (int i=1; i<=n; i++){
tmp = f[i];
for (int j=1; j<=n; j++){
if (f[i][j]){
if (tmp.count() == n) break;
tmp |= f[j];
}
}
if (tmp.count() == n){
ans.push_back(i);
if (ans.size() == 3) break;
}
}
if (ans.size() < 3) return puts ("NOT FOUND"), 0;
for (int i=0; i<ans.size(); i++){
printf ("%d ", ans[i]);
}
puts ("");
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 4108kb
input:
6 011010 000101 010111 100001 010100 100010
output:
1 3 4
result:
ok OK, Answer correct.
Test #2:
score: 0
Accepted
time: 0ms
memory: 3980kb
input:
3 011 001 000
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #3:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
3 010 001 100
output:
1 2 3
result:
ok OK, Answer correct.
Test #4:
score: 0
Accepted
time: 158ms
memory: 6892kb
input:
4994 0100001010011001010101110010101000111101111100100001110010000111100000000100110100101000001010100000010010010110110110111010010010100110100000110110111001010111010111010111011001000101001000010001010111110000000100001100000111100011001010010111011100111010101110011000010111101011111110001111110...
output:
1 2 3
result:
ok OK, Answer correct.
Test #5:
score: 0
Accepted
time: 153ms
memory: 6908kb
input:
4994 0000000110000010100001001010100101010001000000011001110000111011100010100100001001011100000101100000100100001101101101010010110011101100101001100101110010001111110111001101000110111001010011101001010101000000111101101111001011111011000001110010000000110101010010010100100101111111001000111111011...
output:
1 2 3
result:
ok OK, Answer correct.
Test #6:
score: 0
Accepted
time: 153ms
memory: 6916kb
input:
4995 0010100011010011000010101100100000011100110100010101010101000001011110100010001001011001100001111100011010001110011101111001110001000000101010001000010000010001011010010001100001010111011111011011110110000101001000000100000000000010111010101111111100001010001000000001001110000110011001111001111...
output:
1 2 3
result:
ok OK, Answer correct.
Test #7:
score: 0
Accepted
time: 149ms
memory: 6900kb
input:
4998 0011100111111001011100001111010010000111001110101001001011010111100010001110000001000010011011011110001110101111010011000101001101001000100110111110001001100111111000010101010101000110011100011001010110111110000100000010000101001000100011000010101111101101000000101010100111010101111101111100010...
output:
1 2 3
result:
ok OK, Answer correct.
Test #8:
score: 0
Accepted
time: 144ms
memory: 6904kb
input:
4994 0010111010011101101110001111100011010010010000101101110110110000100010000101011100000001011100010001000011010101011111100011010000010110000011110010011000101011100011110110011101110000101100111110000110100111001101000100011001001001100001101110001100111011100111001011001011010111111001001000010...
output:
1 2 3
result:
ok OK, Answer correct.
Test #9:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
1 0
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #10:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
2 01 00
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #11:
score: -100
Time Limit Exceeded
input:
4998 0101101111101110111110111111111111111101111111010110100111111101110101111101111110101111011111100010111011110100111111111101011101101100110111101110110101101110111011001111101011111101111001111101011111100110111110010011010111101111011010110101011111101011101110111111101101011111010010110101111...