QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #765604 | #9246. Dominating Point | sdmrlh | WA | 866ms | 79800kb | C++14 | 3.8kb | 2024-11-20 14:47:38 | 2024-11-20 14:47:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define pb push_back
#define pp pop_back()
#define int long long
#define laile cout<<"laile"<<endl
#define lowbit(x) ((x)&(-x))
#define double long double
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld %lld",&x,&y)
#define sd(x) scanf("%Lf",&x)
#define sdd(x,y) scanf("%Lf %Lf",&x,&y)
#define _for(i,n) for(int i=0;i<(n);++i)
#define _rep(i,a,b) for(int i=(a);i<=(b);++i)
#define _pre(i,a,b) for(int i=(a);i>=(b);--i)
#define all(x) (x).begin(), (x).end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef unsigned long long ULL;
typedef pair<int,int>PII;
const int N=5050,INF=4e18;
int n,m;
char g[N][N];
char g2[N][N];
string hang[N],lie[N];
void solve()
{
cin>>n;
m=n;
_rep(i,1,n)
{
string now="";
_rep(j,1,m)
cin>>g[i][j],now.pb(g[i][j]);
hang[i]=now;
}
_rep(j,1,m)
{
string now="";
_rep(i,1,n)
now.pb(g[i][j]);
lie[j]=now;
}
vector<int>res;
for(int i=n;i>=1;i--)
{
bool bl=true;
bitset<N>b1(hang[i]);
int x=rand()%(n/10+1);
x++;
for(int k=1;k<=x;k++)
{
if(k&1)
{
for(int j=n/k*k;j>=1;j-=x)
{
if(i==j)continue;
bitset<N>b2(lie[j]);
if((b1&b2).any());
// cout<<"1";
else if(g[i][j]=='0')
{
bl=false;
break;
}
}
}
else
{
for(int j=1;j<=n;j+=x)
{
if(i==j)continue;
bitset<N>b2(lie[j]);
if((b1&b2).any());
// cout<<"1";
else if(g[i][j]=='0')
{
bl=false;
break;
}
}
}
if(!bl)break;
}
if(bl)res.pb(i);
if(res.size()>=3)break;
}
// for(int i=1;i<n/2;i++)
// {
// if(res.size()>=3)break;
// bool bl=true;
// bitset<N>b1(hang[i]);
// int x=rand()%(n/10+1);
// x++;
// for(int k=1;k<=x;k++)
// {
// if(k&1)
// {
// for(int j=n/k*k;j>=1;j-=x)
// {
// if(i==j)continue;
// bitset<N>b2(lie[j]);
// if((b1&b2).any());
// // cout<<"1";
// else if(g[i][j]=='0')
// {
// bl=false;
// break;
// }
// }
// }
// else
// {
// for(int j=1;j<=n;j+=x)
// {
// if(i==j)continue;
// bitset<N>b2(lie[j]);
// if((b1&b2).any());
// // cout<<"1";
// else if(g[i][j]=='0')
// {
// bl=false;
// break;
// }
// }
// }
// if(!bl)break;
// }
// if(bl)res.pb(i);
// if(res.size()>=3)break;
// }
if(res.size()<3)cout<<"NOT FOUND\n";
else cout<<res[0]<<" "<<res[1]<<" "<<res[2]<<'\n';
return ;
}
signed main()
{
IOS;
int T=1;
// cin>>T;
while(T--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 5864kb
input:
6 011010 000101 010111 100001 010100 100010
output:
6 4 3
result:
ok OK, Answer correct.
Test #2:
score: 0
Accepted
time: 1ms
memory: 6196kb
input:
3 011 001 000
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #3:
score: 0
Accepted
time: 1ms
memory: 6008kb
input:
3 010 001 100
output:
3 2 1
result:
ok OK, Answer correct.
Test #4:
score: 0
Accepted
time: 591ms
memory: 79724kb
input:
4994 0100001010011001010101110010101000111101111100100001110010000111100000000100110100101000001010100000010010010110110110111010010010100110100000110110111001010111010111010111011001000101001000010001010111110000000100001100000111100011001010010111011100111010101110011000010111101011111110001111110...
output:
4994 4993 4992
result:
ok OK, Answer correct.
Test #5:
score: 0
Accepted
time: 601ms
memory: 77444kb
input:
4994 0000000110000010100001001010100101010001000000011001110000111011100010100100001001011100000101100000100100001101101101010010110011101100101001100101110010001111110111001101000110111001010011101001010101000000111101101111001011111011000001110010000000110101010010010100100101111111001000111111011...
output:
4994 4993 4992
result:
ok OK, Answer correct.
Test #6:
score: 0
Accepted
time: 582ms
memory: 78952kb
input:
4995 0010100011010011000010101100100000011100110100010101010101000001011110100010001001011001100001111100011010001110011101111001110001000000101010001000010000010001011010010001100001010111011111011011110110000101001000000100000000000010111010101111111100001010001000000001001110000110011001111001111...
output:
4995 4994 4993
result:
ok OK, Answer correct.
Test #7:
score: 0
Accepted
time: 592ms
memory: 78396kb
input:
4998 0011100111111001011100001111010010000111001110101001001011010111100010001110000001000010011011011110001110101111010011000101001101001000100110111110001001100111111000010101010101000110011100011001010110111110000100000010000101001000100011000010101111101101000000101010100111010101111101111100010...
output:
4998 4997 4996
result:
ok OK, Answer correct.
Test #8:
score: 0
Accepted
time: 605ms
memory: 79800kb
input:
4994 0010111010011101101110001111100011010010010000101101110110110000100010000101011100000001011100010001000011010101011111100011010000010110000011110010011000101011100011110110011101110000101100111110000110100111001101000100011001001001100001101110001100111011100111001011001011010111111001001000010...
output:
4994 4993 4992
result:
ok OK, Answer correct.
Test #9:
score: 0
Accepted
time: 1ms
memory: 5912kb
input:
1 0
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #10:
score: 0
Accepted
time: 1ms
memory: 7964kb
input:
2 01 00
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #11:
score: -100
Wrong Answer
time: 866ms
memory: 77580kb
input:
4998 0101101111101110111110111111111111111101111111010110100111111101110101111101111110101111011111100010111011110100111111111101011101101100110111101110110101101110111011001111101011111101111001111101011111100110111110010011010111101111011010110101011111101011101110111111101101011111010010110101111...
output:
4796 4716 4552
result:
wrong answer Wrong Answer, Point not dominating.