제출 #106443

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
106443		polyfish	무지개나라 (APIO17_rainbow)	C++14	11 / 100	3045 ms	81912 KiB

rainbow

#include "rainbow.h"
#include <bits/stdc++.h>
using namespace std;

#define debug(x) cerr << #x << " = " << x << '\n';
#define BP() cerr << "OK!\n";
#define PR(A, n) {cerr << #A << " = "; for (int _=1; _<=n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define PR0(A, n) {cerr << #A << " = "; for (int _=0; _<n; ++_) cerr << A[_] << ' '; cerr << '\n';}
#define FILE_NAME "data"

const int X[] = {-1, 0, 1, 0};
const int Y[] = {0, -1, 0, 1};

int m, n;
vector<pair<int, int> > snake;
bool visited[52][52];

void init(int R, int C, int sr, int sc, int M, char *S) {
    m = R;
    n = C;

    snake.resize(M+1);
    snake[0] = {sr, sc};
    for (int i=1; i<=M; ++i) {
        snake[i] = snake[i-1];
        if (S[i-1]=='N')
            --snake[i].first;
        else if (S[i-1]=='S')
            ++snake[i].first;
        else if (S[i-1]=='W')
            --snake[i].second;
        else
            ++snake[i].second;
    }

    sort(snake.begin(), snake.end());
    snake.resize(unique(snake.begin(), snake.end()) - snake.begin());
}

void visit(int u, int v, int x1, int y1, int x2, int y2) {
    visited[u][v] = true;

    for (int i=0; i<4; ++i) {
        int p = u + X[i], q = v + Y[i];
        if (x1<=p && p<=x2 && y1<=q && q<=y2 && !visited[p][q])
            visit(p, q, x1, y1, x2, y2);
    }
}

int subtask1(int x1, int y1, int x2, int y2) {
    memset(visited, false, sizeof(visited));

    for (auto p : snake)
        visited[p.first][p.second] = true;

    int res = 0;

    for (int i=x1; i<=x2; ++i) {
        for (int j=y1; j<=y2; ++j) {
            if (!visited[i][j]) {
                ++res;
                visit(i, j, x1, y1, x2, y2);
            }
        }
    }

    return res;
}

int subtask3(int x1, int y1, int x2, int y2) {
    set<pair<int, int> > v;
    set<pair<pair<int, int>, pair<int, int> > > e;

    ///find all vertices
    for (int i=y1-1; i<=y2+1; ++i) {
        v.insert({x1-1, i});
        v.insert({x2+1, i});
    }
    for (int i=x1-1; i<=x2+1; ++i) {
        v.insert({i, y1-1});
        v.insert({i, y2+1});
    }
    for (auto p : snake) {
        if (x1<=p.first && p.first<=x2 && y1<=p.second && p.second<=y2)
            v.insert(p);
    }
//    debug(v.size());

    ///find all edges
    for (auto p : v) {
        for (int i=0; i<4; ++i) {
            pair<int, int> q(p.first+X[i], p.second+Y[i]);
            if (v.count(q))
                e.insert({min(p, q), max(p, q)});
        }
    }
//    debug(e.size());

    int res = (int)e.size() - (int)v.size() + 1;

    for (auto p : v) {
        if (v.count({p.first+1, p.second}) && v.count({p.first, p.second+1})
            && v.count({p.first+1, p.second+1}))
            --res;
    }

    return res;
}

int colour(int x1, int y1, int x2, int y2) {
    if (m<=50 && n<=50)
        return subtask1(x1, y1, x2, y2);
    else
        return subtask3(x1, y1, x2, y2);
}

//int main() {
//    freopen("rainbow.in", "r", stdin);
//    freopen("rainbow.out", "w", stdout);
//    int R, C, M, Q, sr, sc;
//    static char S[100 + 5];
//    scanf("%d %d %d %d", &R, &C, &M, &Q);
//    scanf("%d %d", &sr, &sc);
//    if (M > 0) {
//        scanf(" %s ", S);
//    }
//
//    init(R, C, sr, sc, M, S);
//
//    int query;
//    for (query = 0; query < Q; query++) {
//        int ar, ac, br, bc;
//        scanf("%d %d %d %d", &ar, &ac, &br, &bc);
//        printf("%d\n", colour(ar, ac, br, bc));
//    }
//
//    return 0;
//}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 12
• Subtask 3: 0 / 24
• Subtask 4: 0 / 27
• Subtask 5: 0 / 26