QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#485423#9108. Zayin and Obstaclespropane#AC ✓156ms12924kbC++202.2kb2024-07-20 17:32:542024-07-20 17:32:54

Judging History

你现在查看的是最新测评结果

  • [2024-07-20 17:32:54]
  • 评测
  • 测评结果:AC
  • 用时:156ms
  • 内存:12924kb
  • [2024-07-20 17:32:54]
  • 提交

answer

#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<array>
using namespace std;
using LL = long long;
int s[105][105][105];
int d[105][105][105];

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        memset(s, 0, sizeof s);
        memset(d, -1, sizeof d);
        int n, m;
        cin >> n >> m;
        for(int i = 0; i < m; i++){
            int a, b, c, d, e, f;
            cin >> a >> b >> c >> d >> e >> f;
            s[a][b][c] += 1;
            s[a][b][f + 1] -= 1;
            s[a][e + 1][c] -= 1;
            s[d + 1][b][c] -= 1;
            s[a][e + 1][f + 1] += 1;
            s[d + 1][b][f + 1] += 1;
            s[d + 1][e + 1][c] += 1;
            s[d + 1][e + 1][f + 1] -= 1;
        }
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                for(int k = 1; k <= n; k++){
                    s[i][j][k] +=  s[i - 1][j][k] + s[i][j - 1][k] + s[i][j][k - 1]
                                 - s[i - 1][j - 1][k] - s[i - 1][j][k - 1] - s[i][j - 1][k - 1] + s[i - 1][j - 1][k - 1];
                }
            }
        }
        int x1, y1, z1, x2, y2, z2;
        cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2;
        queue<array<int, 3> > q;
        if (!s[x1][y1][z1]){
            q.push({x1, y1, z1});
            d[x1][y1][z1] = 0;
        }
        const int dx[6] = {1, -1, 0, 0, 0, 0};
        const int dy[6] = {0, 0, 1, -1, 0, 0};
        const int dz[6] = {0, 0, 0, 0, 1, -1};

        while(!q.empty()){
            auto [x, y, z] = q.front();
            q.pop();
            for(int u = 0; u < 6; u++){
                int nx = x + dx[u];
                int ny = y + dy[u];
                int nz = z + dz[u];
                if (nx <= 0 or nx > n or ny <= 0 or ny > n or nz <= 0 or nz > n) continue;
                if (s[nx][ny][nz] == 0 and d[nx][ny][nz] == -1){
                    q.push({nx, ny, nz});
                    d[nx][ny][nz] = d[x][y][z] + 1;
                }
            }
        }
        cout << d[x2][y2][z2] << '\n';
    }

}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 12924kb

input:

3
3 0
1 1 1 3 3 3
3 1
2 1 1 2 3 3
1 1 1 3 3 3
3 3
2 1 1 2 2 3
1 1 2 2 3 2
1 2 2 3 3 2
1 1 1 1 1 3

output:

6
-1
14

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 15ms
memory: 12892kb

input:

5
19 27
2 1 1 2 18 19
4 2 1 4 19 19
6 1 1 6 18 19
8 2 1 8 19 19
10 1 1 10 18 19
12 2 1 12 19 19
14 1 1 14 18 19
16 2 1 16 19 19
18 1 1 18 18 19
1 1 2 18 19 2
2 1 4 19 19 4
1 1 6 18 19 6
2 1 8 19 19 8
1 1 10 18 19 10
2 1 12 19 19 12
1 1 14 18 19 14
2 1 16 19 19 16
1 1 18 18 19 18
1 2 2 19 19 2
1 2 4 ...

output:

1998
15998
53998
127998
249998

result:

ok 5 lines

Test #3:

score: 0
Accepted
time: 41ms
memory: 12684kb

input:

5
99 147
2 1 1 2 98 99
4 2 1 4 99 99
6 1 1 6 98 99
8 2 1 8 99 99
10 1 1 10 98 99
12 2 1 12 99 99
14 1 1 14 98 99
16 2 1 16 99 99
18 1 1 18 98 99
20 2 1 20 99 99
22 1 1 22 98 99
24 2 1 24 99 99
26 1 1 26 98 99
28 2 1 28 99 99
30 1 1 30 98 99
32 2 1 32 99 99
34 1 1 34 98 99
36 2 1 36 99 99
38 1 1 38 9...

output:

132878
2596
227782
37198
90672

result:

ok 5 lines

Test #4:

score: 0
Accepted
time: 14ms
memory: 12688kb

input:

5
99 1000
2 1 1 2 98 99
4 2 1 4 99 99
6 1 1 6 98 99
8 2 1 8 99 99
10 1 1 10 98 99
12 2 1 12 99 99
14 1 1 14 98 99
16 2 1 16 99 99
18 1 1 18 98 99
20 2 1 20 99 99
22 1 1 22 98 99
24 2 1 24 99 99
26 1 1 26 98 99
28 2 1 28 99 99
30 1 1 30 98 99
32 2 1 32 99 99
34 1 1 34 98 99
36 2 1 36 99 99
38 1 1 38 ...

output:

4998
4998
4998
4998
4998

result:

ok 5 lines

Test #5:

score: 0
Accepted
time: 28ms
memory: 12580kb

input:

5
19 1000
2 1 1 2 18 19
4 2 1 4 19 19
6 1 1 6 18 19
8 2 1 8 19 19
10 1 1 10 18 19
12 2 1 12 19 19
14 1 1 14 18 19
16 2 1 16 19 19
18 1 1 18 18 19
4 13 10 4 19 12
6 5 5 6 6 18
6 16 4 6 18 11
8 6 10 8 17 19
14 10 7 14 17 12
2 4 4 2 5 15
4 5 10 4 7 17
12 1 2 12 2 9
12 8 10 12 18 15
16 19 2 16 19 8
8 1 ...

output:

-1
798
1906
3198
4998

result:

ok 5 lines

Test #6:

score: 0
Accepted
time: 156ms
memory: 12840kb

input:

5
100 0
92 81 37 11 85 14
100 0
16 48 91 61 65 58
100 0
87 25 52 83 7 45
100 0
80 95 16 62 5 80
100 0
33 33 50 48 82 3

output:

108
95
29
172
111

result:

ok 5 lines