oj.uz

답안 #876872

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876872 2023-11-22T12:49:23 Z marvinthang 무지개나라 (APIO17_rainbow) C++17
11 / 100
 3000 ms 1048576 KB 
/*************************************
*    author: marvinthang             *
*    created: 22.11.2023 16:30:03    *
*************************************/

#include "rainbow.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

int R, C;
vector <vector <bool>> board;
vector <vector <int>> rows, cols;

void init(int r, int c, int sr, int sc, int M, char *S) {
    R = r; C = c;
    rows.resize(R);
    cols.resize(C);
    --sr; --sc;
    board.assign(R, vector<bool>(C));
    board[sr][sc] = true;
    rows[sr].push_back(sc);
    cols[sc].push_back(sr);
    REP(i, M) {
        if (S[i] == 'N') --sr;
        else if (S[i] == 'S') ++sr;
        else if (S[i] == 'W') --sc;
        else ++sc;
        board[sr][sc] = true;
        rows[sr].push_back(sc);
        cols[sc].push_back(sr);
    }
    // vector <int> exist(C);
    REP(r, R) {
        sort(ALL(rows[r]));
        rows[r].erase(unique(ALL(rows[r])), rows[r].end());
    }
    REP(c, C) {
        sort(ALL(cols[c]));
        cols[c].erase(unique(ALL(cols[c])), cols[c].end());
    }
}

bool exist(int x, int y) {
    return binary_search(ALL(rows[x]), y);
}

int colour(int ar, int ac, int br, int bc) {
    --ar; --ac; --br; --bc;
    bool ex = false;
    int cnt_border = 0;
    for (int r: {ar, br}) cnt_border += upper_bound(ALL(rows[r]), bc) - lower_bound(ALL(rows[r]), ac);
    for (int c: {ac, bc}) cnt_border += upper_bound(ALL(cols[c]), br) - lower_bound(ALL(cols[c]), ar);
    int res = 0;
    int cnt_square = exist(ar, ac) + exist(ar, bc) + exist(br, ac) + exist(br, bc);

    FORE(x, ar, br) FORE(y, ac, bc) if (board[x][y]) {
        ex = true;
        --res;
        if (x == ar) {
            if (y > ac && board[x][y - 1]) ++cnt_square;
        } else res += board[x - 1][y];
        if (x == br) {
            if (y > ac && board[x][y - 1]) ++cnt_square;
        }
        if (y == ac) {
            if (x > ar && board[x - 1][y]) ++cnt_square;
        } else res += board[x][y - 1];
        if (y == bc) {
            if (x > ar && board[x - 1][y]) ++cnt_square;
        }
        if (x > ar && y > ac && board[x - 1][y - 1] && !board[x - 1][y] && !board[x][y - 1]) ++res;
        if (x > ar && y < bc && board[x - 1][y + 1] && !board[x - 1][y] && !board[x][y + 1]) ++res;
        if (x > ar && y > ac && board[x - 1][y - 1] && board[x - 1][y] && board[x][y - 1]) ++cnt_square;
    }
    return 1 + cnt_border + res - cnt_square + (ex && !cnt_border);
}

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 2 ms 348 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 3 ms 520 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 352 KB Output is correct
14 Correct 5 ms 352 KB Output is correct
15 Correct 1 ms 440 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 356 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Execution timed out 3039 ms 8168 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 440 KB Output is correct
2 Runtime error 437 ms 1048576 KB Execution killed with signal 9
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 2 ms 348 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 3 ms 520 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 352 KB Output is correct
14 Correct 5 ms 352 KB Output is correct
15 Correct 1 ms 440 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 356 KB Output is correct
18 Execution timed out 3036 ms 2428 KB Time limit exceeded
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 2 ms 348 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 3 ms 520 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 500 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 352 KB Output is correct
14 Correct 5 ms 352 KB Output is correct
15 Correct 1 ms 440 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 356 KB Output is correct
18 Execution timed out 3036 ms 2428 KB Time limit exceeded
19 Halted 0 ms 0 KB -