oj.uz

답안 #945137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945137 2024-03-13T12:42:07 Z TAhmed33 무지개나라 (APIO17_rainbow) C++
0 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
#include "rainbow.h"
using namespace std;
bool ok[51][51];
int dx[4] = {0, -1, 0, 1}, dy[4] = {1, 0, -1, 0};
int mny, mxy, mnx, mxx;
map <char, int> lk = {
    {'E', 0},
    {'N', 1},
    {'W', 2},
    {'S', 3}
};
int n, m;
void init (int N, int M, int x, int y, int z, char *s) {
    n = N; m = M;
    x--; y--;
    for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) ok[i][j] = 1;
    ok[x][y] = 0;
    mny = mxy = y; mnx = mxx = x;
    for (int i = 0; i < z; i++) {
        x += dx[lk[s[i]]]; y += dy[lk[s[i]]];
        mny = min(mny, y);
        mxy = max(mxy, y);
        mnx = min(mnx, x);
        mxx = max(mxx, x);
        ok[x][y] = 0;
    }
    /*for (int i = 0; i < n; i++) {
    	for (int j = 0; j < m; j++) {
    		cout << ok[i][j];
    	}
    	cout << '\n';
    }*/
}
int colour (int ar, int ac, int br, int bc) {
    ar--; br--; ac--; bc--;
    if (ar > br) swap(ar, br);
    if (ac > bc) swap(ac, bc);
    //cout << ar << " " << ac << ": " << br << " " << bc << '\n';
    int v = 0, e = 0, f = 0;
    for (int i = ar; i <= br; i++) {
        for (int j = ac; j <= bc; j++) {
            if (!ok[i][j]) continue;
            v++;
        }
    }
    for (int i = ar; i <= br; i++) {
        for (int j = ac; j <= bc; j++) {
            if (!ok[i][j]) continue;
            if (i < br) if (ok[i + 1][j]) e++;
            if (j < bc) if (ok[i][j + 1]) e++;
            if (i < br && j < bc) if (ok[i + 1][j] && ok[i][j + 1] && ok[i + 1][j + 1]) f++;
        }
    }
    if (ar > mnx && br < mxx && ac > mny && bc < mxy) f++;
    return v - e + f;
}

Subtask #1
0 / 11.0

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

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 Runtime error 1 ms 600 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

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

Subtask #4
0 / 27.0

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

Subtask #5
0 / 26.0

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