Can we find Bitwise And of all subarrays of an array in O(n) time ? If not,then what is the best time complexity for doing this ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Can we find Bitwise And of all subarrays of an array in O(n) time ? If not,then what is the best time complexity for doing this ?
bool findLoop(int v)
{
if(vis[v]==1)
return 1;
if(vis[v]==2)
return 0;
vis[v]=1;
for(auto &it:g[v])
{
if(findLoop(it))
return 1;
}
vis[v]=2;
return 0;
}
bool checkLoop()
{
fill(vis+1, vis+n+1, 0);
for(int i=1;i<=n;i++)
{
if(!vis[i] && findLoop(i))
return 1;
}
return 0;
}
Name |
---|