Submission #562628

#	Time	Username	Problem	Language	Result	Execution time	Memory
562628		SSRS	Land of the Rainbow Gold (APIO17_rainbow)	C++14	11 / 100	3076 ms	1048576 KiB

rainbow

#include <bits/stdc++.h>
#include "rainbow.h"
using namespace std;
vector<int> dx = {1, 0, -1, 0};
vector<int> dy = {0, 1, 0, -1};
vector<vector<bool>> land;
void init(int R, int C, int sr, int sc, int M, char *S){
  sr--;
  sc--;
  land = vector<vector<bool>>(R, vector<bool>(C, true));
  int x = sr, y = sc;
  land[x][y] = false;
  for (int i = 0; i < M; i++){
    if (S[i] == 'N'){
      x--;
    }
    if (S[i] == 'S'){
      x++;
    }
    if (S[i] == 'E'){
      y++;
    }
    if (S[i] == 'W'){
      y--;
    }
    land[x][y] = false;
  }
}
int colour(int ar, int ac, int br, int bc){
  ar--;
  ac--;
  int R = land.size();
  int C = land[0].size();
  vector<vector<bool>> used(R, vector<bool>(C, false));
  int ans = 0;
  for (int i = ar; i < br; i++){
    for (int j = ac; j < bc; j++){
      if (land[i][j] && !used[i][j]){
        ans++;
        used[i][j] = true;
        queue<pair<int, int>> Q;
        Q.push(make_pair(i, j));
        while (!Q.empty()){
          int x = Q.front().first;
          int y = Q.front().second;
          Q.pop();
          for (int k = 0; k < 4; k++){
            int x2 = x + dx[k];
            int y2 = y + dy[k];
            if (ar <= x2 && x2 < br && ac <= y2 && y2 < bc){
              if (land[x2][y2] && !used[x2][y2]){
                used[x2][y2] = true;
                Q.push(make_pair(x2, y2));
              }
            }
          }
        }
      }
    }
  }
  return ans;
}

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