oj.uz

Submission #1058114

# Submission time Handle Problem Language Result Execution time Memory
1058114 2024-08-14T08:33:39 Z manhlinh1501 Radio (COCI22_radio) C++17
10 / 110
 226 ms 428608 KB 
#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const int MAXN = 1e6 + 5;
const int MAXP = 170;

int N, Q;
int prime[MAXN];
vector<int> vp;
int cnt[MAXN];
bool appear[MAXN];

struct fenwick {
    int tree[MAXN];

    void update(int x, int v) {
        for(; x < MAXN; x += (x & -x))
            tree[x] += v;
    }

    int calc(int x) {
        int res = 0;
        for(; x; x -= (x & -x))
            res += tree[x];
        return res;
    }

    int range(int l, int r) {
        return calc(r) - calc(l - 1);
    }
} BIT[MAXP];

void sieve() {
    iota(prime, prime + MAXN + 1, 0);
    for(int i = 2; i * i < MAXN; i++) {
        if(prime[i] == i) {
            for(int j = i * i; j < MAXN; j += i)
                prime[j] = i;
        }
    }
    for(int i = 2; i * i < MAXN; i++) {
        if(i == prime[i])
            vp.emplace_back(i);
    }
    cerr << vp.size();
}

signed main() {
    if(fopen("code.inp", "r")) {
        freopen("code.inp", "r", stdin);
        freopen("code.out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    sieve();
    cin >> N >> Q;
    while(Q--) {
        char type;
        cin >> type;
        if(type == 'S') {
            int x;
            cin >> x;
            for(int i = 0; i < vp.size(); i++) {
                if(x % vp[i] == 0) {
                    BIT[i].update(x, (appear[x] == true ? -1 : 1));
                }
            }
            appear[x] ^= 1;
        } else {
            int l, r;
            cin >> l >> r;
            bool ok = true;
            for(int i = 0; i < vp.size(); i++) {
                if(BIT[i].range(l, r) > 1)
                    ok = false;
            }
            cout << (ok ? "NE" : "DA") << "\n";
        }
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:64:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |             for(int i = 0; i < vp.size(); i++) {
      |                            ~~^~~~~~~~~~~
Main.cpp:74:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |             for(int i = 0; i < vp.size(); i++) {
      |                            ~~^~~~~~~~~~~
Main.cpp:50:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |         freopen("code.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen("code.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void sieve()':
Main.cpp:34:9: warning: array subscript 1000006 is outside array bounds of 'int [1000005]' [-Warray-bounds]
   34 |     iota(prime, prime + MAXN + 1, 0);
      |     ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:8:5: note: while referencing 'prime'
    8 | int prime[MAXN];
      |     ^~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 32856 KB Output is correct
2 Correct 5 ms 39260 KB Output is correct
3 Correct 6 ms 49848 KB Output is correct
4 Correct 8 ms 43608 KB Output is correct
5 Correct 7 ms 55900 KB Output is correct
6 Correct 7 ms 61788 KB Output is correct
7 Correct 8 ms 65880 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 352848 KB Output is correct
2 Correct 201 ms 390860 KB Output is correct
3 Correct 226 ms 428608 KB Output is correct
4 Incorrect 28 ms 220752 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 32856 KB Output is correct
2 Correct 5 ms 39260 KB Output is correct
3 Correct 6 ms 49848 KB Output is correct
4 Correct 8 ms 43608 KB Output is correct
5 Correct 7 ms 55900 KB Output is correct
6 Correct 7 ms 61788 KB Output is correct
7 Correct 8 ms 65880 KB Output is correct
8 Correct 125 ms 352848 KB Output is correct
9 Correct 201 ms 390860 KB Output is correct
10 Correct 226 ms 428608 KB Output is correct
11 Incorrect 28 ms 220752 KB Output isn't correct
12 Halted 0 ms 0 KB -