QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #313954 | #7733. Cool, It’s Yesterday Four Times More | gingoo | WA | 2ms | 3668kb | C++14 | 10.0kb | 2024-01-25 10:44:17 | 2024-01-25 10:44:18 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef int ld;
// struct point
// {
// ld x, y;
// point operator + (const point &a) const
// {
// return {x + a.x, y + a.y};
// }
// point operator - (const point &a) const
// {
// return {x - a.x, y - a.y};
// }
// point operator * (const ld &a) const
// {
// return {x * a, y * a};
// }
// };
// struct line
// {
// point s, t;
// };
// ld sqr(ld x) { return x * x; }
// // // const ld eps = 1e-9;
// // int sgn(ld x) { return x > eps ? 1 : -eps ? -1
// // : 0; }
// ld dot(const point &a, const point &b)
// {
// return a.x * b.x + a.y * b.y;
// }
// ld det(const point &a, const point &b)
// {
// return a.x * b.y - a.y * b.x;
// }
// bool point_on_line(const point &a, const line &l){
// return (det(l.s - a, a - l.t)) == 0;
// }
// bool pol(const point &a,const point &b,const point &c){
// return (a.y-b.y)*(b.x-c.x)==(b.y-c.y)*(a.x-b.x);
// }
// vector<point> v;
// map<point,int> mp;
// int n;
// bool dfs(vector<point> &v1,int now){
// if(v1.size()<=now)return 1;
// for(int i=0;i<=now;i++){
// for(int j=i+1;j<=now;j++){
// vector<point> v2;
// for(auto p:v1){
// if(!point_on_line(p,(line){v1[i],v1[j]})){
// v2.push_back(p);
// }
// }
// if(dfs(v2,now-1))return 1;
// }
// }
// return 0;
// }
struct node
{
int x1, y1, x2, y2;
};
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main()
{
int t;
cin >> t;
while (t--)
{
int n, m;
cin >> n >> m;
char ch[n + 1][m + 1];
bool mp[n + 1][m + 1][n + 1][m + 1];
memset(mp, 0, sizeof(mp));
for (int i = 1; i <= n; i++)
{
scanf("%s", ch[i] + 1);
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (ch[i][j] == '.')
{
bool vis[n + 1][m + 1];
for (int k = 1; k <= n; k++)
{
for (int l = 1; l <= m; l++)
vis[k][l] = 0;
}
for (int k = 1; k <= n; k++)
{
for (int l = 1; l <= m; l++)
{
queue<node> q;
if (!mp[i][j][k][l])
{
if (ch[k][l] == 'O')
{
mp[i][j][k][l] = 1;
continue;
}
q.push({i, j, k, l});
while (!q.empty())
{
node tmp = q.front();
q.pop();
int x = tmp.x1, y = tmp.y1;
int xx = tmp.x2, yy = tmp.y2;
if (mp[i][j][k][l])
break;
vis[x][y] = 1;
//if(i==1 and j==4)cout<<x<<" "<<y<<" "<<xx<<" "<<yy<<'\n';
//if(i==1 and j==4 and k==2 and l==2)cout<<x<<" "<<y<<" "<<xx<<" "<<yy<<'\n';
for (int kk = 0; kk < 4; kk++)
{
int xxx = x + dx[kk];
int yyy = y + dy[kk];
// if(i==1 and j==4 and k==2 and l==2)cout<<xxx<<" "<<yyy<<'\n';
if (xxx < 1 or xxx > n or yyy < 1 or yyy > m or ch[xxx][yyy] == 'O')
continue;
// if(i==1 and j==4 and k==2 and l==2)cout<<xxx<<" "<<yyy<<" "<<xx+dx[kk]<<" "<<yy+dy[kk]<<'\n';
if (mp[xxx][yyy][xx + dx[kk]][yy + dy[kk]])
{
mp[x][y][xx][yy] = 1;
mp[i][j][k][l] = 1;
}
if (ch[xx + dx[kk]][yy + dy[kk]] == 'O' or xx + dx[kk] < 1 or xx + dx[kk] > n or yy + dy[kk] < 1 or yy + dy[kk] > m)
{
//if(i==1 and j==4 and k==2 and l==2)cout<<xxx<<" "<<yyy<<" "<<xx+dx[kk]<<" "<<yy+dy[kk]<<'\n';
mp[x][y][xx][yy] = 1;
mp[i][j][k][l] = 1;
}
if (vis[xxx][yyy])
continue;
//vis[xxx][yyy]=1;
q.push((node){xxx, yyy, xx + dx[kk], yy + dy[kk]});
}
}
}
}
}
}
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (ch[i][j] == '.')
{
bool vis[n + 1][m + 1];
for (int k = 1; k <= n; k++)
{
for (int l = 1; l <= m; l++)
vis[k][l] = 0;
}
for (int k = 1; k <= n; k++)
{
for (int l = 1; l <= m; l++)
{
queue<node> q;
if (!mp[i][j][k][l])
{
if (ch[k][l] == 'O')
{
mp[i][j][k][l] = 1;
continue;
}
q.push({i, j, k, l});
while (!q.empty())
{
node tmp = q.front();
q.pop();
int x = tmp.x1, y = tmp.y1;
int xx = tmp.x2, yy = tmp.y2;
if (mp[i][j][k][l])
break;
vis[x][y] = 1;
//if(i==1 and j==4)cout<<x<<" "<<y<<" "<<xx<<" "<<yy<<'\n';
//if(i==1 and j==4 and k==2 and l==2)cout<<x<<" "<<y<<" "<<xx<<" "<<yy<<'\n';
for (int kk = 0; kk < 4; kk++)
{
int xxx = x + dx[kk];
int yyy = y + dy[kk];
// if(i==1 and j==4 and k==2 and l==2)cout<<xxx<<" "<<yyy<<'\n';
if (xxx < 1 or xxx > n or yyy < 1 or yyy > m or ch[xxx][yyy] == 'O')
continue;
// if(i==1 and j==4 and k==2 and l==2)cout<<xxx<<" "<<yyy<<" "<<xx+dx[kk]<<" "<<yy+dy[kk]<<'\n';
if (mp[xxx][yyy][xx + dx[kk]][yy + dy[kk]])
{
mp[x][y][xx][yy] = 1;
mp[i][j][k][l] = 1;
}
if (ch[xx + dx[kk]][yy + dy[kk]] == 'O' or xx + dx[kk] < 1 or xx + dx[kk] > n or yy + dy[kk] < 1 or yy + dy[kk] > m)
{
//if(i==1 and j==4 and k==2 and l==2)cout<<xxx<<" "<<yyy<<" "<<xx+dx[kk]<<" "<<yy+dy[kk]<<'\n';
mp[x][y][xx][yy] = 1;
mp[i][j][k][l] = 1;
}
if (vis[xxx][yyy])
continue;
//vis[xxx][yyy]=1;
q.push((node){xxx, yyy, xx + dx[kk], yy + dy[kk]});
}
}
}
}
}
}
}
}
int cnt = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (ch[i][j] == '.')
{
int flag = 1;
for (int k = 1; k <= n; k++)
{
for (int l = 1; l <= m; l++)
{
if (i == k and j == l)
continue;
if (ch[k][l] != '.')
continue;
if (!mp[i][j][k][l])
{
//if(i==1 and j==4)cout<<mp[i][j][k][l]<<" "<<k<<" "<<l<<"\n";
flag = 0;
break;
}
}
//if(i==1 and j==4)cout<<'\n';
}
if (flag)
cnt++;
}
}
}
cout << cnt << '\n';
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
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: -100
Wrong Answer
time: 2ms
memory: 3668kb
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 3 2 0 1 6 4 5 2 0 0 5 3 3 1 3 1 0 7 3 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 6 6 3 8 5 3 2 5 2 1 2 1 3 0 0 2 5 1 4 6 6 1 6 2 2 3 4 5 2 1 0 1 8 3 4 11 0 3 2 1 0 0 3 3 1 4 3 8 3 0 3 6 2 5 1 3 3 3 0 2 9 2 2 4 0 3 4 6 2 1 2 3 0 5 0 15 4 3 2 6 0 7 3 3 1 ...
result:
wrong answer 18th lines differ - expected: '5', found: '3'