QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#263816 | #7733. Cool, It’s Yesterday Four Times More | ucup-team2230# | WA | 3ms | 3524kb | C++17 | 2.6kb | 2023-11-25 08:32:18 | 2023-11-25 08:32:18 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define rep_(_1,_2,_3,NAME,...) NAME
#define rep(...) rep_(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)
#define rep1(i,j) for(int i=0;i<(j);i++)
#define rep2(i,j,k) for(int i=(j);i<(k);i++)
template<class T> T T_INF(){ return 1000000000000000000; }
template<> int T_INF<int>(){ return 1000000000; }
struct UF{
vector<int> par,r;
UF(int n){ init(n); }
UF(){}
void init(int n=-1){
if(n==-1)n=par.size();
par.resize(n);
r.resize(n);
iota(par.begin(),par.end(),0);
fill(r.begin(),r.end(),0);
}
int find(int x){
if(par[x]==x)return x;
return par[x]=find(par[x]);
}
bool same(int x,int y){ return find(x)==find(y); }
void unit(int x,int y){
if(same(x,y))return;
x=find(x);
y=find(y);
if(r[x]>r[y])swap(x,y);
par[x]=y;
if(r[x]==r[y])r[y]++;
}
};
int n,m;
vector<string> s;
typedef bitset<4000> bs;
void solve(){
UF uf(n*m);
rep(i,n)rep(j,m-1){
if(s[i][j]=='.'&&s[i][j+1]=='.'){
uf.unit(i*m+j,i*m+j+1);
}
}
rep(i,n-1)rep(j,m){
if(s[i+1][j]=='.'&&s[i][j]=='.'){
uf.unit(i*m+j,i*m+j+m);
}
}
vector<bs> b(n*m);
rep(i,n)rep(j,m){
b[i*m+j].reset();
rep(x,n)rep(y,m){
if(uf.same(i*m+j,x*m+y)){
b[i*m+j][(x-i+n)*m+(y-j+m)]=true;
}
}
}
/*rep(i,n)rep(j,m){
cout<<i<<" "<<j<<endl;
rep(k,30){
cout<<(b[i*m+j][k]?1:0);
}
cout<<endl;
}*/
int ret=0;
rep(i,n)rep(j,m){
if(s[i][j]=='O')continue;
bool ok=true;
rep(x,n)rep(y,m){
if(s[x][y]=='O')continue;
if(i==x&&j==y)continue;
if((b[i*m+j]&b[x*m+y])==b[i*m+j]){ ok=false; break; }
}
if(ok)ret++;
}
cout<<ret<<endl;
}
/*int main(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.precision(20);
int T=5;
rep(t,T){
n=50; m=20;
s=vector<string>(n);
rep(i,n)s[i]=string(m,'.');
solve();
}
cerr<<clock()<<endl;
}*/
int main(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.precision(20);
int T;
cin>>T;
rep(t,T){
cin>>n>>m;
s=vector<string>(n);
rep(i,n)cin>>s[i];
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3428kb
input:
4 2 5 .OO.. O..O. 1 3 O.O 1 3 .O. 2 3 OOO OOO
output:
3 1 0 0
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 1ms
memory: 3420kb
input:
200 2 4 OOO. OO.. 2 3 OOO .O. 3 3 O.O OOO OO. 4 1 . . O O 1 2 .O 1 1 . 2 5 .OO.. .O.O. 2 1 O O 1 1 O 1 3 .OO 5 1 O O . O . 5 2 O. .. O. .O .. 5 3 ... ... .OO ..O OOO 3 5 ..O.O .O.O. .OO.O 5 2 .O OO O. O. .. 2 1 O O 3 5 .O.OO O...O ..OO. 1 5 ..... 5 1 O . O . . 5 3 OOO OO. .OO OO. O.O 2 1 O . 5 2 O. ...
output:
3 0 0 2 1 1 3 0 0 1 0 7 9 4 4 0 6 5 2 0 1 6 4 5 2 0 0 5 3 3 1 4 1 0 7 5 2 3 7 3 0 6 2 2 2 0 4 6 6 3 3 2 3 5 2 1 0 3 3 4 4 2 2 0 7 6 4 8 5 3 2 5 2 1 2 1 4 0 0 2 5 1 4 6 6 1 6 2 2 3 4 5 2 1 0 1 9 3 4 11 0 3 2 1 0 0 4 3 1 4 3 8 3 0 3 6 2 5 1 3 3 4 0 2 11 2 2 4 0 4 4 6 2 1 2 3 0 5 0 16 4 3 2 6 0 8 3 3 1...
result:
ok 200 lines
Test #3:
score: -100
Wrong Answer
time: 3ms
memory: 3524kb
input:
50 10 9 OOOO.O... O...O.OOO .....O... ..OO..O.O ...O..O.O ..OOO..O. ..OOO...O .OO.O..OO .O.O.OO.. .O..O.O.O 10 10 .O.OOO.OO. ...OOOOOOO ...O.O..O. .O.O..O... .O.O.OO..O ..OO.O..OO O....O..OO OO...OOOOO OO.OO.O..O .O.O.OOOOO 10 8 O..OOO.O O.OOOO.. O..OO.OO OO..OO.. .OOO..O. .OO.OO.O OOO..OO. ..O..OO....
output:
31 40 13 25 40 37 27 29 20 26 25 29 21 29 21 31 32 31 33 34 25 31 18 25 41 28 20 38 20 29 18 21 27 28 35 13 20 17 32 29 28 23 23 23 24 18 28 17 35 24
result:
wrong answer 28th lines differ - expected: '45', found: '38'