QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#771457 | #9246. Dominating Point | 401rk8# | AC ✓ | 804ms | 76304kb | C++17 | 2.9kb | 2024-11-22 13:13:26 | 2024-11-22 13:13:26 |
Judging History
你现在查看的是测评时间为 2024-11-22 13:13:26 的历史记录
- [2024-11-22 18:38:25]
- hack成功,自动添加数据
- (/hack/1238)
- [2024-11-22 13:13:26]
- 提交
answer
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx;
#define For(i,x,y,...) for(int i=x,##__VA_ARGS__;i<=(y);++i)
#define rFor(i,x,y,...) for(int i=x,##__VA_ARGS__;i>=(y);--i)
#define Rep(i,x,y,...) for(int i=x,##__VA_ARGS__;i<(y);++i)
#define pb emplace_back
#define sz(a) int((a).size())
#define all(a) (a).begin(),(a).end()
#define fi first
#define se second
#define mkp make_pair
#define mem(a,x,n) memset(a,x,sizeof(a[0])*(n+2))
typedef long long LL; typedef vector<int> Vi; typedef pair<int,int> Pii;
auto ckmax=[](auto &x,auto y) { return x<y ? x=y,true : false; };
auto ckmin=[](auto &x,auto y) { return y<x ? x=y,true : false; };
sfmt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r) { return uniform_int_distribution<>(l,r)(mt); }
template<typename T=int>T read() { T x; cin>>x; return x; }
const int mod = 998244353;
struct mint {
int x; mint(int x=0):x(x<0?x+mod:x<mod?x:x-mod){}
mint(LL y) { y%=mod, x=y<0?y+mod:y; }
mint& operator += (const mint &y) { x=x+y.x<mod?x+y.x:x+y.x-mod; return *this; }
mint& operator -= (const mint &y) { x=x<y.x?x-y.x+mod:x-y.x; return *this; }
mint& operator *= (const mint &y) { x=1ll*x*y.x%mod; return *this; }
friend mint operator + (mint x,const mint &y) { return x+=y; }
friend mint operator - (mint x,const mint &y) { return x-=y; }
friend mint operator * (mint x,const mint &y) { return x*=y; }
}; mint Pow(mint x,LL y=mod-2) { mint z(1);for(;y;y>>=1,x*=x)if(y&1)z*=x;return z; }
const int N = 5e3+5;
int n,nn,dfn[N],low[N],id[N];
Vi ans,e[N],scc[N];
bitset<N> s[N];
void tj(int u) {
static int s[N],t;
dfn[u] = low[u] = ++dfn[0], s[++t] = u, id[u] = -1;
for(int v : e[u])
if( !dfn[v] ) tj(v), ckmin(low[u],low[v]);
else if( !~id[v] ) ckmin(low[u],dfn[v]);
if( dfn[u] == low[u] ) {
++nn;
do id[s[t]] = nn, scc[nn].pb(s[t]); while( u != s[t--] );
}
}
void MAIN() {
// n = 5e3;
// For(i,1,n) For(j,i+1,n) (rnd(0,1) ? s[i][j] : s[j][i]) = 1;
// For(i,1,n) s[i%n+1][i] = 0, s[i][i%n+1] = 1;
// For(i,1,n) For(j,1,n) if( s[i][j] ) e[i].pb(j);
cin>>n; For(i,1,n) For(j,1,n) if( read<char>() == '1' ) e[i].pb(j), s[i][j] = 1;
For(i,1,n) if( !dfn[i] ) tj(i);
if( nn > 3 ) { cout<<"NOT FOUND\n"; return; }
sort(all(scc[nn]),[](int x,int y){return sz(e[x])>sz(e[y]);});
for(int u : scc[nn]) {
if( clock() > 990000 ) break;
bitset<N> vis = s[u]; vis[u] = 1;
for(int v : e[u]) if( id[v] == nn ) {
if( sz(e[v]) < 70 ) for(int w : e[v]) vis[w] = 1;
else vis |= s[v];
}
if( vis.count() == n ) {
ans.pb(u);
if( sz(ans) == 3 ) break;
}
}
if( sz(ans) < 3 ) { cout<<"NOT FOUND\n"; return; }
cout<<ans[0]<<" "<<ans[1]<<" "<<ans[2]<<'\n';
} signed main() {
#ifdef FS
freopen("in","r",stdin); freopen("out","w",stdout);
#endif
ios::sync_with_stdio(0);cin.tie(0);
int lft=1; while( lft-- ) {
MAIN();
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 4028kb
input:
6 011010 000101 010111 100001 010100 100010
output:
3 1 6
result:
ok OK, Answer correct.
Test #2:
score: 0
Accepted
time: 1ms
memory: 6020kb
input:
3 011 001 000
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #3:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
3 010 001 100
output:
3 2 1
result:
ok OK, Answer correct.
Test #4:
score: 0
Accepted
time: 402ms
memory: 75892kb
input:
4994 0100001010011001010101110010101000111101111100100001110010000111100000000100110100101000001010100000010010010110110110111010010010100110100000110110111001010111010111010111011001000101001000010001010111110000000100001100000111100011001010010111011100111010101110011000010111101011111110001111110...
output:
1505 153 914
result:
ok OK, Answer correct.
Test #5:
score: 0
Accepted
time: 381ms
memory: 75936kb
input:
4994 0000000110000010100001001010100101010001000000011001110000111011100010100100001001011100000101100000100100001101101101010010110011101100101001100101110010001111110111001101000110111001010011101001010101000000111101101111001011111011000001110010000000110101010010010100100101111111001000111111011...
output:
4094 4675 3437
result:
ok OK, Answer correct.
Test #6:
score: 0
Accepted
time: 402ms
memory: 75976kb
input:
4995 0010100011010011000010101100100000011100110100010101010101000001011110100010001001011001100001111100011010001110011101111001110001000000101010001000010000010001011010010001100001010111011111011011110110000101001000000100000000000010111010101111111100001010001000000001001110000110011001111001111...
output:
86 2421 3281
result:
ok OK, Answer correct.
Test #7:
score: 0
Accepted
time: 389ms
memory: 76304kb
input:
4998 0011100111111001011100001111010010000111001110101001001011010111100010001110000001000010011011011110001110101111010011000101001101001000100110111110001001100111111000010101010101000110011100011001010110111110000100000010000101001000100011000010101111101101000000101010100111010101111101111100010...
output:
3642 3850 13
result:
ok OK, Answer correct.
Test #8:
score: 0
Accepted
time: 389ms
memory: 75948kb
input:
4994 0010111010011101101110001111100011010010010000101101110110110000100010000101011100000001011100010001000011010101011111100011010000010110000011110010011000101011100011110110011101110000101100111110000110100111001101000100011001001001100001101110001100111011100111001011001011010111111001001000010...
output:
4591 2950 523
result:
ok OK, Answer correct.
Test #9:
score: 0
Accepted
time: 1ms
memory: 3948kb
input:
1 0
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #10:
score: 0
Accepted
time: 0ms
memory: 4120kb
input:
2 01 00
output:
NOT FOUND
result:
ok OK, Answer correct.
Test #11:
score: 0
Accepted
time: 315ms
memory: 69972kb
input:
4998 0101101111101110111110111111111111111101111111010110100111111101110101111101111110101111011111100010111011110100111111111101011101101100110111101110110101101110111011001111101011111101111001111101011111100110111110010011010111101111011010110101011111101011101110111111101101011111010010110101111...
output:
2793 1411 1681
result:
ok OK, Answer correct.
Test #12:
score: 0
Accepted
time: 302ms
memory: 69936kb
input:
4998 0000001000000000010000100001001010101010000010010100000100000010100000100000100010011101010000000010000101101001001101100010100000000000010011010110000001011000000000010011000000100100010000000000000100110001010110010111000010000001100110110000100010001001100010001000010000011110001011000000100...
output:
2307 3780 4716
result:
ok OK, Answer correct.
Test #13:
score: 0
Accepted
time: 303ms
memory: 70116kb
input:
4998 0010101101011111101011000011111010001110000110101111101010010010111111010111101100001111110111010111000111111011111011110011111101010001111000000101110101000111111100100000011000010011110101010100011000000010100011011011000101101010010100110000000101001000111010101010001110101011011001100011100...
output:
2253 3187 3540
result:
ok OK, Answer correct.
Test #14:
score: 0
Accepted
time: 804ms
memory: 68268kb
input:
5000 0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
5000 4999 1
result:
ok OK, Answer correct.
Extra Test:
score: 0
Extra Test Passed