#include <bits/stdc++.h>
#include <rainbow.h>
using namespace std;
long long b[323567],c[323456],a[323][456],tt,d[334564],e[456744];
long long x,m,n,t,k,l;
long long i , j,r,s,y,z;
string p;
queue<pair<long long,long long>> q,qq;
void init(int R, int C, int sr, int sc, int M, char *S) {
n=R;
m=C;
x=sr;
y=sc;
l=M;
tt=1456785678;
a[x][y]=tt;
for (i = 0; i<l; i ++){
if (S[i]=='N')
x--;
if (S[i]=='S')
x++;
if (S[i]=='W')
y--;
if (S[i]=='E')
y++;
a[x][y]=tt;
}
}
int colour(int ar, int ac, int br, int bc) {
x=ar;
y=ac;
l=br;
r=bc;
for (i = 1; i <=k ; i ++){
//cin >> x>>y>>l>>r;
s=0;
for (j = x; j<=l; j++){
for (z = y; z<=r;z++){
if (a[j][z]>= i){
continue;
}
s++;
q=qq;
q.push({j,z});
while(q.size()){
long long xx=q.front().first;
long long yy=q.front().second;
q.pop();
if (xx+1<=l&&a[xx+1][yy]<i){
q.push({xx+1,yy});
a[xx+1][yy]=i;
}
if (xx-1>=x&&a[xx-1][yy]<i){
a[xx-1][yy]=i;
q.push({xx-1,yy});}
if (yy+1<=r&&a[xx][yy+1]<i){
a[xx][yy+1]=i;
q.push({xx,yy+1});}
if (yy-1>=y&&a[xx][yy-1]<i){
a[xx][yy-1]=i;
q.push({xx,yy-1});}
}
}
}
return s;
//cout <<s<<endl;
}
}
Compilation message
rainbow.cpp: In function 'int colour(int, int, int, int)':
rainbow.cpp:71:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Runtime error |
3 ms |
768 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |