oj.uz

답안 #974051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974051 2024-05-02T16:35:41 Z colossal_pepe 무지개나라 (APIO17_rainbow) C++17
11 / 100
 10 ms 504 KB 
#include "rainbow.h"
#include <bits/stdc++.h>
using namespace std;

struct DSU {
    vector<int> e;
    DSU(int sz) {
        e.resize(sz, -1);
    }
    int find(int x) {
        return (e[x] < 0 ? x : e[x] = find(e[x]));
    }
    bool merge(int x, int y) {
        x = find(x), y = find(y);
        if (x == y) return 0;
        if (-e[x] < -e[y]) swap(x, y);
        e[x] += e[y], e[y] = x;
        return 1;
    }
};

vector<vector<bool>> g;

void init(int R, int C, int sr, int sc, int M, char *S) {
    if (R > 50 or C > 50) exit(0);
    g.resize(R, vector<bool>(C, 1));
    g[--sr][--sc] = 0;
    for (int i = 0; i < M; i++) {
        if (S[i] == 'N') sr--;
        if (S[i] == 'S') sr++;
        if (S[i] == 'E') sc++;
        if (S[i] == 'W') sc--;
        g[sr][sc] = 0;
    }
}

int colour(int ar, int ac, int br, int bc) {
    ar--, ac--, br--, bc--;
    auto id = [ar, ac, br, bc](int i, int j) {
        return (i - ar) * (bc - ac + 1) + j - ac;
    };
    int comps = (br - ar + 1) * (bc - ac + 1);
    DSU dsu = DSU(comps);
    for (int i = ar; i <= br; i++) {
        for (int j = ac; j <= bc; j++) {
            if (not g[i][j]) {
                comps--;
                continue;
            }
            if (j + 1 <= bc and g[i][j + 1]) comps -= dsu.merge(id(i, j), id(i, j + 1));
            if (i + 1 <= br and g[i + 1][j]) comps -= dsu.merge(id(i, j), id(i + 1, j));
        }
    }
    return comps;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 9 ms 348 KB Output is correct
4 Correct 10 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 504 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 9 ms 348 KB Output is correct
4 Correct 10 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 1 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 9 ms 348 KB Output is correct
4 Correct 10 ms 344 KB Output is correct
5 Correct 3 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 7 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Incorrect 1 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -