QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #314051 | #7733. Cool, It’s Yesterday Four Times More | gingoo | Compile Error | / | / | C++14 | 8.8kb | 2024-01-25 11:43:00 | 2024-01-25 11:43:01 |
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];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
for (int k = 1; k <= n; k++)
for (int l = 1; l <= m; l++)
mp[i][j][k][l] = 0;
for (int i = 1; i <= n; i++)
{
scanf("%s", ch[i] + 1);
}
bool vis[n + 1][m + 1];
for (int now = 1; now <= 1; now++)
{
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 k = 1; k <= n; k++)
{
for (int l = 1; l <= m; l++)
vis[k][l] = 0;
}
auto dfs = [&](auto self, int x, int y, int xx, int yy) -> bool
{
int flag = 0;
if (ch[xx][yy] == 'O' or xx < 1 or xx > n or yy < 1 or yy > m)
flag = 1;
vis[x][y] = 1;
for (int k = 0; k < 4; k++)
{
int xxx = x + dx[k];
int yyy = y + dy[k];
int xxxx = xx + dx[k];
int yyyy = yy + dy[k];
if (!vis[xxx][yyy] and xxx >= 1 and xxx <= n and yyy >= 1 and yyy <= m)
{
//if(xx==1 and yy==1 and x==1 and y==4) cout<<xxx<<" "<<yyy<<endl;
flag |= self(self, xxx, yyy, xxxx, yyyy);
}
}
if (ch[x][y] == 'O')
flag = 0;
if (flag)
mp[x][y][xx][yy] = 1;
return flag;
};
dfs(dfs, i, j, 1, 1);
for (int k = 1; k <= n; k++)
{
for (int l = 1; l <= m; l++)
vis[k][l] = 0;
}
dfs(dfs, 1, 1, i, j);
}
}
}
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 (!flag)
break;
//if(i==1 and j==4)cout<<'\n';
}
if (flag)
cnt++;
}
}
}
cout << cnt << '\n';
}
return 0;
}
Details
answer.code: In lambda function:
answer.code:164:29: sorry, unimplemented: capture of variably-modified type ‘char [(n + 1)][(m + 1)]’ that is not an N3639 array of runtime bound
164 | if (ch[xx][yy] == 'O' or xx < 1 or xx > n or yy < 1 or yy > m)
| ^~
answer.code:164:29: note: because the array element type ‘char [(m + 1)]’ has variable size
answer.code:166:25: sorry, unimplemented: capture of variably-modified type ‘bool [(n + 1)][(m + 1)]’ that is not an N3639 array of runtime bound
166 | vis[x][y] = 1;
| ^~~
answer.code:166:25: note: because the array element type ‘bool [(m + 1)]’ has variable size
answer.code:173:34: sorry, unimplemented: capture of variably-modified type ‘bool [(n + 1)][(m + 1)]’ that is not an N3639 array of runtime bound
173 | if (!vis[xxx][yyy] and xxx >= 1 and xxx <= n and yyy >= 1 and yyy <= m)
| ^~~
answer.code:173:34: note: because the array element type ‘bool [(m + 1)]’ has variable size
answer.code:179:29: sorry, unimplemented: capture of variably-modified type ‘char [(n + 1)][(m + 1)]’ that is not an N3639 array of runtime bound
179 | if (ch[x][y] == 'O')
| ^~
answer.code:179:29: note: because the array element type ‘char [(m + 1)]’ has variable size
answer.code:182:29: sorry, unimplemented: capture of variably-modified type ‘bool [(n + 1)][(m + 1)][(n + 1)][(m + 1)]’ that is not an N3639 array of runtime bound
182 | mp[x][y][xx][yy] = 1;
| ^~
answer.code:182:29: note: because the array element type ‘bool [(m + 1)][(n + 1)][(m + 1)]’ has variable size
answer.code: In function ‘int main()’:
answer.code:84:18: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
84 | scanf("%s", ch[i] + 1);
| ~~~~~^~~~~~~~~~~~~~~~~