oj.uz

Submission #435027

# Submission time Handle Problem Language Result Execution time Memory
435027 2021-06-22T20:27:51 Z hossain2020 Land of the Rainbow Gold (APIO17_rainbow) C++14
0 / 100
 775 ms 907644 KB 
#include "rainbow.h"
#include <bits/stdc++.h>
int a[200005][1000],h=1,b[200005][1000],o=0,r,c;
void init(int R, int C, int sr, int sc, int m, char *s)
{
    r=R;
    c=C;
    a[sr][sc]=1;
    int x=sr,y=sc;
    b[x][y]=-1;
    for (int i=0;i<m;i++)
    {
        if (*s=='W')x--;
        else if (*s=='E')x++;
        else if (*s=='N')y--;
        else y++;
        a[x][y]=1;
        b[x][y]=-1;
        s++;
    }
}
void vis(int i,int j,int ar, int ac, int br, int bc)
{
    b[i][j]=h;
    if (b[i-1][j]!=h&&b[i-1][j]!=-1&&i>0&&i-1>=ac)vis(i-1,j,ar,ac,br,bc);
    if (b[i][j-1]!=h&&b[i][j-1]!=-1&&j>0&&j-1>=ar)vis(i,j-1,ar,ac,br,bc);
    if (b[i+1][j]!=h&&b[i+1][j]!=-1&&i<=c-1&&i+1<=bc)vis(i+1,j,ar,ac,br,bc);
    if (b[i][j+1]!=h&&b[i][j+1]!=-1&&j<=r-1&&j+1<=br)vis(i,j+1,ar,ac,br,bc);
}
int f(int i,int j,int ar, int ac, int br, int bc)
{
    if (b[i][j]==h||b[i][j]==-1)
    {
        return 0;
    }
    vis(i,j,ar,ac,br,bc);
    return 1;
}
int colour(int ar, int ac, int br, int bc)
{
    o=0;
    for (int i=ac;i<=bc;i++)
    {
        for (int j=ar;j<=br;j++)
        {
            o+=f(i,j,ar,ac,br,bc);
        }
    }
    h++;
    return o;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 5 ms 716 KB Output is correct
3 Correct 17 ms 928 KB Output is correct
4 Correct 17 ms 904 KB Output is correct
5 Runtime error 40 ms 716 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

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

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 775 ms 907644 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 5 ms 716 KB Output is correct
3 Correct 17 ms 928 KB Output is correct
4 Correct 17 ms 904 KB Output is correct
5 Runtime error 40 ms 716 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 5 ms 716 KB Output is correct
3 Correct 17 ms 928 KB Output is correct
4 Correct 17 ms 904 KB Output is correct
5 Runtime error 40 ms 716 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -