oj.uz

Submission #900242

# Submission time Handle Problem Language Result Execution time Memory
900242 2024-01-08T01:00:01 Z vjudge1 Land of the Rainbow Gold (APIO17_rainbow) C++17
12 / 100
 46 ms 6516 KB 
#include "rainbow.h"

#include <iostream>
#include <vector>
using namespace std;

vector<vector<bool>> land;
vector<int> acum[3];

void init(int R, int C, int sr, int sc, int M, char *S) {
    char c;
    acum[0].resize(C + 1);
    acum[1].resize(C + 1);
    acum[2].resize(C + 1);
    land = vector<vector<bool>>(R + 1, vector<bool>(C + 1, true));
    land[sr][sc] = false;
    land[1][0] = land[2][0] = false;
    for (int i = 0; i < M; i++) {
        c = S[i];
        if (c == 'N')
            sr--;
        else if (c == 'S')
            sr++;
        else if (c == 'W')
            sc--;
        else
            sc++;
        land[sr][sc] = false;
    }

    acum[0][0] = acum[1][0] = acum[2][0] = 0;

    for (int r = 1; r <= R; r++) {
        for (int i = 1; i <= C; i++) {
            acum[r][i] = acum[r][i - 1];
            if (land[r][i] && !land[r][i - 1])
                acum[r][i]++;
        }
    }
    for (int i = 1; i <= C; i++) {
        acum[0][i] = acum[0][i - 1];
        if (!land[1][i - 1] && !land[2][i - 1] && (land[1][i] || land[2][i]))
            acum[0][i]++;
        if (land[1][i] && !land[1][i - 1] && !land[2][i] && land[2][i - 1])
            acum[0][i]++;
        if (!land[1][i] && land[1][i - 1] && land[2][i] && !land[2][i - 1])
            acum[0][i]++;
    }

    land[1][0] = land[2][0] = true;
}

int colour(int ar, int ac, int br, int bc) {
    int ans = 0;
    if (ar == br) {
        ans = acum[ar][bc] - acum[ar][ac];
        if (land[ar][ac])
            ans++;
    } else {
        ans = acum[0][bc] - acum[0][ac];
        if (land[1][ac] || land[2][ac])
            ans++;
    }
    return ans;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 41 ms 6000 KB Output is correct
4 Correct 41 ms 6480 KB Output is correct
5 Correct 43 ms 6480 KB Output is correct
6 Correct 41 ms 6436 KB Output is correct
7 Correct 41 ms 6516 KB Output is correct
8 Correct 46 ms 6396 KB Output is correct
9 Correct 41 ms 6480 KB Output is correct
10 Correct 44 ms 6484 KB Output is correct
11 Correct 41 ms 6492 KB Output is correct
12 Correct 40 ms 6484 KB Output is correct
13 Correct 40 ms 6484 KB Output is correct
14 Correct 42 ms 6504 KB Output is correct
15 Correct 42 ms 6480 KB Output is correct
16 Correct 42 ms 6484 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -