Submission #1059364

#	Time	Username	Problem	Language	Result	Execution time	Memory
1059364		SN0WM4N	Crossing (JOI21_crossing)	C++14	26 / 100	7038 ms	5320 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sort undefined_function // To use stable_sort instead sort 
#define bpc __builtin_popcount
#define ull unsigned long long
#define ld double
#define ll long long
#define mp make_pair
#define F first
#define S second
 
#pragma GCC optimize("O3")
 
using namespace __gnu_pbds;
using namespace std;
 
typedef tree<long long, null_type, less_equal<long long>,
    rb_tree_tag, tree_order_statistics_node_update> Tree;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const ll INF = 9223372036854775807LL;
const ll inf = 2147483647;
const ll MOD = 998244353; //[998244353, 1e9 + 7, 1e9 + 13]
const ld PI = acos(-1);
const ll NROOT = 300;
 
ll binpow(ll a, ll b, ll _MOD = -1) {
        if (_MOD == -1)
                _MOD = MOD;
        ll res = 1;
        for (; b; b /= 2, a *= a, a %= _MOD)
                if (b & 1) res *= a, res %= _MOD;
        return res;
}
 
void set_IO(string s) {
#ifndef LOCAL
        string in  = s +  ".in";
        string out = s + ".out";
        freopen(in.c_str(),  "r",  stdin);
        freopen(out.c_str(), "w", stdout);
#endif
}
 
bool dataOverflow(ll a, ll b) {return (log10(a) + log10(b) >= 18);}
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
ll ceil(ll a, ll b) {return (a + b - 1) / b;}
 
string match(string a, string b) {
        string ans = a;
        for (int i = 0; i < (int)a.size(); i ++) {
                if (a[i] == b[i]) {
                        ans[i] = a[i];
                } else {
                        set<char> s = {'J', 'O', 'I'};
                        s.erase(s.find(a[i]));
                        s.erase(s.find(b[i]));
                        ans[i] = *s.begin();
                }
        }
        return ans;
}

int32_t main() {
        ios_base::sync_with_stdio(0);
        cin.tie(0);

        int n;
        cin >> n;

        set<string> c;
        for (int i = 1; i <= 3; i ++) {
                string s;
                cin >> s;

                c.insert(s);
        }

        bool ok = 1;
        while (ok && c.size() <= 1e4) {
                set<string> aux;
                ok = 0;
                for (auto &a : c) {
                        for (auto &b : c) {
                                string d = match(a, b);
                                if (!c.count(d))
                                        ok = 1;
                                aux.insert(d);
                        }
                }

                for (auto &x : aux)
                        c.insert(x);
        }       

        int q;
        cin >> q;
        string t;
        cin >> t;

        cout << (c.count(t) ? "Yes\n" : "No\n");

        while (q --) {
                int l, r; char m;
                cin >> l >> r >> m;
                l --; r --;

                for (int i = l; i <= r; i ++)
                        t[i] = m;

                cout << (c.count(t) ? "Yes\n" : "No\n");
        }

        return 0;
}

Compilation message (stderr)

Main.cpp: In function 'void set_IO(std::string)':
Main.cpp:41:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |         freopen(in.c_str(),  "r",  stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen(out.c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 0 / 23
• Subtask 3: 23 / 23
• Subtask 4: 0 / 51