제출 #948957

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
948957		vjudge1	Land of the Rainbow Gold (APIO17_rainbow)	C++17	0 / 100	1 ms	348 KiB

rainbow

#include <bits/stdc++.h>
#include "rainbow.h"
#define endl '\n'
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define fo(i,n) for(auto i =0 ; i < n;i++)
#define fore(i,l,r) for(auto i = l; i < r;i++)
#define forex(i,r,l) for(auto i = r; i >= l; i--)
#define ffo(i,n) forex(i,n-1,0)
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define vii vector<ii>
using namespace std;
using ii = pair<int,int>; using ll = long long; using ull = unsigned long long;
using vi = vector<ll>;
void valid(int in){cout<<((in)?"YES\n":"NO\n");return;}
vii posit;
void init(int n, int m, int sr ,int sc, int movs, char *moves){
    posit.pb({sr,sc});
    fo(i,movs){
        if(moves[i] == 'N')sr--;
        else if(moves[i]=='S')sr++;
        else if(moves[i]=='E')sc++;
        else if(moves[i]=='W')sc--;
        posit.pb({sr,sc});
    }
}
int colour(int r1, int c1, int r2 ,int c2){
    vi cont(c2+1, 0);
    for(auto v : posit){
        if(v.f >= r1 and v.f <= r2 and v.s >= c1+1 and v.s <= c2){
            cont[v.s]++;
        }
    }int con = 0;
    fore(i,c1,c2+1){
        con += (cont[i] == r2-r1+1);
    }return con + (cont[c2] != r2-r1+1);
}

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