QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#725176 | #9246. Dominating Point | yld | AC ✓ | 282ms | 28348kb | C++20 | 1.3kb | 2024-11-08 16:34:26 | 2024-11-08 16:34:28 |
Judging History
你现在查看的是测评时间为 2024-11-08 16:34:28 的历史记录
- [2024-11-22 18:38:25]
- hack成功,自动添加数据
- (/hack/1238)
- [2024-11-08 16:34:26]
- 提交
answer
#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
void solve()
{
int n;cin>>n;
string s[n+1];
for(int i=1;i<=n;i++)
{
cin>>s[i];
s[i]=' '+s[i];
}
vector<int> deg(n+1);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(s[i][j]=='1') deg[i]++;
int A=1,B=-1,C=-1;
for(int i=2;i<=n;i++)
if(deg[i]>deg[A]) A=i;
if(deg[A]==n-1) return cout<<"NOT FOUND",void();
vector<int> vis(n+1),key(n+1);
for(int i=1;i<=n;i++)
if(s[i][A]=='1') vis[i]=1,B=i;
if(B==-1) return cout<<"NOT FOUND",void();
fill(deg.begin(),deg.end(),0);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(vis[i] && vis[j] && s[i][j]=='1') deg[i]++;
for(int i=1;i<=n;i++) if(vis[i] && deg[i]>deg[B]) B=i;
for(int i=1;i<=n;i++) if(s[i][B]=='1') key[i]=1,C=i;
fill(deg.begin(),deg.end(),0);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(key[i] && key[j] && s[i][j]=='1') deg[i]++;
for(int i=1;i<=n;i++) if(key[i] && deg[i]>deg[C]) C=i;
if(C==-1) return cout<<"NOT FOUND",void();
cout<<A<<' '<<B<<' '<<C;
}
signed main()
{
cin.tie(0)->sync_with_stdio(0);
int t=1;
while(t--) solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3552kb
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: 3784kb
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 3 2
result:
ok OK, Answer correct.
Test #4:
score: 0
Accepted
time: 282ms
memory: 28092kb
input:
4994 0100001010011001010101110010101000111101111100100001110010000111100000000100110100101000001010100000010010010110110110111010010010100110100000110110111001010111010111010111011001000101001000010001010111110000000100001100000111100011001010010111011100111010101110011000010111101011111110001111110...
output:
1505 3625 4161
result:
ok OK, Answer correct.
Test #5:
score: 0
Accepted
time: 273ms
memory: 28028kb
input:
4994 0000000110000010100001001010100101010001000000011001110000111011100010100100001001011100000101100000100100001101101101010010110011101100101001100101110010001111110111001101000110111001010011101001010101000000111101101111001011111011000001110010000000110101010010010100100101111111001000111111011...
output:
4094 227 1109
result:
ok OK, Answer correct.
Test #6:
score: 0
Accepted
time: 266ms
memory: 28120kb
input:
4995 0010100011010011000010101100100000011100110100010101010101000001011110100010001001011001100001111100011010001110011101111001110001000000101010001000010000010001011010010001100001010111011111011011110110000101001000000100000000000010111010101111111100001010001000000001001110000110011001111001111...
output:
86 487 4082
result:
ok OK, Answer correct.
Test #7:
score: 0
Accepted
time: 279ms
memory: 28256kb
input:
4998 0011100111111001011100001111010010000111001110101001001011010111100010001110000001000010011011011110001110101111010011000101001101001000100110111110001001100111111000010101010101000110011100011001010110111110000100000010000101001000100011000010101111101101000000101010100111010101111101111100010...
output:
3642 400 4632
result:
ok OK, Answer correct.
Test #8:
score: 0
Accepted
time: 282ms
memory: 28248kb
input:
4994 0010111010011101101110001111100011010010010000101101110110110000100010000101011100000001011100010001000011010101011111100011010000010110000011110010011000101011100011110110011101110000101100111110000110100111001101000100011001001001100001101110001100111011100111001011001011010111111001001000010...
output:
4591 4236 250
result:
ok OK, Answer correct.
Test #9:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
1 0
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #10:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
2 01 00
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #11:
score: 0
Accepted
time: 106ms
memory: 28076kb
input:
4998 0101101111101110111110111111111111111101111111010110100111111101110101111101111110101111011111100010111011110100111111111101011101101100110111101110110101101110111011001111101011111101111001111101011111100110111110010011010111101111011010110101011111101011101110111111101101011111010010110101111...
output:
1411 1681 2793
result:
ok OK, Answer correct.
Test #12:
score: 0
Accepted
time: 95ms
memory: 28212kb
input:
4998 0000001000000000010000100001001010101010000010010100000100000010100000100000100010011101010000000010000101101001001101100010100000000000010011010110000001011000000000010011000000100100010000000000000100110001010110010111000010000001100110110000100010001001100010001000010000011110001011000000100...
output:
2307 4716 3780
result:
ok OK, Answer correct.
Test #13:
score: 0
Accepted
time: 108ms
memory: 28232kb
input:
4998 0010101101011111101011000011111010001110000110101111101010010010111111010111101100001111110111010111000111111011111011110011111101010001111000000101110101000111111100100000011000010011110101010100011000000010100011011011000101101010010100110000000101001000111010101010001110101011011001100011100...
output:
2253 3540 3187
result:
ok OK, Answer correct.
Test #14:
score: 0
Accepted
time: 72ms
memory: 28348kb
input:
5000 0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
4999 5000 1
result:
ok OK, Answer correct.
Extra Test:
score: 0
Extra Test Passed