oj.uz

Submission #876809

# Submission time Handle Problem Language Result Execution time Memory
876809 2023-11-22T11:16:45 Z marvinthang Land of the Rainbow Gold (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 << '}'; }

vector <vector <bool>> board;

void init(int R, int C, int sr, int sc, int M, char *S) {
    board.assign(R, vector<bool>(C));
    --sr; --sc;
    board[sr][sc] = true;
    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;
    }
    // REP(i, R) {
    //     REP(j, C) cout << board[i][j];
    //     cout << '\n';
    // }
}

int colour(int ar, int ac, int br, int bc) {
    // if (ar == 10) cout << ar << ' ' << ac << ' ' << br << ' ' << bc << '\n';
    ar -= 2; ac -= 2;
    auto exist = [&] (int x, int y) -> bool {
        if (x < ar || x > br || y < ac || y > bc) return false;
        if (x == ar || x == br || y == ac || y == bc) return true;
        return board[x][y];
    };
    // FORE(x, ar, br) {
    //     FORE(y, ac, bc) cout << exist(x, y) << ' ';
    //     cout << '\n';
    // }
    int res = 1;
    bool ok = false;
    bool ex = false;
    FORE(x, ar, br) FORE(y, ac, bc) if (exist(x, y)) {
        if (ar < x && x < br && ac < y && y < bc) {
            ex = true;
            if (x == ar + 1 || x == br - 1 || y == ac + 1 || y == bc - 1) ok = true;
        }
        --res;
        if (exist(x - 1, y)) ++res;
        if (exist(x, y - 1)) ++res;
        if (exist(x - 1, y - 1) && !exist(x - 1, y) && !exist(x, y - 1)) ++res;
        if (exist(x - 1, y + 1) && !exist(x - 1, y) && !exist(x, y + 1)) ++res;
        if (exist(x - 1, y) && exist(x, y - 1) && exist(x - 1, y - 1)) --res;
    }
    // cout << res << '\n';
    // cout << ex << ' ' << ok << '\n';
    return res + (ex && !ok);
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 5 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 1 ms 440 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 9 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 344 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Execution timed out 3055 ms 548 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 566 ms 1048576 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 5 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 1 ms 440 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 9 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 344 KB Output is correct
18 Execution timed out 3034 ms 1344 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 6 ms 604 KB Output is correct
5 Correct 5 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 1 ms 440 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 7 ms 348 KB Output is correct
13 Correct 7 ms 348 KB Output is correct
14 Correct 9 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 344 KB Output is correct
18 Execution timed out 3034 ms 1344 KB Time limit exceeded
19 Halted 0 ms 0 KB -