제출 #1232490

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1232490		peyman_sf	Radio (COCI22_radio)	C++20	10 / 110	1602 ms	254864 KiB

Main

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;

const ll maxn = 1e6 + 5;
const ll mod = 1e9 + 7;
const ll inf = 2e18;

#define TextIO ifstream fileIn("input.txt"); cin.rdbuf(fileIn.rdbuf()); ofstream fileOut("output.txt"); cout.rdbuf(fileOut.rdbuf());
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define print(x) for (auto i : x) cout << i << ' '; cout << endl
#define out(x) {cout << x << endl; return;}
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define endl '\n'

ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b);}
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
ll pw(ll a, ll b, ll md = mod) {ll res = 1; b = max(b, 0ll); while(b) {if (b & 1){res = (a * res) % md;} a = (a * a) % md; b >>= 1;} return (res % md);}

ll n, q;
vll d[maxn];
multiset<ll> seg[4 * maxn];
ll vis[maxn];
ll ans[1000];

void upd(ll x, ll ty, ll id = 1, ll l = 1, ll r = n + 1) {
    for (auto &a : d[x]) {
        if (ty) seg[id].insert(a);
        else seg[id].erase(seg[id].find(a));
    }

    if (r - l == 1) return;
    ll m = (l + r) / 2;
    if (x < m) upd(x, ty, id << 1, l, m);
    else upd(x, ty, id << 1 | 1, m, r);
}

void get(ll s, ll e, ll id = 1, ll l = 1, ll r = n + 1) {
    if (e <= l || s >= r) return;
    if (s <= l && e >= r) {
        for (ll i = 0; i < 1000; i++)
            ans[i] += seg[id].count(i);

        return;
    }
    ll m = (l + r) / 2;
    get(s, e, id << 1, l, m);
    get(s, e, id << 1 | 1, m, r);
}

void solve() {
    cin >> n >> q;
    ll ind = 0;;
    for (ll i = 2; i <= n; i++) {
        if (d[i].size() == 0) {
            for (ll j = i; j <= n; j+=i)
                d[j].pb(ind);

            ind++;
        }
    }

    while (q--) {
        char t;
        cin >> t;
        if (t == 'S') {
            ll x;
            cin >> x;
            if (vis[x]) {
                upd(x, 0);
                vis[x] = 0;
            }
            else {
                upd(x, 1);
                vis[x] = 1;
            }
        }

        else {
            ll l, r;
            cin >> l >> r;
            fill(ans, ans + 1000, 0);
            get(l, r + 1);
            ll f = 0;
            for (ll i = 0; i < 1000; i++) {
                if (ans[i] > 1)
                    f = 1;
            }

            cout << (f ? "DA" : "NE") << endl;
        }
    }
    
}

int main() {
    FastIO
    ll t = 1;
    // cin >> t;
    while (t--)
        solve();

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 30
• Subtask 3: 0 / 70