oj.uz

답안 #901655

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
901655 2024-01-09T21:35:25 Z shezitt 무지개나라 (APIO17_rainbow) C++14
23 / 100
 3000 ms 1048576 KB 
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
#define ii pair<int,int>
#define dbg(x) cerr << #x << ": " << x << endl;
#define raya cerr << "=================" << endl;

const int N = 2e5+5;
vector<vector<int>> grid;
int rows, cols;

map<char,ii> to = {{'N', {-1, 0}}, {'S', {1, 0}}, {'W', {0, -1}}, {'E', {0, 1}}};

int arriba[N], abajo[N], ambos[N];

void init(int R, int C, int sr, int sc, int M, char *s){
    rows = R;
    cols = C;
    sr--, sc--;

    if(rows == 2){
        grid.assign(3, vector<int>(cols+1, 0));
    } else {
        grid.assign(rows+1, vector<int>(cols+1, 0));
    }

    ii pos = {sr, sc};
    grid[pos.first][pos.second] = 1;
    for(int i=0; i<M; ++i){
        char c = s[i];
        pos.first += to[c].first;
        pos.second += to[c].second;
        grid[pos.first][pos.second] = 1;
    }

    if(rows == 2){
        // subtask 2
        arriba[0] = (grid[0][0] == 0);
        abajo[0] = (grid[1][0] == 0);
        for(int i=1; i<cols; ++i){
            arriba[i] = (grid[0][i-1] == 1 && grid[0][i] == 0);
            abajo[i] = (grid[1][i-1] == 1 && grid[1][i] == 0);
        }
        for(int i=1; i<cols; ++i){
            arriba[i] += arriba[i-1];
            abajo[i] += abajo[i-1];
        }
        // ambos
        ambos[0] = (grid[0][0] == 0 && grid[1][0] == 0);
        for(int i=1; i<cols; ++i){
            if(grid[0][i-1] == 1 or grid[1][i-1] == 1){
                ambos[i] = (grid[0][i] == 0 && grid[1][i] == 0);
            }
        }
        for(int i=1; i<cols; ++i){
            ambos[i] += ambos[i-1];
        }
    }

}

void clear(){
    for(int i=0; i<rows; ++i){
        for(int j=0; j<cols; ++j){
            if(grid[i][j] == 2) grid[i][j] = 0;
        }
    }
}

vector<ii> mov = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

void dfs(int i, int j, int ar, int ac, int br, int bc){
    for(auto tmp : mov){
        int ni = i + tmp.first;
        int nj = j + tmp.second;
        if(ni >= ar && ni <= br && nj >= ac && nj <= bc && grid[ni][nj] == 0){
            grid[ni][nj] = 2;
            dfs(ni, nj, ar, ac, br, bc);
        }
    }
}

int colour(int ar, int ac, int br, int bc){

    ar--, ac--;
    br--, bc--;

    if(rows == 2){
        // subtask 2
        if(ar+1 == br){
            // ambos
            int res = arriba[bc] + abajo[bc];
            int quitar = ambos[bc];
            if(ac > 0){
                res -= arriba[ac-1] - (grid[0][ac-1] == 0 && grid[0][ac] == 0);
                res -= abajo[ac-1] - (grid[1][ac-1] == 0 && grid[1][ac] == 0);
                quitar -= ambos[ac-1] - (grid[0][ac-1] == 0 && grid[0][ac] == 0 && grid[1][ac-1] == 0 && grid[1][ac] == 0);
            }
            res -= quitar;
            return res;
        }
        // arriba
        if(ar == 0){
            int res = arriba[bc];
            if(ac > 0){
                res -= arriba[ac-1] - (grid[0][ac-1] == 0 && grid[0][ac] == 0);
            }
            return res;
        }
        // abajo
        assert(ar == 1);
        int res = abajo[bc];
        if(ac > 0){
            res -= abajo[ac-1] - (grid[1][ac-1] == 0 && grid[1][ac] == 0);
        }
        return res;
    }

    // subtask 1
    int ans = 0;
    for(int i=ar; i<=br; ++i){
        for(int j=ac; j<=bc; ++j){
            if(grid[i][j] == 0){
                ans++;
                grid[i][j] = 2;
                dfs(i, j, ar, ac, br, bc);
            }
        }
    }
    clear();
    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 45 ms 8256 KB Output is correct
4 Correct 52 ms 8772 KB Output is correct
5 Correct 56 ms 8768 KB Output is correct
6 Correct 46 ms 8764 KB Output is correct
7 Correct 46 ms 8764 KB Output is correct
8 Correct 56 ms 8768 KB Output is correct
9 Correct 46 ms 8780 KB Output is correct
10 Correct 46 ms 8732 KB Output is correct
11 Correct 46 ms 8768 KB Output is correct
12 Correct 46 ms 8512 KB Output is correct
13 Correct 43 ms 8764 KB Output is correct
14 Correct 43 ms 8576 KB Output is correct
15 Correct 43 ms 8764 KB Output is correct
16 Correct 46 ms 8760 KB Output is correct

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 518 ms 1048576 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 11 ms 604 KB Output is correct
4 Correct 11 ms 600 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 11 ms 576 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 5 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Execution timed out 3030 ms 13392 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 11 ms 604 KB Output is correct
4 Correct 11 ms 600 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 11 ms 576 KB Output is correct
12 Correct 9 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 5 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Execution timed out 3030 ms 13392 KB Time limit exceeded
19 Halted 0 ms 0 KB -