Submission #397052

#	Time	Username	Problem	Language	Result	Execution time	Memory
397052		khangal	Land of the Rainbow Gold (APIO17_rainbow)	C++14	0 / 100	24 ms	29308 KiB

rainbow

#include "rainbow.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef vector<long long> vl;
typedef pair<long long , long long > pl;
const int N=1e6+1;
#define po pop_back
#define pb push_back
#define mk make_pair
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define boost ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18 
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll sz,n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<ll> v[1234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
void init(int R, int C, int sr, int sc, int M, char *S) {
    string s;
    n=R;m=C;
    s=S;
    x = sr;
    y = sc;
    c1[x][y]=1;
    for(auto u:s){
        if(u=='N'){
            x--;
        }
        if(u=='S'){
            x++;
        }
        if(u=='W'){
            y--;
        }
        if(u=='E'){
            y++;
        }
        c1[x][y]=MAX;
    }
}
int colour(int ar,int ac,int br,int bc){
        ll a,b,aa,bb,x,y,xx,yy;
        a = ar;
        b = ac;
        aa = br;
        bb = bc; 
        x = max(a,aa);
        xx = min(a,bb);
        y = max(b,bb);
        yy = min(b,bb);
        rep(i,xx,x){
            rep(j,yy,y){
                if(c1[i][j]!=MAX)c1[i][j]=0;
            }
        }
        ans=0;
        rep(i,xx,x){
            rep(j,yy,y){
                if(c1[i][j]==0){
                    ans++;
                    queue<pl> q;
                    q.push({i,j});
                    while(q.size()){
                        pl p=q.front();
                        ll a,b;
                        a=p.ff;
                        b=p.ss;
                        c1[a][b]=1;
                        q.pop();
                        rep(k,0,3){
                            if(a+dx[k] <= x && a+dx[k] >= xx &&b+dy[k] <= y && b+dy[k] >= yy && c1[a+dx[k]][b+dy[k]]==0)q.push({a+dx[k] , b+dy[k]});
                        }
                    }
                }
            }
        }
        return ans;
}

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