QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#689186#9246. Dominating Pointhuanxiel#TL 165ms72572kbC++201.8kb2024-10-30 15:43:092024-10-30 15:43:10

Judging History

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

  • [2024-11-22 18:38:25]
  • hack成功,自动添加数据
  • (/hack/1238)
  • [2024-10-30 15:43:10]
  • 评测
  • 测评结果:TL
  • 用时:165ms
  • 内存:72572kb
  • [2024-10-30 15:43:09]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define sz(v) int((v).size())
#define all(v) (v).begin(),(v).end()
#define endl "\n"
#define no cout<<"NO"<<endl;
#define yes cout<<"YES"<<endl;
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
typedef double db;
const db eps = 1e-8;
#define inf 1e18
#define ret {cout<<-1<<endl;return;}
template<typename T> bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T> bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}
#define maxn 5010
vector<int>g[maxn];
int vis[maxn];
void solve()
{
    int n;
    cin>>n;
    string s;
    rep(i,0,n-1)
    {
        cin>>s;
        rep(j,0,n-1)
        {
            if(s[j]=='1') g[i].push_back(j);
        }
    }
    int cnt=0;
    vector<int>v;
    rep(i,0,n-1)
    {
        int c=0;
        rep(i,0,n-1) vis[i]=0;
        for(auto v:g[i])
        {
            vis[v]=1;
            for(auto x:g[v])
            {
                vis[x]=1;
            }
        }
        vis[i]=0;
        rep(j,0,n-1) if(vis[j]) c++;
        if(c==n-1) v.push_back(i),cnt++;
        if(cnt==3) break;
    }
    if(sz(v)==3)
    {
        for(auto x:v)
        {
            cout<<x+1<<" ";
        }
    }
    else 
    {
        cout<<"NOT FOUND"<<endl;
    }
}
signed main()
{
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
	int t=1;
	//cin>>t;
	while(t--)solve();
}
//循环边界
//二分l和r的范围
//数组越界
//在函数内开数组赋初值
//long long
//尽量用数学语言刻画
//从直觉到严谨分析,推导
//冷静,冷静,冷静
// if(mp[x]) 会生成新的键值

详细

Test #1:

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

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: 3548kb

input:

3
011
001
000

output:

NOT FOUND

result:

ok OK, Answer correct.

Test #3:

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

input:

3
010
001
100

output:

1 2 3 

result:

ok OK, Answer correct.

Test #4:

score: 0
Accepted
time: 160ms
memory: 72524kb

input:

4994
0100001010011001010101110010101000111101111100100001110010000111100000000100110100101000001010100000010010010110110110111010010010100110100000110110111001010111010111010111011001000101001000010001010111110000000100001100000111100011001010010111011100111010101110011000010111101011111110001111110...

output:

1 2 3 

result:

ok OK, Answer correct.

Test #5:

score: 0
Accepted
time: 162ms
memory: 72492kb

input:

4994
0000000110000010100001001010100101010001000000011001110000111011100010100100001001011100000101100000100100001101101101010010110011101100101001100101110010001111110111001101000110111001010011101001010101000000111101101111001011111011000001110010000000110101010010010100100101111111001000111111011...

output:

1 2 3 

result:

ok OK, Answer correct.

Test #6:

score: 0
Accepted
time: 165ms
memory: 72572kb

input:

4995
0010100011010011000010101100100000011100110100010101010101000001011110100010001001011001100001111100011010001110011101111001110001000000101010001000010000010001011010010001100001010111011111011011110110000101001000000100000000000010111010101111111100001010001000000001001110000110011001111001111...

output:

1 2 3 

result:

ok OK, Answer correct.

Test #7:

score: 0
Accepted
time: 159ms
memory: 72500kb

input:

4998
0011100111111001011100001111010010000111001110101001001011010111100010001110000001000010011011011110001110101111010011000101001101001000100110111110001001100111111000010101010101000110011100011001010110111110000100000010000101001000100011000010101111101101000000101010100111010101111101111100010...

output:

1 2 3 

result:

ok OK, Answer correct.

Test #8:

score: 0
Accepted
time: 156ms
memory: 72348kb

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: 3552kb

input:

2
01
00

output:

NOT FOUND

result:

ok OK, Answer correct.

Test #11:

score: -100
Time Limit Exceeded

input:

4998
0101101111101110111110111111111111111101111111010110100111111101110101111101111110101111011111100010111011110100111111111101011101101100110111101110110101101110111011001111101011111101111001111101011111100110111110010011010111101111011010110101011111101011101110111111101101011111010010110101111...

output:


result: