oj.uz

Submission #100410

# Submission time Handle Problem Language Result Execution time Memory
100410 2019-03-11T04:57:47 Z 1Khan Land of the Rainbow Gold (APIO17_rainbow) C++14
0 / 100
 101 ms 10360 KB 
// In the name of GOD

#include "rainbow.h"

#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;

#define BeGood ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define orset tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define nl '\n'
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define pb push_back

typedef long long ll;
typedef double db;

const int N = 1e4 + 5;
//const int M = 1e9 + 7;

int a[1111][1111];
void init(int R, int C, int sr, int sc, int M, char *S){

     int n = R;
     int k = C;
     int x = sr;
     int y = sc;
     int slen = M;

          for(int i = 1; i <= n; ++i){
               for(int j = 1; j <= k; ++j){
                    a[i][j] = 0;
               }
          }
          for(int i = 0; i < slen; ++i){
               a[x][y] = 1;
               if(S[i] == 'N'){
                    x--;
               }
               if(S[i] == 'W'){
                    y--;
               }
               if(S[i] == 'S'){
                    x++;
               }
               if(S[i] == 'E'){
                    y++;
               }
          }
          a[x][y] = 1;
}

int colour(int ar, int ac, int br, int bc){
     int x1 = ar;
     int x2 = br;
     int y1 = ac;
     int y2 = bc;
               int b[111][111];
               for(int i = x1 - 1; i <= x2 + 1; ++i){
                    for(int j = y1 - 1; j <= y2 + 1; ++j){
                         b[i][j] = 0;
                    }
               }
               int ans = 0;
               for(int i = x1; i <= x2; ++i){
                    for(int j = y1; j <= y2; ++j){
                         if(a[i][j] == 0){
                              int q = 0;
                              if(b[i][j - 1] == 2 || b[i][j + 1] == 2 || b[i + 1][j] == 2 || b[i - 1][j] == 2){
                                   q++;
                              }
                              if(!q){
                                   ans++;
                              }
                              b[i][j] = 2;
                              if(!a[i][j + 1]){
                                   b[i][j + 1] = 2;
                              }
                              if(!a[i][j - 1]){
                                   b[i][j - 1] = 2;
                              }
                              if(!a[i + 1][j]){
                                   b[i + 1][j] = 2;
                              }
                              if(!a[i - 1][j]){
                                   b[i - 1][j] = 2;
                              }
                         }
                    }
               }
     return ans;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Incorrect 6 ms 640 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Runtime error 5 ms 2304 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Runtime error 101 ms 10360 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Incorrect 6 ms 640 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Incorrect 6 ms 640 KB Output isn't correct
4 Halted 0 ms 0 KB -