QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#702447#9246. Dominating Point53Dawns#AC ✓643ms10532kbC++231.8kb2024-11-02 16:00:292024-11-22 18:47:43

Judging History

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

  • [2024-11-22 18:47:43]
  • 自动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:643ms
  • 内存:10532kb
  • [2024-11-22 18:38:25]
  • hack成功,自动添加数据
  • (/hack/1238)
  • [2024-11-02 16:00:41]
  • 评测
  • 测评结果:100
  • 用时:642ms
  • 内存:10548kb
  • [2024-11-02 16:00:29]
  • 提交

answer

//Author: Puremg
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC optimize(3,"Ofast")
#include <bits/stdc++.h>
#define deg(a) cout<<#a<<'='<<a<<"\n"
// #define int long long
#define all(a) a.begin(), a.end()
#define db double
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 5e3;
const db eps = 1e-10;
const db pi = acos(-1);
// mt19937_64 rng(random_device{}());

vector<bitset<N>>d;
int n;

int check(int x){
  auto num=d[x];



  for(int i=0;i<n;++i){
    if(d[x][i]){
      num|=d[i];
    }
  }

  // cout<<x<<'\n';
  // for(int i=0;i<n;++i) cout<<num[i];
  // cout<<'\n';

  for(int i=0;i<n;++i){
    if(i==x) continue;
    if(num[i]==0) return 0;
  }
  return 1;
}

void solve() {
  cin>>n;


  for(int i=0;i<n;++i){
    string str;
    cin>>str;
    reverse(str.begin(),str.end());
    bitset<N>num(str);
    d.push_back(num);
  }

  vector<int>ans;

  for(int i=0;i<n;++i){
    if(check(i)){
      ans.push_back(i);
    }
    if(ans.size()==3) break;
  }
  if(ans.size()<3){
    cout<<"NOT FOUND\n";
  }else{
    for(auto v:ans) cout<<v+1<<' ';
    cout<<'\n';
  }

}

signed main()
{
 // auto start_time = std::chrono::high_resolution_clock::now();
 // freopen("in.txt", "r", stdin);
 // freopen("out.txt", "w", stdout);
  cin.tie(nullptr)->sync_with_stdio(false);
  cout << fixed << setprecision(15);
  int T = 1;
  // cin >> T;
  while (T--) solve();
  // auto end_time = std::chrono::high_resolution_clock::now();
  // auto duration = std::chrono::duration_cast<std::chrono::milliseconds>(end_time - start_time);
  // std::cout << "程序运行时间:" << duration.count() << "毫秒" << std::endl;
  return 0;
}

/*
6
011010
000101
010111
100001
010100
100010
*/

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

input:

3
011
001
000

output:

NOT FOUND

result:

ok OK, Answer correct.

Test #3:

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

input:

3
010
001
100

output:

1 2 3 

result:

ok OK, Answer correct.

Test #4:

score: 0
Accepted
time: 129ms
memory: 10244kb

input:

4994
0100001010011001010101110010101000111101111100100001110010000111100000000100110100101000001010100000010010010110110110111010010010100110100000110110111001010111010111010111011001000101001000010001010111110000000100001100000111100011001010010111011100111010101110011000010111101011111110001111110...

output:

1 2 3 

result:

ok OK, Answer correct.

Test #5:

score: 0
Accepted
time: 129ms
memory: 9084kb

input:

4994
0000000110000010100001001010100101010001000000011001110000111011100010100100001001011100000101100000100100001101101101010010110011101100101001100101110010001111110111001101000110111001010011101001010101000000111101101111001011111011000001110010000000110101010010010100100101111111001000111111011...

output:

1 2 3 

result:

ok OK, Answer correct.

Test #6:

score: 0
Accepted
time: 129ms
memory: 10244kb

input:

4995
0010100011010011000010101100100000011100110100010101010101000001011110100010001001011001100001111100011010001110011101111001110001000000101010001000010000010001011010010001100001010111011111011011110110000101001000000100000000000010111010101111111100001010001000000001001110000110011001111001111...

output:

1 2 3 

result:

ok OK, Answer correct.

Test #7:

score: 0
Accepted
time: 125ms
memory: 9136kb

input:

4998
0011100111111001011100001111010010000111001110101001001011010111100010001110000001000010011011011110001110101111010011000101001101001000100110111110001001100111111000010101010101000110011100011001010110111110000100000010000101001000100011000010101111101101000000101010100111010101111101111100010...

output:

1 2 3 

result:

ok OK, Answer correct.

Test #8:

score: 0
Accepted
time: 126ms
memory: 8664kb

input:

4994
0010111010011101101110001111100011010010010000101101110110110000100010000101011100000001011100010001000011010101011111100011010000010110000011110010011000101011100011110110011101110000101100111110000110100111001101000100011001001001100001101110001100111011100111001011001011010111111001001000010...

output:

1 2 3 

result:

ok OK, Answer correct.

Test #9:

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

input:

1
0

output:

NOT FOUND

result:

ok OK, Answer correct.

Test #10:

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

input:

2
01
00

output:

NOT FOUND

result:

ok OK, Answer correct.

Test #11:

score: 0
Accepted
time: 466ms
memory: 9768kb

input:

4998
0101101111101110111110111111111111111101111111010110100111111101110101111101111110101111011111100010111011110100111111111101011101101100110111101110110101101110111011001111101011111101111001111101011111100110111110010011010111101111011010110101011111101011101110111111101101011111010010110101111...

output:

1411 1681 2793 

result:

ok OK, Answer correct.

Test #12:

score: 0
Accepted
time: 598ms
memory: 10532kb

input:

4998
0000001000000000010000100001001010101010000010010100000100000010100000100000100010011101010000000010000101101001001101100010100000000000010011010110000001011000000000010011000000100100010000000000000100110001010110010111000010000001100110110000100010001001100010001000010000011110001011000000100...

output:

685 2307 3780 

result:

ok OK, Answer correct.

Test #13:

score: 0
Accepted
time: 510ms
memory: 9632kb

input:

4998
0010101101011111101011000011111010001110000110101111101010010010111111010111101100001111110111010111000111111011111011110011111101010001111000000101110101000111111100100000011000010011110101010100011000000010100011011011000101101010010100110000000101001000111010101010001110101011011001100011100...

output:

1529 2253 3187 

result:

ok OK, Answer correct.

Test #14:

score: 0
Accepted
time: 643ms
memory: 8964kb

input:

5000
0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

1 4999 5000 

result:

ok OK, Answer correct.

Extra Test:

score: 0
Extra Test Passed