oj.uz

Submission #200310

# Submission time Handle Problem Language Result Execution time Memory
200310 2020-02-06T09:28:23 Z Nordway Land of the Rainbow Gold (APIO17_rainbow) C++14
0 / 100
 20 ms 504 KB 
#include<bits/stdc++.h>
#include "rainbow.h"

#define x first
#define y second
#define pb push_back
#define sz(v) (int)v.size()

using namespace std;

const int N=1e3+11;
const int dx[4]={0,0,-1,1};
const int dy[4]={1,-1,0,0};

int n,m;
int x,y;
string s;
bool used[N][N];
bool us[2][200011];
int cnt[200011],p[2][200011];

void init(int R, int C, int sr, int sc, int M, char* S) {
  n=R;
  m=C;
  x=sr,y=sc;
  s=S;
  if(n==2){
    us[sr][sc]=1;
    for(int i=0;i<M;i++){
      if(s[i]=='N')sr--;
      if(s[i]=='S')sr++;
      if(s[i]=='W')sc--;
      if(s[i]=='E')sc++;
      us[sr][sc]=1;
    }
    int lst=0;
    for(int i=1;i<=m;i++){
      int cur=3;
      for(int j=1;j<=2;j++){
        if(us[j][i])cur^=(1<<(j-1));
      }
      if((lst&cur)==0&&cur>0)cnt[i]=cnt[i-1]+1;
      else cnt[i]=cnt[i-1];
      lst=cur;
    }
    for(int i=1;i<=2;i++){
      for(int j=1;j<=m;j++){
        if(us[i][j]==0)p[i][j]=p[i][j-1];
        else if(us[i][j-1]==1)p[i][j]=p[i][j-1];
        else p[i][j]=p[i][j-1]+1;
      }
    }
  }
}

void dfs(int r,int c){
  used[r][c]=1;
  //cout<<r<<" "<<c<<endl;
  for(int i=0;i<4;i++){
    int nx=r+dx[i],ny=c+dy[i];
    if(used[nx][ny])continue;
    dfs(nx,ny);
  }
}

int colour(int ar, int ac, int br, int bc) {
  if(n==2){
    if(ar==br){
      return p[ar][bc]-p[ar][ac-1];
    }
    else{
      return cnt[bc]-cnt[ac-1];
    }
  }
  else if(max(n,m)<=50){
    int ans=0;
    for(int i=0;i<=n+1;i++){
      for(int j=0;j<=m+1;j++){
        if(ar<=i&&i<=br&&ac<=j&&j<=bc){
          used[i][j]=0;
          continue;
        }
        used[i][j]=1;
      }
    }
    int sr=x,sc=y;
    used[sr][sc]=1;
    for(int i=0;i<sz(s);i++){
      if(s[i]=='N')sr--;
      if(s[i]=='S')sr++;
      if(s[i]=='W')sc--;
      if(s[i]=='E')sc++;
      used[sr][sc]=1;
    }
   /* for(int i=0;i<=n+1;i++){
      for(int j=0;j<=m+1;j++){
        cout<<used[i][j];
      }
      cout<<endl;
    }*/
    for(int i=ar;i<=br;i++){
      for(int j=ac;j<=bc;j++){
        if(!used[i][j]){
          dfs(i,j);
          //cout<<endl;
          ans++;
        }
      }
    }
    return ans;
  }
}

Compilation message

rainbow.cpp: In function 'int colour(int, int, int, int)':
rainbow.cpp:112:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
rainbow.cpp: In function 'void init(int, int, int, int, int, char*)':
rainbow.cpp:40:19: warning: iteration 1 invokes undefined behavior [-Waggressive-loop-optimizations]
         if(us[j][i])cur^=(1<<(j-1));
            ~~~~~~~^
rainbow.cpp:39:20: note: within this loop
       for(int j=1;j<=2;j++){
                   ~^~~
rainbow.cpp:40:16: warning: array subscript is above array bounds [-Warray-bounds]
         if(us[j][i])cur^=(1<<(j-1));
            ~~~~^
rainbow.cpp:40:16: warning: array subscript is above array bounds [-Warray-bounds]

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 15 ms 376 KB Output is correct
3 Correct 17 ms 504 KB Output is correct
4 Correct 17 ms 376 KB Output is correct
5 Correct 16 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 7 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 20 ms 376 KB Output is correct
12 Correct 19 ms 376 KB Output is correct
13 Correct 15 ms 376 KB Output is correct
14 Correct 18 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Incorrect 5 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

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

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 15 ms 376 KB Output is correct
3 Correct 17 ms 504 KB Output is correct
4 Correct 17 ms 376 KB Output is correct
5 Correct 16 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 7 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 20 ms 376 KB Output is correct
12 Correct 19 ms 376 KB Output is correct
13 Correct 15 ms 376 KB Output is correct
14 Correct 18 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Incorrect 5 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 15 ms 376 KB Output is correct
3 Correct 17 ms 504 KB Output is correct
4 Correct 17 ms 376 KB Output is correct
5 Correct 16 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 7 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 20 ms 376 KB Output is correct
12 Correct 19 ms 376 KB Output is correct
13 Correct 15 ms 376 KB Output is correct
14 Correct 18 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Incorrect 5 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -