Submission #258077

#	Time	Username	Problem	Language	Result	Execution time	Memory
258077		mohammad	Land of the Rainbow Gold (APIO17_rainbow)	C++14	0 / 100	3070 ms	21296 KiB

rainbow

#include "rainbow.h"
#include<bits/stdc++.h>
using namespace std;
 
#define endl "\n"
#define OR |
typedef long long ll ;
const ll ooo = 1e14 ;
const ll oo = 2e9 ;
const double PI = acos(-1) ;
const ll M = 1e9 + 7  ;
const int N = 10000010  ;

int r[4] = {1 , -1 , 0 , 0} ,
	c[4] = {0 , 0 , 1 , -1} ;
map<char,int> mp;
string g[52];

void init(int R, int C, int sr, int sc, int M, char *S) {
	mp['N'] = 1;
	mp['S'] = 0;
	mp['E'] = 2;
	mp['W'] = 3;
	for(int i = 1 ; i <= R ; ++i)
		for(int j = 0 ; j <= C ; ++j) g[i] += '.';
	g[sr][sc] = '#';
	for(int i = 0 ; i < M ; ++i){
		sr += r[mp[S[i]]];
		sc += c[mp[S[i]]];
		g[sr][sc] = '#';
	}
}
// 	g++ -Wall -lm -static -DEVAL -o rainbow -O2 rainbow.cpp grader.cpp -std=c++14
int colour(int ar, int ac, int br, int bc) {
	int ans = 0 ;
    for(int i = ar ; i <= br ; ++i)
    	for(int j = ac ; j <= bc ; ++j){
    		if(g[i][j] == '#') continue;
    		bool b = 1 ;
    		if(i != ar && g[i-1][j] == '.') b = 0;
    		if(j != ac && g[i][j-1] == '.') b = 0;
    		ans += b;
    	}
    return ans ;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 12
• Subtask 3: 0 / 24
• Subtask 4: 0 / 27
• Subtask 5: 0 / 26