oj.uz

Submission #948517

# Submission time Handle Problem Language Result Execution time Memory
948517 2024-03-18T07:28:09 Z vjudge1 Land of the Rainbow Gold (APIO17_rainbow) C++17
11 / 100
 3000 ms 1048576 KB 
#include "rainbow.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
int n,m,t,q;
int used[1005][1005];
vector< vector< int> > a;
void dfs(int x, int y, int x1, int x2, int y1, int y2){
	if(used[x][y]) return;
	if(x<x1 || x>x2 || y<y1 || y>y2 || a[x][y]) return;
	used[x][y]=1;
	dfs(x-1,y,x1,x2,y1,y2);
	dfs(x+1,y,x1,x2,y1,y2);
	dfs(x,y-1,x1,x2,y1,y2);
	dfs(x,y+1,x1,x2,y1,y2);
}
void init(int R, int C, int sr, int sc, int M, char *S) {
	n=R,m=C;
	int x=sr,y=sc;
	t=M;
	a.resize(n+1,vector<int>(m+1));
	a[x][y]=1;
	for(int i=0;i<t;i++){
		char c=S[i];
		if(c=='N') x--;
		else if(c=='S') x++;
		else if(c=='E') y++;
		else y--;
		a[x][y]=1;
	}
	
}

int colour(int ar, int ac, int br, int bc) {
    if(n==2){
	}
	else{
		int x1=ar,x2=br,y1=ac,y2=bc;
		for(int i=x1;i<=x2;i++)
			for(int j=y1;j<=y2;j++) used[i][j]=0;
		int ans=0;
		for(int i=x1;i<=x2;i++){
			for(int j=y1;j<=y2;j++){
				if(!used[i][j] && !a[i][j]){
					ans++;
					dfs(i,j,x1,x2,y1,y2);
				}
			}
		}
		return ans;
	}
}

Compilation message

rainbow.cpp: In function 'int colour(int, int, int, int)':
rainbow.cpp:58:1: warning: control reaches end of non-void function [-Wreturn-type]
   58 | }
      | ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 5 ms 2652 KB Output is correct
3 Correct 13 ms 2652 KB Output is correct
4 Correct 13 ms 2648 KB Output is correct
5 Correct 5 ms 2748 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 10 ms 2652 KB Output is correct
12 Correct 9 ms 2652 KB Output is correct
13 Correct 7 ms 2652 KB Output is correct
14 Correct 5 ms 2652 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Execution timed out 3049 ms 5176 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 515 ms 1048576 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 5 ms 2652 KB Output is correct
3 Correct 13 ms 2652 KB Output is correct
4 Correct 13 ms 2648 KB Output is correct
5 Correct 5 ms 2748 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 10 ms 2652 KB Output is correct
12 Correct 9 ms 2652 KB Output is correct
13 Correct 7 ms 2652 KB Output is correct
14 Correct 5 ms 2652 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Execution timed out 3026 ms 18776 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 5 ms 2652 KB Output is correct
3 Correct 13 ms 2652 KB Output is correct
4 Correct 13 ms 2648 KB Output is correct
5 Correct 5 ms 2748 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 10 ms 2652 KB Output is correct
12 Correct 9 ms 2652 KB Output is correct
13 Correct 7 ms 2652 KB Output is correct
14 Correct 5 ms 2652 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Execution timed out 3026 ms 18776 KB Time limit exceeded
19 Halted 0 ms 0 KB -