Submission #491634

#	Time	Username	Problem	Language	Result	Execution time	Memory
491634		Carmel_Ab1	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	26 ms	308 KiB

dango_maker

#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 double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t: a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


void solve();

int main() {
    GLHF;
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
}

void solve() {
    int n,m;
    cin >> n >> m;
    vector<string>a(n);
    read(a);

    vvi g;
    vector<vvi>who(n,vvi(m));

    int timer=0;
    for(int i=0; i<n ;i++)
        for(int j=0; j<m; j++){

            if(!(i+2<n && a[i][j]=='R' && a[i+1][j]=='G' && a[i+2][j]=='W') )
                continue;
            g.pb({});
            if(i+2<n && a[i][j]=='R' && a[i+1][j]=='G' && a[i+2][j]=='W'){
                for(vi v:{who[i][j],who[i+1][j],who[i+2][j]})
                    for(int x:v)
                        g[timer].pb(x),g[x].pb(timer);
                who[i][j].pb(timer);
                who[i+1][j].pb(timer);
                who[i+2][j].pb(timer);
            }

            timer++;
        }

    for(int i=0; i<n; i++)
        for(int j=0; j<m; j++){
            if(!(j+2<m && a[i][j]=='R' && a[i][j+1]=='G' && a[i][j+2]=='W'))
                continue;
            g.pb({});
            if(j+2<m && a[i][j]=='R' && a[i][j+1]=='G' && a[i][j+2]=='W'){
                for(vi v:{who[i][j],who[i][j+1],who[i][j+2]})
                    for(int x:v)
                        g[timer].pb(x),g[x].pb(timer);

                who[i][j].pb(timer);
                who[i][j+1].pb(timer);
                who[i][j+2].pb(timer);
            }
            timer++;
        }
    n=g.size();
    for(int i=0; i<n; i++){
        sort(all(g[i]));
        g[i]=UNQ(g[i]);
    }
    if(n>20)out(-1)
    int ans=0;
    for(int i=0; i<(1<<n); i++){
        vi cur;
        for(int j=0; j<n; j++)
            if(i&(1<<j))
                cur.pb(j);
        bool ok=1;
        for(int u:cur)
            for(int v:cur)
                if(binary_search(all(g[u]),v))
                    ok=0;
        if(ok)
            ans=max(ans,__builtin_popcount(i));
    }
    out(ans)
}

Compilation message (stderr)

dango_maker.cpp: In function 'void usaco(std::string)':
dango_maker.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:58:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 67